~/talk

Information-Theoretic Bounds and Phase Transitions in Community Detection and High-Dimensional Clust

links:none on file
slides:none on file

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

  1. 0:00Start
  2. 6:07The Stochastic Block Model
  3. 11:08Planted Coloring Problem
  4. 16:42Likelihood Ratio Testing
  5. 26:13An Overlap Matrix
  6. 28:56Entropy of Zeta
  7. 35:41Spectral Method
  8. 38:11Big Data Limit
  9. 42:29Condensation Point
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.