Information-Theoretic Bounds and Phase Transitions in Community Detection and High-Dimensional Clust
summary
Uses the second moment method and small-subgraph conditioning to bound when planted structure is statistically detectable versus a null Erdős–Rényi graph, showing an explicit threshold: roughly lambda^2·d ≲ 2 log K/(K−1) (so information-theoretic detection sits below the Kesten–Stigum / spectral threshold for large K). The proof converts the likelihood-ratio variance into an overlap entropy vs Frobenius-norm optimization, proves contiguity in that regime, and connects to spectral tests based on the nonbacktracking matrix.
AI-written summary · about
chapters (9)
- 0:00Start
- 6:07The Stochastic Block Model
- 11:08Planted Coloring Problem
- 16:42Likelihood Ratio Testing
- 26:13An Overlap Matrix
- 28:56Entropy of Zeta
- 35:41Spectral Method
- 38:11Big Data Limit
- 42:29Condensation Point
related talks
35mLocal Statistics, Semidefinite Programming, and Community Detection II
25mFundamental Limit of Community Detection in Stochastic Block Models
39mLocal Algorithms for Community Detection
11mUnderstanding Statistical-to-Computational Gaps via Low-Degree Polynomials
43mGlobal Community Detection Using Individual-Centered Partial Information Networks
41mReducibility and Statistical-Computational Gaps from Secret Leakage
41mGeneral Network Models with Transitive Structures
01h 11mStatistical Physics and Computation in High Dimension
