Skip to main content

Advertisement

Springer Nature Link
Log in

Modeling influence diffusion to uncover influence centrality and community structure in social networks

  • Original Article
  • Published:
Social Network Analysis and Mining Aims and scope Submit manuscript

Abstract

Node centrality and vertex similarity in network graph topology are two of the most fundamental and significant notions for network analysis. Defining meaningful and quantitatively precise measures of them, however, is nontrivial but an important challenge. In this paper, we base our centrality and similarity measures on the idea of influence of a node and exploit the implicit knowledge of influence-based connectivity encoded in the network graph topology. We arrive at a novel influence diffusion model, which builds egocentric influence rings and generates an influence vector for each node. It captures not only the total influence but also its distribution that each node spreads through the network. A Shared-Influence-Neighbor (SIN) similarity defined in this influence space gives rise to a new, meaningful and refined connectivity measure for the closeness of any pair of nodes. Using this influence diffusion model, we propose a novel influence centrality for influence analysis and an Influence-Guided Spherical K-means (IGSK) algorithm for community detection. Our approach not only differentiates the influence ranking in a more detailed manner but also effectively finds communities in both undirected/directed and unweighted/weighted networks. Furthermore, it can be easily adapted to the identification of overlapping communities and individual roles in each community. We demonstrate its superior performance with extensive tests on a set of real-world networks and synthetic benchmarks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  • Ahn Y, Bagrow J, Lehmann S (2010) Link communities reveal multiscale complexity in networks. arXiv:0903.3178v3 [physics.soc-ph]

  • Blondel V, Guillaume J-L, Lambiotte R, Lefebvre E (2008) The louvain method for community detection in large networks. J Stat Mech Theory Exp 10:P10008

    Article  Google Scholar 

  • Bonacich P (1972) Factoring and weighting approaches to status scores and clique identification. J Math Sociol 2:113–120

    Article  Google Scholar 

  • Brandes U, Fleischer D (2005) Centrality measures based on current flow. In: 22nd annual conference on theoretical aspects of computer science, pp 533–544

  • Christakis NA, Fowler JH (2007) The spread of obesity in a large social network over 32 years. N Engl J Med 357:370–379

    Article  Google Scholar 

  • Clauset A, Newman M, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70:066111

    Article  Google Scholar 

  • Dhillon I, Modha D (2001) Concept decompositions for large sparse text data using clustering. Mach Learn 42(1):143–175

    Article  MATH  Google Scholar 

  • Dhillon I, Guan Y, Kulis B (2005) A fast kernel-based multilevel algorithm for graph clustering. In: 11th ACM conference on knowledge discovery and data mining, pp 629–634

  • Donetti L, Muñoz M (2004) Detecting network communities: a new systematic and efficient algorithm. J Stat Mech 2004:P10012

    Article  Google Scholar 

  • Easley D, Kleinberg J (2010) Networks, crowds, and markets: reasoning about a highly connected world. Cambridge University Press, Cambridge

    Book  Google Scholar 

  • Estrada E, Hatano N (2009) Communicability graph and community structures in complex networks. J Appl Math Comput 214:500–511

    Article  MATH  Google Scholar 

  • Fortunato S (2010) Community detection in graphs. Phys Rep 486(3–5):75–174

    Article  MathSciNet  Google Scholar 

  • Fortunato S, Barthelemy M (2007) Resolution limit in community detection. Proc Natl Acad Sci USA 104(1):36–41

    Article  Google Scholar 

  • Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40:35–41

    Article  Google Scholar 

  • Freeman LC, Borgatti SP, White DR (1991) Centrality in valued graphs: a measure of betweenness based on network flow. Soc Netw 13:141–154

    Article  MathSciNet  Google Scholar 

  • Gehrke J, Ginsparg P, Kleinberg JM (2003) Overview of the 2003 kdd cup. SIGKDD Explor 5:149–151

    Article  Google Scholar 

  • Gil-Mendieta J, Schmidt S (1996) The political network in mexico. Soc Netw 18(4):355–381

    Article  Google Scholar 

  • Girvan M, Newman M (2002) Community structure in social and biological networks. Proc Natl Acad Sci USA 99(12):7821–7826

    Article  MathSciNet  MATH  Google Scholar 

  • Guimera R, Amaral L (2005) Functional cartography of complex metabolic networks. Nature 433:895–900

    Article  Google Scholar 

  • Guimera R, Sales-Pardo M, Amaral L (2004) Modularity from fluctuations in random graphs and complex networks. Phys Rev E 70:025101

    Article  Google Scholar 

  • Hajibagheri A, Alvari H, Hamzeh A, Hashemi S (2012) Community detection in social networks using information diffusion. In: 2012 IEEE/ACM international conference on advances in social networks analysis and data mining, pp 702–703

  • Hajibagheri A, Hamzeh A, Sukthankar G (2013) Modeling information diffusion and community membership using stochastic optimization. In: 2013 IEEE/ACM international conference on advances in social networks analysis and data mining, pp 175–182

  • Jarvis RA, Patrick EA (1973) Clustering using a similarity measure based on shared nearest neighbors. IEEE Trans Comput C–22(11):1025–1034

    Article  Google Scholar 

  • Jiang P, Singh M (2010) Spici: a fast clustering algorithm for large biological networks. Bioinformatics 26(8):1105–1111

    Article  Google Scholar 

  • Katz L (1953) A new status index derived from sociometric index. Psychometrika 18:39–43

    Article  MATH  Google Scholar 

  • Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: 9th ACM conference on knowledge discovery and data mining, pp 137–146

  • Lancichinetti A, Fortunato S (2009a) Community detection algorithms: a comparative analysis. Phys Rev E 80:056117(1–11)

    Google Scholar 

  • Lancichinetti A, Fortunato S (2009b) Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys Rev E 80:016118

    Article  Google Scholar 

  • Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithm. Phys Rev E 78:046110

    Article  Google Scholar 

  • Leskovec J, Lang KJ, Mahoney MW (2010) Empirical comparison of algorithms for network community detection. In: 19th international conference on world wide web, pp 631–640

  • Leung I, Hui P, Liò P, Crowcroft J (2009) Towards real-time community detection in large networks. Phys Rev E 79:066107

    Article  Google Scholar 

  • Lusseau D, Schneider K, Boisseau OJ, Haase P, Slooten E, Dawson SM (2003) The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behav Ecol Sociobiol 54:396–405

    Article  Google Scholar 

  • Malliaros F, Vazirgiannis M (2013) Clustering and community detection in directed networks: a survey. Phys Rep 533:95–142

    Article  MathSciNet  Google Scholar 

  • Michael J, Massey J (1997) Modeling the communication network in sawmill. For Prod J 47:25–30

    Google Scholar 

  • Nadler B, Lafon S, Coifman R, Kevrekidis I (2005) Diffusion maps, spectral clustering and eigenfunctions of fokker-planck operators. In: 19th annual conference on neural information processing systems

  • Newman M (2004) Analysis of weighted networks. Phys Rev E 70:056131

    Article  Google Scholar 

  • Newman M (2005) A measure of betweenness centrality based on random walks. Soc Netw 27:39–54

    Article  Google Scholar 

  • Newman M (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577–8582

    Article  Google Scholar 

  • Newman M, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69:026113

    Article  Google Scholar 

  • Noh JD, Rieger H (2004) Random walks on complex networks. Phys Rev Lett 92:11870

    Article  Google Scholar 

  • Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: bringing order to the web. In: Technical report, Stanford InfoLab. Stanford University, California

  • Palla G, Derenyi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435:814–818

    Article  Google Scholar 

  • Pons P, Latapy M (2006) Computing communities in large networks using random walks. J Graph Algorithm Appl 10(2):191–218

    Article  MathSciNet  MATH  Google Scholar 

  • Radicchi R, Castellano C, Cecconi F, Parisi D (2004) Defining and identifying communities in networks. Proc Nal Acad Sci USA 101:2658–2663

    Article  Google Scholar 

  • Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E 76:03106

    Article  Google Scholar 

  • Rosvall M, Bergstrom C (2007) An information-theoretic framework for resolving community structure in complex networks. Proc Natl Acad Sci 104:7327–7331

    Article  Google Scholar 

  • Rosvall M, Bergstrom C (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci USA 105:1118–1123

    Article  Google Scholar 

  • Sabidussi G (1966) The centrality index of a graph. Psychometrika 31:581–603

    Article  MathSciNet  MATH  Google Scholar 

  • Stephenson KA, Zelen M (1989) Rethinking centrality: methods and examples. Soc Netw 11:1–37

    Article  MathSciNet  Google Scholar 

  • Sun Y, Han J, Zhao P, Yin Z, Cheng H, Wu T (2009) RankClus: integrating clustering with ranking for heterogeneous information network analysis. In: EDBT, Saint Petersburg, Russia

  • van Dongen S (2000) Graph clustering by flow simulation. PhD thesis, University of Utrecht

  • Wang W, Street WN (2014) A novel algorithm for community detection and influence ranking in social networks. In: 2014 IEEE/ACM international conference on advances in social networks analysis and data mining, pp 555–560

  • Wasserman S, Faust K (1994) Social network analysis: methods and applications. Cambridge University Press, Cambridge

    Book  Google Scholar 

  • Xie J, Kelley S, Szymanski BK (2013) Overlapping community detection in networks: the state-of-the-art and comparative study. ACM Comput Surv 45(4):1–35

    Article  Google Scholar 

  • Yang Y, Sun Y, Pandit S, Chawla N, Han J (2011) Is objective function the silver bullet? A case study of community detection algorithms on social networks. In: 2011 IEEE/ACM international conference on advances in social networks analysis and data mining, pp 394–397

  • Yen L, Fouss F, Decaestecker C, Francq P, Saerens M (2009) Graph nodes clustering with the sigmoid commute-time kernel: a comparative study. J Data Knowl Eng 68:338–361

    Article  Google Scholar 

  • Zachary W (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33:452–473

    Google Scholar 

Download references

Acknowledgments

We thank the anonymous reviewers for their insightful remarks and suggestions that allow us to improve significantly the quality of this paper.

Author information

Authors and Affiliations

  1. Department of Management Sciences, University of Iowa, Iowa City, IA, USA

    Wenjun Wang & W. Nick Street

Authors
  1. Wenjun Wang
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. W. Nick Street
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Wenjun Wang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, W., Street, W.N. Modeling influence diffusion to uncover influence centrality and community structure in social networks. Soc. Netw. Anal. Min. 5, 15 (2015). https://doi.org/10.1007/s13278-015-0254-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s13278-015-0254-4

Keywords