TL;DR
This paper establishes the existence of the limiting free energy per vertex for the random cluster model on sequences of large girth regular graphs, extending previous work and confirming a conjecture about phase transitions.
Contribution
It proves the limit of the normalized log of the partition function exists for large girth regular graphs when q≥2, and provides an explicit formula for this limit, extending prior results.
Findings
Limit of normalized log-partition function exists for large girth graphs.
Explicit formula for the limiting free energy involving a maximization over t.
Extension of previous results and confirmation of a phase transition conjecture.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Random Cluster Model on Regular Graphs· youtube
