Community detection using coordination games

  • Radhika AravaEmail author
Original Article


Communities typically capture homophily as people of the same community share many common features. This paper is motivated by the problem of community detection in social networks, as it can help improve our understanding of the network topology and the spread of information. Given the selfish nature of humans to align with like-minded people, we employ game-theoretic models and algorithms to detect communities in this paper. Specifically, we employ coordination games to represent interactions between individuals in a social network. We represent the problem of community detection as a graph coordination game. We provide a novel and scalable two-phased probabilistic semi-supervised approach to compute an accurate overlapping community structure in the given network. We evaluate our algorithm against the best existing methods for community detection and show that our algorithm improves significantly on benchmark networks (real and synthetic) with respect to standard normalized mutual information measure.


  1. Bei X, Chen N, Dou L, Huang X, Qiang R (2013) Trial and error in influential social networks. In: Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 1016–1024. ACMGoogle Scholar
  2. Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 2008(10):P10008CrossRefGoogle Scholar
  3. Chen W, Liu Z, Sun X, Wang Y (2010) A game-theoretic framework to identify overlapping communities in social networks. Data Min Knowl Discov 21(2):224–240MathSciNetCrossRefGoogle Scholar
  4. Esquivel AV, Rosvall M (2011) Compression of flow can reveal overlapping-module organization in networks. Phys Rev X 1(2):021025Google Scholar
  5. Gaur DR, Krishnamurti R, Kohli R (2008) The capacitated max k-cut problem. Math Program 115(1):65–72MathSciNetzbMATHCrossRefGoogle Scholar
  6. Gopalan PK, Blei DM (2013) Efficient discovery of overlapping communities in massive networks. Proc Natl Acad Sci 110(36):14534–14539MathSciNetzbMATHCrossRefGoogle Scholar
  7. Granovetter MS (1973) The strength of weak ties. Am J Sociol 78(6):1360–1380CrossRefGoogle Scholar
  8. Gregory S (2010) Finding overlapping communities in networks by label propagation. New J Phys 12(10):103018CrossRefGoogle Scholar
  9. Guimer R, Amaral LAN (2005) Functional cartography of complex metabolic networks. Nature 433(7028):895–900CrossRefGoogle Scholar
  10. Hoefer M (2007) Cost sharing and clustering under distributed competition. PhD ThesisGoogle Scholar
  11. Kleinberg J, Tardos É (2006) Algorithm design. Pearson Education India, DelhiGoogle Scholar
  12. Lancichinetti A, Fortunato S (2009) Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys Rev E 80(1):016118CrossRefGoogle Scholar
  13. Lancichinetti A, Fortunato S (2009) Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys Rev E 80:1Google Scholar
  14. Lancichinetti A, Fortunato S, Kertsz J (2009) Detecting the overlapping and hierarchical community structure in complex networks. New J Phys 11(3):033015CrossRefGoogle Scholar
  15. Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78:4CrossRefGoogle Scholar
  16. Lancichinetti A, Radicchi F, Ramasco JJ, Fortunato S (2011) Finding statistically significant communities in networks. PLoS One 6(4):e18961CrossRefGoogle Scholar
  17. Monderer D, Shapley LS (1996) Potential games. Games Econ Behav 14(1):124–143MathSciNetzbMATHCrossRefGoogle Scholar
  18. Narayanam R, Narahari Y (2012) A game theory inspired, decentralized, local information based algorithm for community detection in social graphs. In: Pattern recognition (ICPR), 2012 21st international conference on, pp 1072–1075. IEEEGoogle Scholar
  19. Newman MEJ (2006) Modularity and community structure in networks. Proc Nal Acad Sci 103(23):8577–8582CrossRefGoogle Scholar
  20. Newman MEJ (2001) The structure of scientific collaboration networks. Proc Natl Acad Sci 98(2):404–409MathSciNetzbMATHCrossRefGoogle Scholar
  21. Palla G, Dernyi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043):814–818CrossRefGoogle Scholar
  22. Rosvall M, Bergstrom CT (2007) An information-theoretic framework for resolving community structure in complex networks. Proc Natl Acad Sci 104(18):7327–7331CrossRefGoogle Scholar
  23. Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci 105(4):1118–1123CrossRefGoogle Scholar
  24. Schelling TC (1971) Dynamic models of segregation? J Math Sociol 1(2):143–186zbMATHCrossRefGoogle Scholar
  25. Weng L, Menczer F, Ahn YY (2013) Virality prediction and community structure in social networks. Scie Rep 3:2522CrossRefGoogle Scholar
  26. 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–35zbMATHCrossRefGoogle Scholar
  27. Xie J, Liu X, Szymanski BK (2011) SLPA: uncovering overlapping communities in social networks via a speaker–listener interaction dynamic process. In: Proceedings of data mining technologies for computational collective intelligence workshop, at ICDM, Vancouver, CA, pp 344–349Google Scholar
  28. Xie J, Szymanski BK, Liu X (2011) Slpa: uncovering overlapping communities in social networks via a speaker–listener interaction dynamic process. In: Data mining workshops (ICDMW), 2011 IEEE 11th international conference on, pp 344–349. IEEEGoogle Scholar

Copyright information

© Springer-Verlag GmbH Austria, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Nanyang Technological UniversitySingaporeSingapore

Personalised recommendations