Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Recent Results on Broadcasting on Trees and Stochastic Block Model

Harvard CMSA via YouTube

Start learning Write review
Coursera Ad

Gain a Splash of New Skills - Coursera+ Annual Nearly 45% Off

Learn More → Corporate Finance Institute Ad

35% Off Finance Skills That Get You Hired - Code CFI35

Learn More →

Overview

Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore a technical lecture from MIT's Yury Polyanskiy examining recent developments in q-ary stochastic block model and broadcasting on trees (BOT). Delve into the mathematical analysis of uniqueness in distribution recursions and its implications for limiting mutual information between graph and community labels. Learn how uniqueness holds universally for q=2 cases, while q>2 scenarios currently show uniqueness only above specific thresholds approaching Kesten-Stigum bounds. Examine the relationship between BOT reconstruction and Kesten-Stigum thresholds, including cases involving vertex-level side information. Discover extensions to the Janson-Mossel 2004 robust reconstruction result, presented through collaborative research with Princeton's Qian Yu and MIT's Yuzhou Gu.

Syllabus

Yury Polyanskiy | Recent results on broadcasting on trees and stochastic block model

Taught by

Harvard CMSA

Reviews

Start your review of Recent Results on Broadcasting on Trees and Stochastic Block Model

Start learning

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.