A critical point for random graphs with a given degree sequence
Random Graphs 93 Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science
Network Analysis: Methodological Foundations (Lecture Notes in Computer Science)
Network Analysis: Methodological Foundations (Lecture Notes in Computer Science)
Algorithmic Game Theory
A Fast Algorithm to Find Overlapping Communities in Networks
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
Game theoretic models for social network analysis
Proceedings of the 20th international conference companion on World wide web
AICI'11 Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part II
Discovery of Web user communities and their role in personalization
User Modeling and User-Adapted Interaction
Like-Minded communities: bringing the familiarity and similarity together
WISE'12 Proceedings of the 13th international conference on Web Information Systems Engineering
Cascade-based community detection
Proceedings of the sixth ACM international conference on Web search and data mining
Game-theoretic approach for user migration in Diaspora
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Overlapping community detection in networks: The state-of-the-art and comparative study
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
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.