Find Your Place: Simple Distributed Algorithms for Community Detection - Archive ouverte HAL Access content directly
Journal Articles SIAM Journal on Computing Year : 2020

Find Your Place: Simple Distributed Algorithms for Community Detection


Given an underlying graph, we consider the following dynamics: Initially, each node locally chooses a value in {−1, 1}, uniformly at random and independently of other nodes. Then, in each consecutive round, every node updates its local value to the average of the values held by its neighbors, at the same time applying an elementary, local clustering rule that only depends on the current and the previous values held by the node. We prove that the process resulting from this dynamics produces a clustering that exactly or approximately (depending on the graph) reects the underlying cut in logarithmic time, under various graph models that exhibit a sparse balanced cut, including the stochastic block model. We also prove that a natural extension of this dynamics performs community detection on a regularized version of the stochastic block model with multiple communities. Rather surprisingly, our results provide rigorous evidence for the ability of an extremely simple and natural dynamics which is non-trivial even in a centralized setting.
Fichier principal
Vignette du fichier
find_your_place_preprint.pdf (641.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03025943 , version 1 (16-12-2020)



Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan. Find Your Place: Simple Distributed Algorithms for Community Detection. SIAM Journal on Computing, 2020, 49 (4), pp.821-864. ⟨10.1137/19M1243026⟩. ⟨hal-03025943⟩
94 View
87 Download



Gmail Facebook Twitter LinkedIn More