Community Detection in Social Networks Using Information Diffusion

摘要

Discovering communities in popular social networks like Facebook has been receiving significant attentions recently. In this paper, inspired from real life, we have addressed the community detection problem by a framework based on Information Diffusion Model and Game Theory. In this approach, we consider each node of the social network as a selfish agent which has interactions with its neighbors and tries to maximize its total utility (i.e. received information). Finally community structure of the graph reveals after reaching to the local Nash equilibrium of the game. Experimental results on the benchmark social media datasets, synthetic and real world graphs demonstrate that our method is superior compared with the other state-of-the-art methods.