Note on the equivalence of the label propagation method of community detection and a Potts model approach
arXiv:0803.2804 · doi:10.1016/j.physa.2008.04.024
Abstract
We show that the recently introduced label propagation method for detecting communities in complex networks is equivalent to find the local minima of a simple Potts model. Applying to empirical data, the number of such local minima was found to be very high, much larger than the number of nodes in the graph. The aggregation method for combining information from more local minima shows a tendency to fragment the communities into very small pieces.
6 pages
References in corpus (9)
- Uncovering the overlapping community structure of complex networks in nature and society
- Finding community structure in networks using the eigenvectors of matrices
- Near linear time algorithm to detect community structures in large-scale networks
- Statistical Mechanics of Community Detection
- Quantifying social group evolution
- An information-theoretic framework for resolving community structure in complex networks
- Emergence of communities in weighted networks
- Identifying "communities" within energy landscapes
- Long term ordering kinetics of the two dimensional q-state Potts model