A game theoretic approach to community detection in social networks

12Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The problem of detecting community structures in social networks is a complex problem of great importance in sociology, biology and computer science. Communities are characterized by dense intra-connections and comparatively sparse inter-cluster connections. The community detection problem is empirically formulated from a game theoretic point of view and solved using a Crowding based Differential Evolution algorithm adapted for detecting Nash equilibria of noncooperative games. Numerical results indicate the potential of this approach. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Lung, R. I., Gog, A., & Chira, C. (2011). A game theoretic approach to community detection in social networks. In Studies in Computational Intelligence (Vol. 387, pp. 121–131). https://doi.org/10.1007/978-3-642-24094-2_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free