A spectral algorithm of community identification

Author： Gong Xiaofeng Li Kun Li Menghui Lai C.-H.

E-ISSN： 1286-4854|101|4|48001-48001

ISSN： 0295-5075

Source： EPL (EUROPHYSICS LETTERS), Vol.101, Iss.4, 2013-03, pp. : 48001-48001

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

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.