Journal
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT
Volume -, Issue -, Pages -Publisher
IOP Publishing Ltd
DOI: 10.1088/1742-5468/2006/11/P11010
Keywords
analysis of algorithms; network dynamics
Categories
Ask authors/readers for more resources
Identifying community structure can be used as a potent tool in the analysis and understanding of the structure of complex networks. Up to now, methods for evaluating the performance of identification algorithms have used ad hoc networks with communities of equal size. We show that inhomogeneities in community sizes can and do affect the performance of algorithms considerably, and propose an alternative method which takes these factors into account. Furthermore, we propose a simple modi. cation of the algorithm proposed by Newman for community detection (2004 Phys. Rev. E 69 066133) which treats communities of different sizes on an equal footing, and show that it outperforms the original algorithm while retaining its speed.
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