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

Emilie Kaufmann 1, 2, 3 Thomas Bonald 4, 5 Marc Lelarge 4, 6
1 SEQUEL - Sequential Learning
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
6 DYOGENE - Dynamics of Geometric Networks
DI-ENS - Département d'informatique de l'École normale supérieure, CNRS - Centre National de la Recherche Scientifique : UMR 8548, Inria de Paris
Abstract : 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.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01163147
Contributor : Emilie Kaufmann <>
Submitted on : Sunday, November 5, 2017 - 6:47:53 PM
Last modification on : Friday, April 12, 2019 - 10:18:10 AM
Document(s) archivé(s) le : Tuesday, February 6, 2018 - 12:24:25 PM

Files

Identifiers

  • HAL Id : hal-01163147, version 3
  • ARXIV : 1506.04158

Citation

Emilie Kaufmann, Thomas Bonald, Marc Lelarge. A Spectral Algorithm with Additive Clustering for the Recovery of Overlapping Communities in Networks. Theoretical Computer Science, Elsevier, In press. ⟨hal-01163147v3⟩

Share

Metrics

Record views

305

Files downloads

124