Random cluster model on regular graphs
Combinatorics
2022-11-30 v2 Mathematical Physics
math.MP
Probability
Abstract
For a graph with vertices the partition function of the random cluster model is defined by 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 exists if and . The quantity can be computed as follows. Let then 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 .
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