Abstract
In this paper, we introduce a game-theoretic framework to address the community detection problem based on the structures of social networks. We formulate the dynamics of community formation as a strategic game called community formation game: Given an underlying social graph, we assume that each node is a selfish agent who selects communities to join or leave based on her own utility measurement. A community structure can be interpreted as an equilibrium of this game. We formulate the agents’ utility by the combination of a gain function and a loss function. We allow each agent to select multiple communities, which naturally captures the concept of “overlapping communities”. We propose a gain function based on the modularity concept introduced by Newman (Proc Natl Acad Sci 103(23):8577–8582, 2006), and a simple loss function that reflects the intrinsic costs incurred when people join the communities. We conduct extensive experiments under this framework, and our results show that our algorithm is effective in identifying overlapping communities, and are often better then other algorithms we evaluated especially when many people belong to multiple communities. To the best of our knowledge, this is the first time the community detection problem is addressed by a game-theoretic framework that considers community formation as the result of individual agents’ rational behaviors.
Similar content being viewed by others
References
Alós-Ferrer C, Ania A (2001) Local equilibria in economic games. Econ Lett 70(2): 165–173
Athey S, Jha S (2006) A theory of community formation and social hierarchy. Working paper
Brandes U, Erlebach T (2005) Network analysis: methodological foundations. Springer Verlag, Berlin
Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(6): 066111
Copic J, Jackson MO, Kirman A (2009) Identifying community structures from network data via maximum likelihood methods. BE J Theor Econ 9. Working paper
Fjällström PO (1998) Algorithms for graph partitioning: a survey. In: Linköping electronic articles in computer and information science, vol 3. Linköping University Electronic Press, 34 pp. http://www.ep.liu.se/ea/cis/1998/010/. Accessed 22 July 2010
Fortunato S, Barthélemy M (2007) Resolution limit in community detection. Proc Natl Acad Sci 104(1): 36
Gregory S (2008) A fast algorithm to find overlapping communities in networks. In: ECML/PKDD. Springer
Kasarda JD, Janowitz M (1974) Community attachment in mass society. Am Soc Rev 39(3): 328–339
Kotler P, Zaltman G (1971) Social marketing: an approach to planned social change. J Mark 35(3): 3–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): 16118
Lusseau D (2003) The emergent properties of a dolphin social network. Proc Biol Sci 270: S186–S188
McKenzie-Mohr D, Smith W (1999) Fostering sustainable behavior: an introduction to community-based social marketing. New Society Publishers, Gabriola Island
Molloy M, Reed B (1995) A critical point for random graphs with a given degree sequence. Random Struct Algorithms 6(2-3): 161–180
Newman MEJ (2004a) Coauthorship networks and patterns of scientific collaboration. Proc Natl Acad Sci USA 101(Suppl 1): 5200–5205
Newman MEJ (2004b) Who is the best connected scientist?. A study of scientific coauthorship networks. Complex Netw 650: 337–370
Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23): 8577–8582
Nicosia V, Mangioni G, Carchiolo V, Malgeri M (2009) Extending the definition of modularity to directed graphs with overlapping communities. J Stat Mech 3024
Nisan N, Roughgarden T, Tardos É, Vazirani VV (2007) Algorithmic game theory. Cambridge University Press, Cambridge
Osborne MJ, Rubinstein A (1994) A Course in game theory. MIT Press, Cambridge
Palla G, Derényi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043): 814
Sampson RJ, Groves WB (1989) Community structure and crime: testing social-disorganization theory. Am J Soc 94(4): 774
Sarason S (1974) The psychological sense of community. Jossey-Bass, San Francisco
White HC, Boorman SA, Breiger RL (1976) Social structure from multiple networks. I. blockmodels of roles and positions. Am J Soc 81(4): 730
Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33(4): 452–473
Author information
Authors and Affiliations
Corresponding author
Additional information
Responsible editors: José L Balcázar, Francesco Bonchi, Aristides Gionis, Michéle Sebag.
Rights and permissions
About this article
Cite this article
Chen, W., Liu, Z., Sun, X. et al. A game-theoretic framework to identify overlapping communities in social networks. Data Min Knowl Disc 21, 224–240 (2010). https://doi.org/10.1007/s10618-010-0186-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10618-010-0186-6