Local Algorithms for Community Detection
summary
Studies reconstruction on a Poisson D tree and gives exact conditions when noisy boundary labels give the same root-recovery probability as perfect labels (e.g. relates to D(1−2ε)^2 thresholds and nontrivial limits). Shows that initializing with any slightly-better-than-random estimator and running belief propagation (a local algorithm) reaches information-theoretic optimal recovery for two equal-size clusters, extends to models with side information and degree-correlated trees, and poses open counterexamples and deterministic-counting questions.
AI-written summary · about
chapters (7)
- 0:00Local algorithms intro
- 3:24Broadcasting on trees
- 11:44Phase transitions in models
- 19:59Block models connection
- 27:00Belief propagation optimality
- 32:43Counting in percolation
- 37:01Open problems
related talks
25mFundamental Limit of Community Detection in Stochastic Block Models
35mLocal Statistics, Semidefinite Programming, and Community Detection II
47mLearning Probabilistic Models for Graph Partitioning in the Presence of Noise
25mLucky Talk: From Coding to Clustering
45mCorrelated Stochastic Block Models: Graph Matching And Community Recovery
43mInformation-Theoretic Bounds and Phase Transitions in Community Detection and High-Dimensional Clust
52mNew Algorithms For The Graph Alignment Problem
11mSharp Threshold for the Planted Matching Problem
