2013/2014
A constrained power method for community detection in complex networks
Mathematical Problems in Engineering*, 2014:804381
作者 | Wenye Li |
---|---|
摘要 | For an undirected complex network made up with vertices and edges, we developed a fast computing algorithm that divides vertices into different groups by maximizing the standard “modularity” measure of the resulting partitions. The algorithm is based on a simple constrained power method which maximizes a quadratic objective function while satisfying given linear constraints. We evaluated the performance of the algorithm and compared it with a number of state-of-the-art solutions. The new algorithm reported both high optimization quality and fast running speed, and thus it provided a practical tool for community detection and network structure analysis. |
* With an impact factor among those of the top 37.9% of journals in Engineering, Multidisciplinary and the top 47.4% of journals in Mathematics, Interdisciplinary Applications