Z-score-based modularity for community detection in networks
arXiv:1501.01909 · doi:10.1371/journal.pone.0147805
Abstract
Identifying community structure in networks is an issue of particular interest in network science. The modularity introduced by Newman and Girvan [Phys. Rev. E 69, 026113 (2004)] is the most popular quality function for community detection in networks. In this study, we identify a problem in the concept of modularity and suggest a solution to overcome this problem. Specifically, we obtain a new quality function for community detection. We refer to the function as Z-modularity because it measures the Z-score of a given division with respect to the fraction of the number of edges within communities. Our theoretical analysis shows that Z-modularity mitigates the resolution limit of the original modularity in certain cases. Computational experiments using both artificial networks and well-known real-world networks demonstrate the validity and reliability of the proposed quality function.
arXiv comment8 pages, 10 figures
References in corpus (27)
- Fast unfolding of communities in large networks
- The structure and function of complex networks
- Community structure in social and biological networks
- Finding and evaluating community structure in networks
- Modularity and community structure in networks
- Community detection in graphs
- Finding community structure in very large networks
- Cooperative Game Theory Approaches for Network Partitioning
- Maps of random walks on complex networks reveal community structure
- Functional cartography of complex metabolic networks
- Benchmark graphs for testing community detection algorithms
- Resolution limit in community detection
- Defining and identifying communities in networks
- Community detection algorithms: a comparative analysis
- Statistical Mechanics of Community Detection
- Community detection in complex networks using Extremal Optimization
- Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities
- The performance of modularity maximization in practical contexts
- An information-theoretic framework for resolving community structure in complex networks
- Limits of modularity maximization in community detection
- Analysis of the structure of complex networks at different resolution levels
- Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems
- Modularity-Maximizing Network Communities via Mathematical Programming
- Size reduction of complex networks preserving modularity
- Identifying "communities" within energy landscapes
- Spectral tripartitioning of networks
- Post-Processing Hierarchical Community Structures: Quality Improvements and Multi-scale View
Cited by in corpus (5)
- Community structure: A comparative evaluation of community detection methods
- Separating Polarization from Noise: Comparison and Normalization of Structural Polarization Measures
- Detecting Statistically Significant Communities
- Metrics for Community Analysis: A Survey
- Approximate Conditional Sampling for Pattern Detection in Weighted Networks