What question did this study set out to answer?

This analysis aims to evaluate the performance of various community detection algorithms on heterogeneous benchmark graphs.

November 30, 2009Physical Review EOpen Access

Community detection algorithms: A comparative analysis

View Full Paper

Ask AI

Bookmark

Authors

Comparative analysis evaluates community detection algorithms’ performance in complex networks, highlighting key insights.

This analysis aims to evaluate the performance of various community detection algorithms on heterogeneous benchmark graphs.
Tested multiple algorithms against a new class of benchmark graphs with varied degree and community size distributions.
Included previously established benchmarks such as those created by Girvan and Newman.
Evaluated algorithms on both benchmark and random graphs.
Three recent algorithms by Rosvall and Bergstrom, Blondel, and Ronhovde and Nussinov showed excellent performance.
These top-performing algorithms exhibited low computational complexity, enabling large systems analysis.
Performance tests reveal significant advantages over traditional methods.

Lancichinetti et al. (2009) studied this question.

View Full Paper

Ask AI

Bookmark