Encyclopedia of Social Network Analysis and Mining

2018 Edition
| Editors: Reda Alhajj, Jon Rokne

Detecting and Identifying Communities in Dynamic and Complex Networks: Definition and Survey

  • Mahadevan VasudevanEmail author
  • Narsingh Deo
Reference work entry
DOI: https://doi.org/10.1007/978-1-4939-7131-2_380



Community identification

Extracting a community, which a given node belongs to


Locally dense subgraph in large globally sparse graph


Nondeterministic polynomial time complexity


The frequency of an event varies as a power of the event’s attribute


Complex networks such as the Internet, the World Wide Web (WWW), and various social and biological networks are viewed as large, dynamic graphs, with properties significantly different from those of the classic Erdös-Rényi random graphs. In particular, properties such as degree distribution, network distance, transitivity, and clustering coefficient have been empirically shown to diverge from classical random networks. Existence of communities is one such property inherent to these networks. A community may be defined informally as a locally dense subgraph, of a significant size, in a large, globally sparse graph....

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


  1. Agarwal N, Liu H, Tang L, Yu P (2011) Modeling blogger influence in a community. Soc Netw Anal Min 2(2):1–24Google Scholar
  2. Alba RD (1973) A graph-theoretic definition of a sociometric clique. J Math Sociol 3:113–126MathSciNetzbMATHCrossRefGoogle Scholar
  3. Albert R, Jeong H, Barabasi A (1999) Diameter of the world-wide web. Nature 401:130–131CrossRefGoogle Scholar
  4. Arenas A, Fernández A, Gómez A (2008) Analysis of the structure of complex networks at different resolution levels. New J Phys 10(5):053039CrossRefGoogle Scholar
  5. Caci B, Cardaci M, Tabacchi M (2011) Facebook as a small world: a topological hypothesis. Soc Netw Anal Min 2(2):1–5Google Scholar
  6. Cami A, Deo N (2007) Techniques for analyzing dynamic random graph models of web-like networks: an overview. Networks 51:211–255MathSciNetzbMATHCrossRefGoogle Scholar
  7. Cano P, Celma O, Koppenberger M, Buldú JM (2005a) The topology of music recommendation networks. arXiv:physics/0512266v1Google Scholar
  8. Cano P, Koppenberger M, Wack N (2005b) Content-based music audio recommendation. In: Proceedings of the 13th annual ACM international conference on multimedia, ACM, Hilton, 1101181, pp 211–212Google Scholar
  9. Chintalapudi SR, Prasad MHMK (2015) A survey on community detection algorithms in large scale real world networks. In: Computing for sustainable global development (INDIACom), 2015 2nd international conference on, New Delhi, pp 1323–1327Google Scholar
  10. Deo N (1974) Graph theory with applications to engineering and computer science. Prentice-Hall, Inc, Upper Saddle RiverzbMATHGoogle Scholar
  11. Erdös P, Rényi A (1959) On random graphs. Publ Math Debrecen 6:290–297MathSciNetzbMATHGoogle Scholar
  12. Flake GW, Lawrence S, Giles CL (2000) Efficient identification of web communities. In: Proceedings of the 6th ACM SIGKDD International conference on knowledge discovery and data mining, ACM, Boston, pp 150–160Google Scholar
  13. Fortunato S (2010) Community detection in graphs. Phys Rep 486:75–174MathSciNetCrossRefGoogle Scholar
  14. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New YorkzbMATHGoogle Scholar
  15. Girvan M, Newman MEJ (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026113CrossRefGoogle Scholar
  16. Goh K-I, Cusick ME, Valle D, Childs B, Vidal M, Barabási A-L (2007) The human disease network. Proc Natl Acad Sci 104:8685–8690CrossRefGoogle Scholar
  17. Hu Y, Chen H, Zhang P, Li M, Di Z, Fan Y (2008) Comparative definition of community and corresponding identifying algorithm. Phys Rev E 78(2):026121CrossRefGoogle Scholar
  18. Kumpula JM et al (2007) Limited resolution in complex network community detection with Potts model approach. Eur Phys J B 56(1):41–45CrossRefGoogle Scholar
  19. Leskovec J, Singh A, Kleinberg J (2006) Patterns of influence in a recommendation network. Springer, Berlin/Heidelberg, pp 380–389Google Scholar
  20. Lu Z et al (2015) Algorithms and applications for community detection in weighted networks. IEEE Trans Parallel Distrib Syst 26(11):2916–2926CrossRefGoogle Scholar
  21. Luccio F, Sami M (1969) On the decomposition of networks in minimally interconnected subnetworks. IEEE Trans Circuit Theory 16:184–188MathSciNetCrossRefGoogle Scholar
  22. Luce R, Perry A (1949) A method of matrix analysis of group structure. Psychometrika 14:95–116MathSciNetCrossRefGoogle Scholar
  23. Mokken RJ (1979) Cliques, clubs and clans. Qual Quant 13:161–173CrossRefGoogle Scholar
  24. Newman MEJ (2001) The structure of scientific collaboration networks. Proc Natl Acad Sci U S A 98:404–409MathSciNetzbMATHCrossRefGoogle Scholar
  25. Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45:167–256MathSciNetzbMATHCrossRefGoogle Scholar
  26. Papadopoulos S, Kompatsiaris Y, Vakali A, Spyridonos P (2012) Community detection in social media. Data Min Knowl Disc 24:515–554CrossRefGoogle Scholar
  27. Radicchi F, Castellano C, Cecconi F, Loreto V, Parisi D (2004) Defining and identifying communities in networks. Proc Natl Acad Sci U S A 101:2658–2663CrossRefGoogle Scholar
  28. Rajkumar B, Mukkadim P, Athena V (2008) Content delivery networks. Springer, BerlinGoogle Scholar
  29. Real R, Vargas JM (1996) The probabilistic basis of Jaccard’s index of similarity. Syst Biol 45(3):380–384CrossRefGoogle Scholar
  30. Scanlon JM, Deo N (2008) Network communities based on maximizing average degree. Congressus Numerantium 190:183–192MathSciNetzbMATHGoogle Scholar
  31. Seidman SB (1983) Network structure and minimum degree. Soc Networks 5:269–287MathSciNetCrossRefGoogle Scholar
  32. Shen H et al (2009) Detect overlapping and hierarchical community structure in networks. Physica A 388:1706–1712CrossRefGoogle Scholar
  33. Song Y, Zhuang Z, Li H, Zhao Q, Li J, Lee WC, Giles CL (2008) Real-time automatic tag recommendation. In: Proceedings of the 31st annual international ACM SIGIR conference on research and development in information retrieval, Singapore, ACMGoogle Scholar
  34. Sporns O (2011) The human connectome: a complex network. Ann N Y Acad Sci 1224:109–125CrossRefGoogle Scholar
  35. Strogatz SH (2001) Exploring complex networks. Nature 410:268–276zbMATHCrossRefGoogle Scholar
  36. Vasudevan M, Balakrishnan H, Deo N (2009) Community discovery algorithms: an overview. Congressus Numerantium 196:127–142MathSciNetzbMATHGoogle Scholar
  37. Watts DJ, Strogatz SH (1998) Collective dynamics of small-world networks. Nature 393:440–442zbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.EMC CorpHopkintonUSA
  2. 2.Department of EECSUniv of Central FloridaOrlandoUSA

Section editors and affiliations

  • Tansel Ozyer
    • 1
  • Ozgur Ulusoy
    • 2
  1. 1.TOBB Economics and Technology UniversityAnkaraTurkey
  2. 2.Bilkent UniversityAnkaraTurkey