Journal
NEW JOURNAL OF PHYSICS
Volume 11, Issue -, Pages -Publisher
IOP Publishing Ltd
DOI: 10.1088/1367-2630/11/4/043025
Keywords
-
Categories
Funding
- State High-Tech Development Program of China [2006AA020204]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available