~/talk

Sampling From the Random Cluster Model at All Temperatures on Random Graphs

links:none on file
slides:none on file

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

  1. 0:00Introduction
  2. 1:10Background
  3. 2:10Models
  4. 3:50Random Cluster Partition
  5. 4:47Approximate Counting and Sampling
  6. 6:06General Comments
  7. 8:01Random Graphs
  8. 9:54Results
  9. 14:11Algorithms
  10. 15:50Techniques
  11. 16:41Three Steps
  12. 20:34Consequence
  13. 21:27Open Questions
~/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.