Curie--Weiss: fast mixing for
ProvedMarkovMixing.ising_complete_graph_fastThe Curie–Weiss model is the Ising model on the complete graph : spins on vertices, every pair interacting, with Gibbs distribution at inverse temperature — the scaling that makes the total interaction per site of constant order, with the effective temperature parameter. The Glauber dynamics re-samples a uniformly chosen site from the conditional distribution; the mixing time is the first with , where .
The theorem (Theorem 15.3(i) of Levin–Peres–Wilmer) asserts: for every , every , and every ,
Below the critical value the mean-field dynamics mixes in order steps. The proof is one line from the high-temperature theorem of this mission: on the degree is and . The companion theorem shows that above the same dynamics needs exponentially many steps — the dynamical phase transition.
import Definitions.Def_mm_ising import Mathlib.Analysis.SpecialFunctions.Log.Basic
namespace MarkovMixing
/-- **Theorem 15.3(i)** (LPW): for the Glauber dynamics of the Ising model
on the complete graph on `n` vertices at `β = α/n` with `α < 1`,
`t_mix(ε) ≤ ⌈n(log n + log(1/ε))/(1−α)⌉` (the ceiling absorbs integer
rounding). -/
theorem ising_complete_graph_fast (n : ℕ) (hn : 2 ≤ n)
(α : ℝ) (hα0 : 0 < α) (hα : α < 1) (ε : ℝ) (hε : 0 < ε) (hε1 : ε < 1) :
(mixingTime (glauber (isingDist (⊤ : SimpleGraph (Fin n)) (α / n)))
(isingDist (⊤ : SimpleGraph (Fin n)) (α / n)) ε : ℝ) ≤
⌈(n : ℝ) * (Real.log n + Real.log (1 / ε)) / (1 - α)⌉₊ := by
sorry
end MarkovMixing