Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Quasi-polynomial mixing of critical 2D random cluster models (1611.01147v3)

Published 3 Nov 2016 in math.PR, math-ph, and math.MP

Abstract: We study the Glauber dynamics for the random cluster (FK) model on the torus $(\mathbb{Z}/n\mathbb{Z})2$ with parameters $(p,q)$, for $q \in (1,4]$ and $p$ the critical point $p_c$. The dynamics is believed to undergo a critical slowdown, with its continuous-time mixing time transitioning from $O(\log n)$ for $p\neq p_c$ to a power-law in $n$ at $p=p_c$. This was verified at $p\neq p_c$ by Blanca and Sinclair, whereas at the critical $p=p_c$, with the exception of the special integer points $q=2,3,4$ (where the model corresponds to the Ising/Potts models) the best-known upper bound on mixing was exponential in $n$. Here we prove an upper bound of $n{O(\log n)}$ at $p=p_c$ for all $q\in (1,4]$, where a key ingredient is bounding the number of nested long-range crossings at criticality.

Summary

We haven't generated a summary for this paper yet.