A new measure of modularity density for community detection
arXiv:1908.08452
Abstract
Using an intuitive concept of what constitutes a meaningful community, a novel metric is formulated for detecting non-overlapping communities in undirected, weighted heterogeneous networks. This metric, modularity density, is shown to be superior to the versions of modularity density in present literature. Compared to the previous versions of modularity density, maximization of our metric is proven to be free from bias and better detect weakly-separated communities particularly in heterogeneous networks. In addition to these characteristics, the computational running time of our modularity density is found to be on par or faster than that of the previous variants. Our findings further reveal that community detection by maximization of our metric is mathematically related to partitioning a network by minimization of the normalized cut criterion.
References in corpus (16)
- Finding and evaluating community structure in networks
- Community detection in graphs
- Fast algorithm for detecting community structure in networks
- Finding community structure in networks using the eigenvectors of matrices
- Benchmark graphs for testing community detection algorithms
- Resolution limit in community detection
- Community detection algorithms: a comparative analysis
- Statistical Mechanics of Community Detection
- The performance of modularity maximization in practical contexts
- Modularity from Fluctuations in Random Graphs and Complex Networks
- Limits of modularity maximization in community detection
- Community Detection via Maximization of Modularity and Its Variants
- Community Detection in Complex Networks Using Genetic Algorithms
- A New Metric for Quality of Network Community Structure
- Network community detection using modularity density measures
- Effect of size heterogeneity on community identification in complex networks