Enhance the Efficiency of Heuristic Algorithm for Maximizing Modularity Q
arXiv:0801.1964 · doi:10.1209/0295-5075/85/18009
Abstract
Modularity Q is an important function for identifying community structure in complex networks. In this paper, we prove that the modularity maximization problem is equivalent to a nonconvex quadratic programming problem. This result provide us a simple way to improve the efficiency of heuristic algorithms for maximizing modularity Q. Many numerical results demonstrate that it is very effective.
9 pages, 3 figures
References in corpus (19)
- Statistical mechanics of complex 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
- Fast algorithm for detecting community structure in networks
- Finding community structure in networks using the eigenvectors of matrices
- Resolution limit in community detection
- Defining and identifying communities in networks
- Community detection in complex networks using Extremal Optimization
- Finding local community structure in networks
- Detecting fuzzy community structures in complex networks with a Potts model
- Mixture models and exploratory analysis in networks
- Finding Communities in Linear Time: A Physics Approach
- Detecting Network Communities: a new systematic and efficient algorithm
- Detecting communities in large networks
- A Local Method for Detecting Communities
- Local modularity measure for network clusterizations
- Identifying "communities" within energy landscapes