A Spectral Algorithm with Additive Clustering for the Recovery of Overlapping Communities in Networks - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2018

A Spectral Algorithm with Additive Clustering for the Recovery of Overlapping Communities in Networks

Résumé

This paper presents a novel spectral algorithm with additive clustering designed to identify overlapping communities in networks. The algorithm is based on geometric properties of the spectrum of the expected adjacency matrix in a random graph model that we call stochastic blockmodel with overlap (SBMO). An adaptive version of the algorithm, that does not require the knowledge of the number of hidden communities, is proved to be consistent under the SBMO when the degrees in the graph are (slightly more than) logarithmic. The algorithm is shown to perform well on simulated data and on real-world graphs with known overlapping communities.
Fichier principal
Vignette du fichier
KBL17.pdf (578.93 Ko) Télécharger le fichier

Dates et versions

hal-01163147 , version 1 (12-06-2015)
hal-01163147 , version 2 (19-05-2016)
hal-01163147 , version 3 (05-11-2017)

Identifiants

Citer

Emilie Kaufmann, Thomas Bonald, Marc Lelarge. A Spectral Algorithm with Additive Clustering for the Recovery of Overlapping Communities in Networks. Theoretical Computer Science, 2018, 742, pp.3-26. ⟨10.1016/j.tcs.2017.12.028⟩. ⟨hal-01163147v3⟩
895 Consultations
442 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More