Improved spectral algorithm for the detection of network communities
classification
⚛️ physics.soc-ph
cond-mat.stat-mech
keywords
detectioncommunitiescommunitycomplexmethodnetworkspectralalgorithm
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Influence and Betweenness in Flow Models of Complex Network Systems
Introduces flow adjacency matrices and defines influence and betweenness measures (strength, power, domain, diameter) to quantify node, edge, and subsystem importance in complex network flow models.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.