An improved game-theoretic approach to uncover overlapping communities

Sun, Hong-Liang, Ch'ng, Eugene, Yong, Xi, Garibaldi, Jonathan M., See, Simon and Chen, Duan-Bing (2017) An improved game-theoretic approach to uncover overlapping communities. International Journal of Modern Physics C, 28 (8). 1750112-1-1750112-17. ISSN 1793-6586

Full text not available from this repository.


How can we uncover overlapping communities from complex networks to understand the inherent structures and functions? Chen et al. firstly proposed a community game (Game) to study this problem, and the overlapping communities have been discovered when the game is convergent. It is based on the assumption that each vertex of the underlying network is a rational game player to maximize its utility. In this paper, we investigate how similar vertices affect the formation of community game. The Adamic–Adar Index (AA Index) has been employed to define the new utility function. This novel method has been evaluated on both synthetic and real-world networks. Experimental study shows that it has significant improvement of accuracy (from 4.8% to 37.6%) compared with the Game on 10 real networks. It is more efficient on Facebook networks (FN) and Amazon co-purchasing networks than on other networks. This result implicates that “friend circles of friends” of Facebook are valuable to understand the overlapping community division.

Item Type: Article
Additional Information: Electronic version of an article published as International Journal of Modern Physics C, Volume 28, Issue 8, 2017, pp.1-17 doi:10.1142/S0129183117501121 © World Scientific Publishing Company,
Keywords: Overlapping community detection; game theory; complex networks
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Identification Number:
Depositing User: Eprints, Support
Date Deposited: 03 Oct 2017 09:43
Last Modified: 04 May 2020 19:05

Actions (Archive Staff Only)

Edit View Edit View