Evaluation of algebraic graph clustering algorithms for complex networks

Abstract

We review main graph clustering algorithms which are MST-based, Shared Nearest Neighbor and Edge-Betweenness algorithms and show novel algebraic graph implementations using Python. We compare them using randomly generated scale-free graphs and provide pointers for parallel processing