Detecting communities using coordination games: A short paper

• Main Authors: ARAVA, Radhika, Pradeep VARAKANTHAM
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2016
• Subjects: Game theory; Theory and Algorithms
• Online Access: https://ink.library.smu.edu.sg/sis_research/3616; https://ink.library.smu.edu.sg/context/sis_research/article/4617/viewcontent/FAIA285_1752.pdf
• Institution: Singapore Management University

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. 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 provide a novel and scalable two phased algorithm NashOverlap 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 with respect to standard normalised mutual information measure.