Physics – Physics and Society
Scientific paper
2009-08-07
Physical Review E 80, 056117 (2009)
Physics
Physics and Society
12 pages, 8 figures. The software to compute the values of our general normalized mutual information is available at http://
Scientific paper
10.1103/PhysRevE.80.056117
Uncovering the community structure exhibited by real networks is a crucial step towards an understanding of complex systems that goes beyond the local organization of their constituents. Many algorithms have been proposed so far, but none of them has been subjected to strict tests to evaluate their performance. Most of the sporadic tests performed so far involved small networks with known community structure and/or artificial graphs with a simplified structure, which is very uncommon in real systems. Here we test several methods against a recently introduced class of benchmark graphs, with heterogeneous distributions of degree and community size. The methods are also tested against the benchmark by Girvan and Newman and on random graphs. As a result of our analysis, three recent algorithms introduced by Rosvall and Bergstrom, Blondel et al. and Ronhovde and Nussinov, respectively, have an excellent performance, with the additional advantage of low computational complexity, which enables one to analyze large systems.
Fortunato Santo
Lancichinetti Andrea
No associations
LandOfFree
Community detection algorithms: a comparative analysis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Community detection algorithms: a comparative analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Community detection algorithms: a comparative analysis will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-153277