Pedagogical Talk: Random Optimisation Problems
summary
Examines max‑cut on a random d‑regular graph and shows the usual first‑moment estimate matches the free energy only up to a specific inverse‑temperature threshold β; above β the system exhibits replica‑symmetry breaking so the first‑moment bound is loose. Uses the planted model plus spatial‑mixing/non‑reconstruction on the broadcast tree to justify a truncated second‑moment and lower bound, then compares free energies to prove a phase transition. Provides concrete bounds for small d (e.g. d=3 cutoff ≈0.95 of edges) and an explicit variational formula for large d.
AI-written summary · about
chapters (12)
- 0:00Start
- 2:09What are random optimisation problems?
- 3:12The average case myth
- 11:39The probabilistic method
- 14:35A glimpse of complexity?
- 16:43Part 2
- 17:28Running example
- 18:48Combinatorial bounds
- 22:52The physics perspective
- 48:04The replica symmetry breaking transition
- 49:15First attempt
- 57:57The planted model diverges
related talks
49mExtremal Cuts of Sparse Random Graphs
01h 18mStatistical Physics and Computation in High Dimension
52mCounting Solutions to Random Constraint Satisfaction Problems
01h 31mGraphons and Graph Limits 2
45mRandom Walks on Directed Graphs
35mOn the Chromatic Number of Random Regular Graphs
43mInformation-Theoretic Bounds and Phase Transitions in Community Detection and High-Dimensional Clust
46mPhase Transitions in Random CSPs
