Enhance the efficiency of heuristic algorithms for maximizing the modularity QY. Hu1, J. Wu2 and Z. Di1
1 Department of Systems Science, School of Management, Beijing Normal University - Beijing 100875, PRC
2 Department of Physics and Astronomy, University of British Columbia - Vancouver, V6T 1Z1, B.C. Canada
received 13 June 2008; accepted in final form 3 December 2008; published January 2009
published online 19 January 2009
The Modularity Q is an important index for identifying the community structure in complex networks. Maximizing Q has been proved to be an NP problem and it can only be achieved by heuristic algorithms. In this paper, the modularity maximization problem is proved to be a nonconvex quadratic programming problem. Based on this result, an approach is suggested and tested to improve the efficiency of heuristic algorithms for maximizing the modularity Q. Many numerical results demonstrate that the approach is effective.
89.75.Hc - Networks and genealogical trees.
89.75.Fb - Structures and organization in complex systems.
89.65.Ef - Social organizations; anthropology.
© EPLA 2009