Papers › Semi-supervised Community Detection using Glauber Dynamics for an Ising Model
Semi-supervised Community Detection using Glauber Dynamics for an Ising Model
Konstantin Avrachenkov, Diego Goldsztajn
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We consider graphs with two communities and analyze an algorithm for learning the community labels when the edges of the graph and only a small fraction of the labels are known in advance. The algorithm is based on the Glauber dynamics for an Ising model where the energy function includes a quadratic penalty on the magnetization. The analysis focuses on graphs sampled from a Stochastic Block Model (SBM) with slowly growing mean degree. We derive a mean-field limit for the magnetization of each community, which can be used to choose the run-time of the algorithm to obtain a target accuracy level. We further prove that almost exact recovery is achieved in a number of iterations that is quasi-linear in the number of nodes. As a special case, our results provide the first rigorous analysis of the label propagation algorithm in the SBM with slowly diverging mean degree. We complement our theoretical results with several numerical experiments.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections