A spectral algorithm with additive clustering for the recovery of overlapping communities in networks

Emilie Kaufmann, Thomas Bonald, Marc Lelarge

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationAlgorithmic Learning Theory - 27th International Conference, ALT 2016, Proceedings
EditorsHans Ulrich Simon, Sandra Zilles, Ronald Ortner
PublisherSpringer Verlag
Pages355-370
Number of pages16
ISBN (Print)9783319463780
DOIs
Publication statusPublished - 1 Jan 2016
Externally publishedYes
Event27th International Conference on Algorithmic Learning Theory, ALT 2016 - Bari, Italy
Duration: 19 Oct 201621 Oct 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9925 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference27th International Conference on Algorithmic Learning Theory, ALT 2016
Country/TerritoryItaly
CityBari
Period19/10/1621/10/16

Fingerprint

Dive into the research topics of 'A spectral algorithm with additive clustering for the recovery of overlapping communities in networks'. Together they form a unique fingerprint.

Cite this