Sampling From the Random Cluster Model at All Temperatures on Random Graphs
summary
For random d‑regular graphs with d ≥ 5 and q at least about d^d, there are polynomial‑time algorithms that approximately count and sample the Potts and random‑cluster measures at every inverse temperature (subcritical, supercritical and critical). The proof rewrites each phase as a polymer model and proves convergent cluster expansion bounds using expansion properties to show configurations have >90% or <10% of edges w.h.p.; consequences include analytic free energy off criticality, exponential decay of correlations, local weak convergence to free/wired tree measures, and an explicit limiting distribution at criticality determined by small cycle counts.
AI-written summary · about
chapters (13)
- 0:00Introduction
- 1:10Background
- 2:10Models
- 3:50Random Cluster Partition
- 4:47Approximate Counting and Sampling
- 6:06General Comments
- 8:01Random Graphs
- 9:54Results
- 14:11Algorithms
- 15:50Techniques
- 16:41Three Steps
- 20:34Consequence
- 21:27Open Questions
related talks
35mOn the Chromatic Number of Random Regular Graphs
44mAlgorithmic Pirogov-Sinai Theory
25mLucky Talk: From Coding to Clustering
54mNegative Dependence and Lorentzian Polynomials
42mBootstrap Percolation on Random Graphs
35mContagious Sets in Random Graphs
01h 04mHigher-dimensional Expansion of Random Geometric Complexes
46mPhase Transitions in Random CSPs
