Enhance the Efficiency of Heuristic Algorithm for Maximizing Modularity Q
Physics and Society
2009-11-13 v1
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.
Cite
@article{arxiv.0801.1964,
title = {Enhance the Efficiency of Heuristic Algorithm for Maximizing Modularity Q},
author = {Yanqing Hu and Jinshan Wu and Zengru Di},
journal= {arXiv preprint arXiv:0801.1964},
year = {2009}
}
Comments
9 pages, 3 figures