Game Theory and Extremal Optimization for Community Detection in Complex Dynamic Networks

Abstract

The detection of evolving communities in dynamic complex networks is a challenging problem that recently received attention from the research community. Dynamics clearly add another complexity dimension to the difficult task of community detection. Methods should be able to detect changes in the network structure and produce a set of community structures corresponding to different timestamps and reflecting the evolution in time of network data. We propose a novel approach based on game theory elements and extremal optimization to address dynamic communities detection. Thus, the problem is formulated as a mathematical game in which nodes take the role of players that seek to choose a community that maximizes their profit viewed as a fitness function. Numerical results obtained for both synthetic and real-world networks illustrate the competitive performance of this game theoretical approach.

DOI: 10.1371/journal.pone.0086891

Cite this paper

@inproceedings{Lung2014GameTA, title={Game Theory and Extremal Optimization for Community Detection in Complex Dynamic Networks}, author={Rodica Ioana Lung and Camelia Chira and Anca Andreica}, booktitle={PloS one}, year={2014} }