English

Random cluster model on regular graphs

Combinatorics 2022-11-30 v2 Mathematical Physics math.MP Probability

Abstract

For a graph G=(V,E)G=(V,E) with v(G)v(G) vertices the partition function of the random cluster model is defined by ZG(q,w)=AE(G)qk(A)wA,Z_G(q,w)=\sum_{A\subseteq E(G)}q^{k(A)}w^{|A|}, where k(A)k(A) denotes the number of connected components of the graph (V,A)(V,A). Furthermore, let g(G)g(G) denote the girth of the graph GG, that is, the length of the shortest cycle. In this paper we show that if (Gn)n(G_n)_n is a sequence of dd-regular graphs such that the girth g(Gn)g(G_n)\to \infty, then the limit limn1v(Gn)lnZGn(q,w)=lnΦd,q,w\lim_{n\to \infty} \frac{1}{v(G_n)}\ln Z_{G_n}(q,w)=\ln \Phi_{d,q,w} exists if q2q\geq 2 and w0w\geq 0. The quantity Φd,q,w\Phi_{d,q,w} can be computed as follows. Let Φd,q,w(t):=(1+wqcos(t)+(q1)wqsin(t))d+(q1)(1+wqcos(t)wq(q1)sin(t))d,\Phi_{d,q,w}(t):=\left(\sqrt{1+\frac{w}{q}}\cos(t)+\sqrt{\frac{(q-1)w}{q}}\sin(t)\right)^{d}+(q-1)\left(\sqrt{1+\frac{w}{q}}\cos(t)-\sqrt{\frac{w}{q(q-1)}}\sin(t)\right)^{d}, then Φd,q,w:=maxt[π,π]Φd,q,w(t),\Phi_{d,q,w}:=\max_{t\in [-\pi,\pi]}\Phi_{d,q,w}(t), The same conclusion holds true for a sequence of random dd-regular graphs with probability one. Our result extends the work of Dembo, Montanari, Sly and Sun for the Potts model (integer qq), and we prove a conjecture of Helmuth, Jenssen and Perkins about the phase transition of the random cluster model with fixed qq.

Keywords

Cite

@article{arxiv.2205.06565,
  title  = {Random cluster model on regular graphs},
  author = {Ferenc Bencs and Márton Borbényi and Péter Csikvári},
  journal= {arXiv preprint arXiv:2205.06565},
  year   = {2022}
}

Comments

38 pages