On weakly optimal partitions in modular networks
arXiv:1008.3443
Abstract
Modularity was introduced as a measure of goodness for the community structure induced by a partition of the set of vertices in a graph. Then, it also became an objective function used to find good partitions, with high success. Nevertheless, some works have shown a scaling limit and certain instabilities when finding communities with this criterion. Modularity has been studied proposing several formalisms, as hamiltonians in a Potts model or laplacians in spectral partitioning. In this paper we present a new probabilistic formalism to analyze modularity, and from it we derive an algorithm based on weakly optimal partitions. This algorithm obtains good quality partitions and also scales to large graphs.
References in corpus (13)
- Fast unfolding of communities in large networks
- Finding and evaluating community structure in networks
- Modularity and community structure in networks
- Finding community structure in very large networks
- Cooperative Game Theory Approaches for Network Partitioning
- The structure of scientific collaboration networks
- Functional cartography of complex metabolic networks
- Resolution limit in community detection
- Analysis of weighted networks
- Statistical Mechanics of Community Detection
- Community detection in complex networks using Extremal Optimization
- Self-similar community structure in organisations
- Limited resolution in complex network community detection with Potts model approach