AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Distributed Community Detection via Metastability of the 2-Choices Dynamics

Emilio Cruciani, Emanuele Natale, Giacomo Scornavacca

AAAI 2019 · Graph learning › Graph algorithms and clustering · approach: Graph comparison and random features · 17 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Run 2-Choices dynamics from random binary states on a graph with b/d = O(n^{-1/2}) and λ = O(n^{-1/4})2-Choices dynamics · Clustered regular graphprobability of reaching almost-clustered configuration within O(log n) rounds: ≥ γ1Improved
Start from an almost-clustered configuration and continue the dynamics2-Choices dynamics · Clustered regular graphprobability of remaining almost-clustered for n^c rounds: ≥ 1 - n^{-γ2}Improved
Use Θ(log n) independent parallel runs as components of node label vectors2-Choices dynamics with Community-Sensitive Labeling · Clustered regular graphnumber of node pairs not meeting the labeling condition: polylogarithmic numberImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy