关键词: 微分方程, 社团结构, 谱聚类

Abstract: Rapid and accurate community-finding of complex network is very important for people to understand the character of entire network. Spectral clustering algorithm is an effective and global convergent community-finding algorithm, the computation complexity lies in calculating eigenvalue and eigenvector. Combined with the advantage of solving the eigenvalues and eigenvector of linear homogeneous differential equations with constant coefficients, this paper proposes two community-finding algorithms based on spectral clustering and difference equation, which avoid the complex computation. The theoretical analysis and experimental verification show the effectiveness of these algorithms.

Key words: difference equation, community structure, spectral clustering