Alternative approach to community detection in networks
arXiv:0808.0375 · doi:10.1103/PhysRevE.79.066111
Abstract
The problem of community detection is relevant in many disciplines of science and modularity optimization is the widely accepted method for this purpose. It has recently been shown that this approach presents a resolution limit by which it is not possible to detect communities with sizes smaller than a threshold which depends on the network size. Moreover, it might happen that the communities resulting from such an approach do not satisfy the usual qualitative definition of commune, i.e., nodes in a commune are more connected among themselves than to nodes outside the commune. In this article we introduce a new method for community detection in complex networks. We define new merit factors based on the weak and strong community definitions formulated by Radicchi et al (Proc. Nat. Acad. Sci. USA 101, 2658-2663 (2004)) and we show that this local definitions avoid the resolution limit problem found in the modularity optimization approach.
arXiv comment17 pages, 6 figures
References in corpus (12)
- Finding and evaluating community structure in networks
- Modularity and community structure in networks
- Cooperative Game Theory Approaches for Network Partitioning
- Functional cartography of complex metabolic networks
- Benchmark graphs for testing community detection algorithms
- Resolution limit in community detection
- Comparing community structure identification
- Defining and identifying communities in networks
- Community detection in complex networks using Extremal Optimization
- Modularity from Fluctuations in Random Graphs and Complex Networks
- Robustness of community structure in networks
- Size reduction of complex networks preserving modularity