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.
arXiv comment6 pages
References in corpus (22)
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Finding community structure in very large networks
- Uncovering the overlapping community structure of complex networks in nature and society
- Lethality and centrality in protein networks
- Finding community structure in networks using the eigenvectors of matrices
- Cooperative Game Theory Approaches for Network Partitioning
- Hierarchical organization of modularity in metabolic networks
- Functional cartography of complex metabolic networks
- Near linear time algorithm to detect community structures in large-scale networks
- Defining and identifying communities in 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
- Modularity and Extreme Edges of the Internet
- Identifying "communities" within energy landscapes
- Uncovering collective listening habits and music genres in bipartite networks
- Freezing in Ising Ferromagnets
- Community structure and ethnic preferences in school friendship networks
- Long term ordering kinetics of the two dimensional q-state Potts model
- Zero Temperature Dynamics of 2D and 3D Ising Ferromagnets
Cited by in corpus (22)
- Community detection in graphs
- Finding overlapping communities in networks by label propagation
- Narrow scope for resolution-limit-free community detection
- Detecting network communities by propagating labels under constraints
- Community landscapes: an integrative approach to determine overlapping network module hierarchy, identify key nodes and predict network dynamics
- Analysis of Network Clustering Algorithms and Cluster Quality Metrics at Scale
- Unfolding communities in large complex networks: Combining defensive and offensive label propagation for core extraction
- Robust network community detection using balanced propagation
- Community Detection Using A Neighborhood Strength Driven Label Propagation Algorithm
- Large network community detection by fast label propagation
- Ubiquitousness of link-density and link-pattern communities in real-world networks
- Universality of the stochastic block model
- Organization of networks with tagged nodes and biased links: a priori distinct communities. The case of Intelligent Design Proponents and Darwinian Evolution Defenders
- Community detection by label propagation with compression of flow
- Label propagation for clustering
- Unfolding network communities by combining defensive and offensive label propagation
- On the relationship between Gaussian stochastic blockmodels and label propagation algorithms
- Generalized network community detection
- Resolution Limits for Detecting Community Changes in Multilayer Networks
- Role-based Label Propagation Algorithm for Community Detection
- On tuning a mean-field model for semi-supervised classification
- Spiking label propagation for community detection