Community Detection in Social Networks

  • Fataneh Dabaghi-Zarandi
  • Marjan Kuchaki RafsanjaniEmail author
Part of the Studies in Systems, Decision and Control book series (SSDC, volume 179)


Over recent years, the usage of social, biologic, communication and the World Wide Web networks is widely increased. Each of these networks consists of many complex and various data that can be modeled as a graph. This graph is composed of a set of nodes and edges that each node model an entity in these networks and connection between two entities is defined as an edge. In this regard, to have a better understanding of organizations and functions in these networks, graph nodes can be classified in different groups. Each group of nodes is called community that its nodes have more similarity with each other. Therefore, community detection is an important field to understand the topology and functions of networks. In this chapter, we introduce several method in community detection and compare them together.


Community detection Social networks Structural similarity Attribute-structural similarity Modularity 


  1. Arab, M., Afsharchi, M.: Community detection in social networks using hybrid merging of sub-communities. J. Netw. Comput. Appl. 40, 73–84 (2014)CrossRefGoogle Scholar
  2. Blondel, V.D., Guillaume, J.-L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. 2008(10), 10008 (2008)CrossRefGoogle Scholar
  3. Boobalan, M.P., Lopez, D., Gao, X.Z.: Graph clustering using k-neighbourhood attribute structural similarity. Appl. Soft Comput. 47, 216–223 (2016)CrossRefGoogle Scholar
  4. Bullmore, E., Sporns, O.: Complex brain networks: graph theoretical analysis of structural and functional systems. Nat. Rev. Neurosci. 10(3), 186–198 (2009)CrossRefGoogle Scholar
  5. Danon, L., Diaz-Guilera, A., Duch, J., Arenas, A.: Comparing community structure identification. J. Stat. Mech. Theory Exp. 2005(09), P09008 (2005)CrossRefGoogle Scholar
  6. Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press (2010)Google Scholar
  7. Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. Knowl. Discov. Data Min. (KDD) 96(34), 226–231 (1996)Google Scholar
  8. Eustace, J., Wang, X., Cui, Y.: Community detection using local neighborhood in complex networks. Phys. A: Stat. Mech. Appl. 436, 665–677 (2015)MathSciNetCrossRefGoogle Scholar
  9. Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3), 75–174 (2010)MathSciNetCrossRefGoogle Scholar
  10. Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821–7826 (2002)MathSciNetCrossRefGoogle Scholar
  11. Huang, J., Sun, H., Han, J., Feng, B.: Density-based shrinkage for revealing hierarchical and overlapping community structure in networks. Phys. A: Stat. Mech. Appl. 390(11), 2160–2171 (2011)CrossRefGoogle Scholar
  12. Kim, Y., Son, S.-W., Jeong, H.: Finding communities in directed networks. Phys. Rev. E 81(1), 016103 (2010)CrossRefGoogle Scholar
  13. Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78(4), 046110 (2008)CrossRefGoogle Scholar
  14. Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Int. Math. 6(1), 29–123 (2009)MathSciNetzbMATHGoogle Scholar
  15. Leskovec, J., Lang, K.J., Mahoney, M.: Empirical comparison of algorithms for network community detection. In: Proceedings of the 19th ACM International Conference on World Wide Web, Raleigh, North Carolina, USA, pp. 631–640 (2010)Google Scholar
  16. Li, C.: Study on overlapping community structure. Procedia Eng. 29, 4244–4248 (2012)CrossRefGoogle Scholar
  17. Li, W., Huang, C., Wang, M., Chen, X.: Stepping community detection algorithm based on label propagation and similarity. Phys. A: Stat. Mech. Appl. 472, 145–155 (2017)CrossRefGoogle Scholar
  18. Lipkus, A.H.: A proof of the triangle inequality for the tanimoto distance. J. Math. Chem. 26(1), 263–265 (1999)CrossRefGoogle Scholar
  19. Lu, H., Wei, H.: Detection of community structure in networks based on community coefficients. Phys. A: Stat. Mech. Appl. 391(23), 6156–6164 (2012)CrossRefGoogle Scholar
  20. Meyerhenke, H.: Dimacs (2017). Accessed 10 June 2017Google Scholar
  21. Newman, M.: Network data (2017). Accessed 10 June 2017Google Scholar
  22. Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)CrossRefGoogle Scholar
  23. Saoud, B., Moussaoui, A.: Community detection in networks based on minimum spanning tree and modularity. Phys. A: Stat. Mech. Appl. 460, 230–234 (2016)CrossRefGoogle Scholar
  24. Urban, R., Hošková-Mayerová, S.: Threat life cycle and its dynamics. DETUROPE-Cent. Eur. J. Reg. Dev. Tourism 9(2), 93–109 (2017)Google Scholar
  25. Zhou, Y., Cheng, H., Yu, J.X.: Graph clustering based on structural/attribute similarities. Proc. VLDB Endow. 2(1), 718–729 (2009)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Fataneh Dabaghi-Zarandi
    • 1
  • Marjan Kuchaki Rafsanjani
    • 1
    Email author
  1. 1.Department of Computer Science, Faculty of Mathematics and ComputerShahid Bahonar University of KermanKermanIran

Personalised recommendations