Improved spectral algorithm for the detection of network communities

Abstract

We review and improve a recently introduced method for the detection of communities in complex networks. This method combines spectral properties of some matrices encoding the network topology, with well known hierarchical clustering techniques, and the use of the modularity parameter to quantify the goodness of any possible community subdivision. This provides one of the best available methods for the detection of community structures in complex systems.

4 pages, 1 fugure; to appear in the Proceedings of the 8th Granada Seminar - Computational and Statistical Physics

Cited by in corpus (5)

• Optimal network topologies: Expanders, Cages, Ramanujan graphs, Entangled networks and all that
• Process Flow Diagram of an Ammonia Plant as a Complex Network
• Network synchronization: Optimal and Pessimal Scale-Free Topologies
• A graph model for the clustering of dark matter halos
• A new edge betweenness measure using a game theoretical approach: an application to hierarchical community detection