Random matrix improved community detection in heterogeneous networks

Abstract : —This article proposes a new spectral method for community detection in large dense networks following the degree-corrected stochastic block model. We theoretically support and analyze an approach based on a novel " α-regularization " of the modularity matrix. We provide a consistent estimator for the choice of α inducing the most favorable community detection in worst case scenarios. We further prove that spectral clustering ought to be performed on a 1 − α regularization of the dominant eigenvectors (rather than on the eigenvectors themselves) to compensate for biases due to degree heterogeneity. Although focused on dense graph models, our clustering method is shown to be very promising on real world networks with competitive performances versus state-of-the-art spectral techniques developed for sparse homogeneous networks.
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

Contributor : Hafiz Tiomoko Ali <>
Submitted on : Monday, June 11, 2018 - 10:46:15 AM
Last modification on : Monday, December 17, 2018 - 2:28:06 PM
Long-term archiving on : Thursday, September 13, 2018 - 12:14:51 AM


Files produced by the author(s)



Hafiz Tiomoko Ali, Romain Couillet. Random matrix improved community detection in heterogeneous networks. 50th Asilomar Conference on Signals, Systems and Computers, Nov 2016, Pacific Grove, United States. ⟨10.1109/acssc.2016.7869603 ⟩. ⟨hal-01812036⟩



Record views


Files downloads