Improved spectral community detection in large heterogeneous networks

Abstract : In this article, we propose and study the performance of spectral community detection for a family of "α-normalized" adjacency matrices A, of the type D −α AD −α with D the degree matrix, in heterogeneous dense graph models. We show that the previously used normaliza-tion methods based on A or D −1 AD −1 are in general suboptimal in terms of correct recovery rates and, relying on advanced random matrix methods, we prove instead the existence of an optimal value α opt of the parameter α in our generic model; we further provide an online estimation of α opt only based on the node degrees in the graph. Numerical simulations show that the proposed method outperforms state-of-the-art spectral approaches on moderately dense to dense heterogeneous graphs.
Document type :
Journal articles
Complete list of metadatas

Cited literature [40 references]  Display  Hide  Download
Contributor : Romain Couillet <>
Submitted on : Monday, December 17, 2018 - 2:38:14 PM
Last modification on : Thursday, February 7, 2019 - 5:18:56 PM
Long-term archiving on : Monday, March 18, 2019 - 3:51:30 PM


Publisher files allowed on an open archive


  • HAL Id : hal-01957623, version 1


Hafiz Tiomoko Ali, Romain Couillet. Improved spectral community detection in large heterogeneous networks. Journal of Machine Learning Research, Journal of Machine Learning Research, 2018, 18 (10), pp.1-49. ⟨⟩. ⟨hal-01957623⟩



Record views


Files downloads