pith. sign in

arxiv: 1611.01147 · v3 · pith:BKVSDAVMnew · submitted 2016-11-03 · 🧮 math.PR · math-ph· math.MP

Quasi-polynomial mixing of critical 2D random cluster models

classification 🧮 math.PR math-phmath.MP
keywords criticalmixingboundclusterdynamicsmathbbmodelmodels
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.