A Generalized and Adaptive Method for Community Detection
arXiv:1406.2518
Abstract
Complex networks represent interactions between entities. They appear in various contexts such as sociology, biology, etc., and they generally contain highly connected subgroups called communities. Community detection is a well-studied problem and most of the algorithms aim to maximize the Newman-Girvan modularity function, the most popular being the Louvain method (it is well-suited on very large graphs). However, the classical modularity has many drawbacks: we can find partitions of high quality in graphs without community structure, e.g., on random graphs; it promotes large communities. Then, we have adapted the Louvain method to other quality functions. In this paper, we describe a generic version of the Louvain method. In particular, we give a sufficient condition to plug a quality function into it. We also show that global performance of this new version is similar to the classical Louvain algorithm, that promotes it to the best rank of the community detection algorithms.
References in corpus (9)
- Fast unfolding of communities in large networks
- Community structure in social and biological networks
- Finding and evaluating community structure in networks
- Community detection in graphs
- Cooperative Game Theory Approaches for Network Partitioning
- The diameter of the world wide web
- Benchmark graphs for testing community detection algorithms
- Generalized Louvain Method for Community Detection in Large Networks
- Community structure and scale-free collections of Erdös-Rényi graphs