~/talk

Local Algorithms for Community Detection

links:none on file
slides:none on file

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

  1. 0:00Local algorithms intro
  2. 3:24Broadcasting on trees
  3. 11:44Phase transitions in models
  4. 19:59Block models connection
  5. 27:00Belief propagation optimality
  6. 32:43Counting in percolation
  7. 37:01Open problems
~/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.