Optimal-mixing conjecture for Kawasaki dynamics above the analytic threshold

From papers

Let GΔ\mathcal G_\Delta be the class of graphs under consideration, let μ^G,β,η\hat{\mu}_{G,\beta,\eta} be the fixed-magnetization Ising measure on GGΔG\in\mathcal G_\Delta, and let βu\beta_u and ηa\eta_a denote the uniqueness and analytic thresholds, respectively. Optimal-mixing conjecture. If 0β<βu0\leq\beta<\beta_u or if β>βu\beta>\beta_u and η>ηa|\eta|>\eta_a, then the Kawasaki dynamics for μ^G,β,η\hat{\mu}_{G,\beta,\eta} are optimally mixing: for every GGΔG\in\mathcal G_\Delta, the mixing time is in O(V(G)log(V(G)))O(|V(G)|\cdot\log(|V(G)|)). This is presented as an improvement of the paper's rapid-mixing theorem; the supplied text gives no resolution, so the conjecture remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Aiya Kuchukova, Marcus Pappik, Will Perkins and Corrine Yap, “Fast and Slow Mixing of the Kawasaki Dynamics on Bounded-Degree Graphs”, arXiv:2405.06209 (2025).

Solutions 0

No solutions have been posted yet.