Multi-Influences Co-existence Based Independent Cascade Model and Conflict Resolution Strategy in Social Networks

  • Jing WanjingEmail author
  • Chen Hong
  • Zhao Linlu
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 387)


Social Networks Influence Maximization Problem has been studied extensively and most have focused on the single influence, while few studies have focused on the Multi-influences co-existence based influence diffusion. In this paper, we extend the traditional Independent Cascade Model (ICM) and propose the Multi-influences based Independent Cascade Model (MICM), put forward two kinds of novel conflict strategy algorithms, which are the Largest Neighbor Conflict Strategy (LNCS) and Conflict Vector Transform Strategy (CVTS).We also elaborate conflict strategies from three different perspectives of propagation rules, customers and producers. To illustrate these issues, we conduct experiments with data from four real datasets, evaluate the performances of the proposed model and algorithms, demonstrate that the final numbers of influential nodes are progressive when MICM uses three different conflict selection strategies.


Social networks Multi-influences MICM Max degree algorithm Conflict strategy 



This research was supported by the “Domestic Database High Performance and High Security Key Technology Research” of HGJ Important National Science & Technology Specific Projects of China (2010ZX01042-001-002-002).


  1. 1.
    Kempe, D., Kleinberg, J.M., Tardos, E.: Maximizing the spread of influence through a social network. In: KDD (2003)Google Scholar
  2. 2.
    Wang, Y., Cong, G., Song, G., Xie, K.: Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In: Proceedings of the 16th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2010)Google Scholar
  3. 3.
    Ji, J., Han, X., Wang, Z.: Community influence maximizing based on comprehensive cascade diffuse model. J. Jilin Univ. (Sci. Ed.) 47(5), 1032–1035 (2009)Google Scholar
  4. 4.
    He, X., Song, G., Chen, W., Jiang, Q.: Influence blocking maximization in social networks under the competitive linear threshold model. arXiv technical report, 21 Oct 2011Google Scholar
  5. 5.
    Wang, N., Wang, X., Sun, Q., Zhao, L.: A computer simulation model of competing products diffusion on small-world network. In: 2008 International Seminar on Future Information Technology and Management Engineering (2008)Google Scholar
  6. 6.
    Cao, T., Wu, X., Wang, S., Hu, X.: OASNET: an optimal allocation approach to influence maximization in modular social network. In: SAC’10, 22−26 March 2010Google Scholar
  7. 7.
    Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: KDD (2009)Google Scholar
  8. 8.
    Lappas, T., Terzi, E., Gunopulos, D., Mannila, H.: Finding effectors in social networks. In: KDD (2010)Google Scholar
  9. 9.
    Li, C.-T., Lin, S.-D., Shan, M.-K.: Finding influential mediators in social networks. In: WWW (2011)Google Scholar
  10. 10.
    Kempe, D., Kleinberg, J., Tardos, É.: Influential nodes in a diffusion model for social networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1127–1138. Springer, Heidelberg (2005)Google Scholar
  11. 11.
    Kimura, M., Saito, K., Nakano, R., Motoda, H.: Extracting influential nodes on a social network for information diffusion. Data Min. Knowl. Disc. 20(1), 70–97 (2010)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Bharathi, S., Kempe, D., Salek, M.: Competitive influence maximization in social networks. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 306–311. Springer, Heidelberg (2007)Google Scholar
  13. 13.
    Even-Dar, E., Shapira, A.: A note on maximizing the spread of influence in social networks. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 281–286. Springer, Heidelberg (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.Renmin University of ChinaBeijingChina

Personalised recommendations