Volume 85, Number 1, January 2009
|Number of page(s)||5|
|Section||Interdisciplinary Physics and Related Areas of Science and Technology|
|Published online||19 January 2009|
Enhance the efficiency of heuristic algorithms for maximizing the modularity Q
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
Corresponding author: firstname.lastname@example.org
Accepted: 3 December 2008
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.
PACS: 89.75.Hc – Networks and genealogical trees / 89.75.Fb – Structures and organization in complex systems / 89.65.Ef – Social organizations; anthropology
© EPLA, 2009
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.