A game-theoretic framework to identify overlapping communities in social networks
- 835 Downloads
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.
KeywordsOverlapping communities Community discovery Social network analysis
Unable to display preview. Download preview PDF.
- Athey S, Jha S (2006) A theory of community formation and social hierarchy. Working paperGoogle Scholar
- Copic J, Jackson MO, Kirman A (2009) Identifying community structures from network data via maximum likelihood methods. BE J Theor Econ 9. Working paperGoogle Scholar
- 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
- Gregory S (2008) A fast algorithm to find overlapping communities in networks. In: ECML/PKDD. SpringerGoogle Scholar
- McKenzie-Mohr D, Smith W (1999) Fostering sustainable behavior: an introduction to community-based social marketing. New Society Publishers, Gabriola IslandGoogle Scholar
- Newman MEJ (2004b) Who is the best connected scientist?. A study of scientific coauthorship networks. Complex Netw 650: 337–370Google Scholar
- Nicosia V, Mangioni G, Carchiolo V, Malgeri M (2009) Extending the definition of modularity to directed graphs with overlapping communities. J Stat Mech 3024Google Scholar
- Osborne MJ, Rubinstein A (1994) A Course in game theory. MIT Press, CambridgeGoogle Scholar
- Sarason S (1974) The psychological sense of community. Jossey-Bass, San FranciscoGoogle Scholar
- Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33(4): 452–473Google Scholar