Volume 101, Number 4, February 2013
|Number of page(s)||6|
|Section||Interdisciplinary Physics and Related Areas of Science and Technology|
|Published online||05 March 2013|
A spectral algorithm of community identification
1 Temasek Laboratories, National University of Singapore - Singapore 117508
2 Beijing-Hong Kong-Singapore Joint Center of Nonlinear and Complex Systems (Singapore), National University of Singapore - Singapore 117508
3 Department of Physics, National University of Singapore - Singapore 117542
4 Centre for Quantum Technologies, National University of Singapore - Singapore 117543
5 Yale-NUS College - Singapore
Received: 24 September 2012
Accepted: 7 February 2013
A novel spectral algorithm utilizing multiple eigenvectors is proposed to identify the communities in networks based on the modularity Q. We investigate the reduced modularity on low-rank approximations of the original modularity matrix consisting of leading eigenvectors. By exploiting the rotational invariance of the reduced modularity, near-optimal partitions of the network can be found. This approach generalizes the conventional spectral network partitioning algorithms which usually use only one eigenvector, and promises better results because more spectral information is used. The algorithm shows excellent performance on various real-world and computer-generated benchmark networks, and outperforms the most known community detection methods.
PACS: 89.75.Hc – Networks and genealogical trees / 89.20.Hh – World Wide Web, Internet / 05.10.-a – Computational methods in statistical physics and nonlinear dynamics
© EPLA, 2013
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.