期刊
NEW JOURNAL OF PHYSICS
卷 11, 期 -, 页码 -出版社
IOP Publishing Ltd
DOI: 10.1088/1367-2630/11/4/043025
关键词
-
资金
- State High-Tech Development Program of China [2006AA020204]
Many real-world systems can be described by networks whose structures relate to functional properties. An important way to reveal topology function correlations is to detect the community structures, which can be well evaluated by graph modularity. By maximizing modularity, large networks can be divided into naturally separated groups. Here, we propose a contraction-dilation algorithm based on single-node-move operations and a perturbation strategy. Tests on artificial and real-world networks show that the algorithm is efficient for discovering community structures with high modularity scores and accuracies at low expenses of both time and memory.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据