Abstract: Research on community finding is very helpful to control virus spreading in networks. Most of the proposed community-finding algorithms are not suitable for very large networks because of their time-complexity. Combined with the advantage of solving the clustering of unknown distributed data set of the spectral clustering,and the ability of modularity function in finding good community number in large networks,a community-finding algorithm based on spectral clustering was proposed. Experimental results indicate that the new algorithm is efficient and effective at finding good community structure in large networks.

Key words: Complex networks, Community structure, Spectral clustering, Modularity