Random cluster model on regular graphs
From MaRDI portal
Publication:6399073
DOI10.1007/S00220-022-04552-1arXiv2205.06565MaRDI QIDQ6399073FDOQ6399073
Authors: Ferenc Bencs, Márton Borbényi, Péter Csikvári
Publication date: 13 May 2022
Abstract: For a graph with vertices the partition function of the random cluster model is defined by Z_G(q,w)=sum_{Asubseteq E(G)}q^{k(A)}w^{|A|}, where denotes the number of connected components of the graph . Furthermore, let denote the girth of the graph , that is, the length of the shortest cycle. In this paper we show that if is a sequence of -regular graphs such that the girth , then the limit lim_{n o infty} frac{1}{v(G_n)}ln Z_{G_n}(q,w)=ln Phi_{d,q,w} exists if and . The quantity can be computed as follows. Let Phi_{d,q,w}(t):=left(sqrt{1+frac{w}{q}}cos(t)+sqrt{frac{(q-1)w}{q}}sin(t)
ight)^{d}+(q-1)left(sqrt{1+frac{w}{q}}cos(t)-sqrt{frac{w}{q(q-1)}}sin(t)
ight)^{d}, then Phi_{d,q,w}:=max_{tin [-pi,pi]}Phi_{d,q,w}(t), The same conclusion holds true for a sequence of random -regular graphs with probability one. Our result extends the work of Dembo, Montanari, Sly and Sun for the Potts model (integer ), and we prove a conjecture of Helmuth, Jenssen and Perkins about the phase transition of the random cluster model with fixed .
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Graph polynomials (05C31) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
This page was built for publication: Random cluster model on regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6399073)