We compare recent approaches to community structure identification in terms of sensitivity and computational cost. The recently proposed modularity measure is revisited and the performance of the methods as applied to ad hoc networks with known community structure, is compared. We find that the most accurate methods tend to be more computationally expensive, and that both aspects need to be considered when choosing a method for practical purposes. The work is intended as an introduction as well as a proposal for a standard benchmark test of community detection methods.
|Number of pages||10|
|Journal||Journal of Statistical Mechanics: Theory and Experiment|
|Publication status||Published - 1 Sep 2005|
- Analysis of algorithms
- Network dynamics