Potts model based on a Markov process computation solves the community structure problem effectively
arXiv:1503.08035 · doi:10.1103/PhysRevE.86.016109
Abstract
Potts model is a powerful tool to uncover community structure in complex networks. Here, we propose a new framework to reveal the optimal number of communities and stability of network structure by quantitatively analyzing the dynamics of Potts model. Specifically we model the community structure detection Potts procedure by a Markov process, which has a clear mathematical explanation. Then we show that the local uniform behavior of spin values across multiple timescales in the representation of the Markov variables could naturally reveal the network's hierarchical community structure. In addition, critical topological information regarding to multivariate spin configuration could also be inferred from the spectral signatures of the Markov process. Finally an algorithm is developed to determine fuzzy communities based on the optimal number of communities and the stability across multiple timescales. The effectiveness and efficiency of our algorithm are theoretically analyzed as well as experimentally validated.
23 pages, 8 figures. arXiv admin note: text overlap with arXiv:0911.2308 by other authors
References in corpus (7)
- Modularity and community structure in networks
- Uncovering the overlapping community structure of complex networks in nature and society
- Maps of random walks on complex networks reveal community structure
- Resolution limit in community detection
- Comparing community structure identification
- Analysis of the structure of complex networks at different resolution levels
- Eigenvalue Decomposition as a Generalized Synchronization Cluster Analysis