~/talk

Pedagogical Talk: Random Optimisation Problems

links:none on file
slides:none on file

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

  1. 0:00Start
  2. 2:09What are random optimisation problems?
  3. 3:12The average case myth
  4. 11:39The probabilistic method
  5. 14:35A glimpse of complexity?
  6. 16:43Part 2
  7. 17:28Running example
  8. 18:48Combinatorial bounds
  9. 22:52The physics perspective
  10. 48:04The replica symmetry breaking transition
  11. 49:15First attempt
  12. 57:57The planted model diverges
~/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.