Community Detection via Katz and Eigenvector Centrality
arXiv:1909.03916
Abstract
The computational demands of community detection algorithms such as Louvain and spectral optimization can be prohibitive for large networks. Eigenvector centrality and Katz centrality are two network statistics commonly used to describe the relative importance of nodes; and their calculation can be closely approximated on large networks by scalable iterative methods. In this paper, we present and leverage a surprising relationship between Katz centrality and eigenvector centrality to detect communities. Beyond the computational gains, we demonstrate that our approach identifies communities that are as good or better than conventional methods.
arXiv commentSubmitted to Physical Review E
References in corpus (7)
- Emergence of scaling in random networks
- Fast unfolding of communities in large networks
- Finding and evaluating community structure in networks
- Finding community structure in networks using the eigenvectors of matrices
- Network reconstruction and community detection from dynamics
- A Parameterized Centrality Metric for Network Analysis
- Localization of eigenvector centrality in networks with a cut vertex