Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
979650 | Physica A: Statistical Mechanics and its Applications | 2007 | 10 Pages |
Abstract
Different algorithms, which take both links and link weights into account for the community structure of weighted networks, have been reported recently. Based on the measure of similarity among community structures introduced in our previous work, in this paper, accuracy and precision of three algorithms are investigated. Results show that Potts model based algorithm and weighted extremal optimization (WEO) algorithm work well on both dense or sparse weighted networks, while weighted Girvan–Newman (WGN) algorithm works well only for relatively sparse networks.
Related Topics
Physical Sciences and Engineering
Mathematics
Mathematical Physics
Authors
Ying Fan, Menghui Li, Peng Zhang, Jinshan Wu, Zengru Di,