Journal of Computer Science and Technology

, Volume 23, Issue 4, pp 672–683 | Cite as

Community Detection in Complex Networks

  • Nan DuEmail author
  • Bai Wang
  • Bin Wu
Regular Paper


With the rapidly growing evidence that various systems in nature and society can be modeled as complex networks, community detection in networks becomes a hot research topic in physics, sociology, computer society, etc. Although this investigation of community structures has motivated many diverse algorithms, most of them are unsuitable when dealing with large networks due to their computational cost. In this paper, we present a faster algorithm ComTector, which is more efficient for the community detection in large complex networks based on the nature of overlapping cliques. This algorithm does not require any priori knowledge about the number or the original division of the communities. With respect to practical applications, ComTector is challenging with five different types of networks including the classic Zachary Karate Club, Scientific Collaboration Network, South Florida FreeWord Association Network, Urban Traffic Network, North America Power Grid and the Telecommunication Call Network. Experimental results show that our algorithm can discover meaningful communities that meet both the objective basis and our intuitions.


complex networks community detection social network analysis 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Supplementary material

11390_2008_9163_MOESM1_ESM.pdf (107 kb)
(PDF 106 kb)


  1. [1]
    Watts D J, Strogatz S H. Collective dynamics of “small-world” networks. Nature, 393(6684): 440–442.Google Scholar
  2. [2]
    Watts D J. Small Worlds: The Dynamics of Networks Between Order and Randomness. Levin S A, Strogatz S H (eds.), Princeton: Princeton University Press, 1999.Google Scholar
  3. [3]
    Boccaletti S, Latora V, Moreno Y. Complex networks: Structure and dynamics. Physics Reports, 424(4/5): 175–308.Google Scholar
  4. [4]
    Newman M E J. The structure and function of complex networks. SIAM Review, 45(2): 167–256.Google Scholar
  5. [5]
    Wasserman S, Faust K. Social Network Analysis. Cambridge: Cambridge University Press, 1994.Google Scholar
  6. [6]
    Scott J. Social Network Analysis: A Handbook. London: Sage Publications, 2002.Google Scholar
  7. [7]
    Milo R, Itzkovitz S et al. Network motifs: Simple building blocks of complex networks. Science, 298(5594): 824–827.Google Scholar
  8. [8]
    Newman M E J. Modularity and community structure in networks. PNAS, 103(23): 8577.Google Scholar
  9. [9]
    Girvan M, Newman M E J. Community structure in social and biological networks. PNAS, 99(12): 7821–7826.Google Scholar
  10. [10]
    Duch J, Arenas A. Community detection in complex networks using extremal optimization. Physical Review E, 72(2): 027104.Google Scholar
  11. [11]
    Palla G, Dernyi I, Farkas I. Uncovering the overlapping community structure of complex network in nature and society. Nature, 435(7043): 814–818.Google Scholar
  12. [12]
    Fiedler M. Algebraic connectivity of graphs. Czechoslovak Mathematical Journal, 23(98): 298–305.Google Scholar
  13. [13]
    Pothen A, Simon H, Liou K-P. Partitioning sparse matrices with eigenvectors of graphs. SIAM J Matrix Anal App., 11(33): 430–452.Google Scholar
  14. [14]
    Kernighan B W, Lin S. A efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49(2): 291–307.Google Scholar
  15. [15]
    Newman M E J. Detecting community structure in networks. Eur. Phys. J. B, 38(2): 321–330.Google Scholar
  16. [16]
    Bron C, Kerbosch J. Finding all cliques of an undirected graph. Communications of the ACM , 16(9): 575–577.Google Scholar
  17. [17]
    Du N, Wu B, Wang B et al. A parallel algorithm for enumerating all maximal cliques in complex networks. In Proc. The 6th ICDM2006 Workshop, Hong Kong, 2006, pp.320–324.Google Scholar
  18. [18]
    Wu B, Pei X et al. A parallel algorithm for enumerating all the maximal k-plexes. In Proc. PAKDD07 Workshops, Nanjing, 2007, pp.476–483.Google Scholar
  19. [19]
    Abello J, Resende M G C, Sudarsky S et al. Massive quasiclique detection. In Proc. the 5th Latin American Symposium on Theoretical Informatics, Mexico, 2002, pp.598–612.Google Scholar
  20. [20]
    Pei J, Jiang D X, Zhang A D et al. On mining cross-graph quasi-cliques. In Proc. The 12th ACM SIGKDD, Philadelphia, 2006, pp.228–237.Google Scholar
  21. [21]
    Zeng Z, Wang J, Karypis G et al. Coherent closed quasiclique discovery from large dense graph databases. In Proc. The 12th ACM SIGKDD, Philadelphia, 2006, pp.797–802.Google Scholar
  22. [22]
    Han J W, Kamber M. Data Mining: Concepts and Techniques. 2nd Edition, Morgan Kaufmann Publishers, 2006.Google Scholar
  23. [23]
    Luca Donetti, Miguel A. Munoz detecting network communities: A new systematic and efficient algorithm. Electric Journal of Statistical Mechanics, doi10.1088/1742-5468/2004/10/P10012,
  24. [24]
    Girvan M, Newman M E J. Finding and evaluating community structure in networks. Physical Review E, 69(2): 026113.Google Scholar
  25. [25]
    Radicchi F, Castellano C, Cecconi F, Loreto V, Parisi D. Defining and identifying communities in networks. PNAS, 101(9): 2658–2663.Google Scholar
  26. [26]
    Clauset A, Newman M E J, Moore C. Finding community structure in very large networks. Physical Review E, 70(6): 066111.Google Scholar
  27. [27]
    Pons P, Latapy M. Computing communities in large networks using random walks. In Proc. ISCIS2005, Istanbul, 2005, pp.284–293.Google Scholar
  28. [28]
    Clauset A. Finding local community structure in networks. Physical Review E, 72(2): 026132.Google Scholar
  29. [29]
    Yang B, Liu D Y. Force-based incremental algorithm for mining community structure in dynamic network. Journal of Computer Science and Technology, 21(3): 393–400.Google Scholar
  30. [30]
    Gunes I, Bingol H. Community detection in complex networks using agents. Cornell University Library e-prints, arXiv:cs/0610129v1,
  31. [31]
    Fortunato S, Barthelemy M. Resolution limit in community detection. PNAS, 2007, 104(1): 36–41.CrossRefGoogle Scholar
  32. [32]

Copyright information

© Springer 2008

Authors and Affiliations

  1. 1.Key Laboratory of Intelligent Telecommunications Software and MultimediaBeijing University of Posts and TelecommunicationsBeijingChina

Personalised recommendations