We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Random Cluster Model on Regular Graphs.
- Authors
Bencs, Ferenc; Borbényi, Márton; Csikvári, Péter
- Abstract
For a graph G = (V , E) with v(G) vertices the partition function of the random cluster model is defined by Z G (q , w) = ∑ A ⊆ E (G) q k (A) w | A | , where k(A) denotes the number of connected components of the graph (V, A). Furthermore, let g(G) denote the girth of the graph G, that is, the length of the shortest cycle. In this paper we show that if (G n) n is a sequence of d-regular graphs such that the girth g (G n) → ∞ , then the limit lim n → ∞ 1 v (G n) ln Z G n (q , w) = ln Φ d , q , w exists if q ≥ 2 and w ≥ 0 . The quantity Φ d , q , w can be computed as follows. Let Φ d , q , w (t) : = 1 + w q cos (t) + (q - 1) w q sin (t) d + (q - 1) 1 + w q cos (t) - w q (q - 1) sin (t) d , then Φ d , q , w : = max t ∈ [ - π , π ] Φ d , q , w (t) , The same conclusion holds true for a sequence of random d-regular graphs with probability one. Our result extends the work of Dembo, Montanari, Sly and Sun for the Potts model (integer q), and we prove a conjecture of Helmuth, Jenssen and Perkins about the phase transition of the random cluster model with fixed q.
- Subjects
REGULAR graphs; RANDOM graphs; PHASE transitions; POTTS model; PARTITION functions; GRAPH connectivity; PARTITIONS (Mathematics)
- Publication
Communications in Mathematical Physics, 2023, Vol 399, Issue 1, p203
- ISSN
0010-3616
- Publication type
Article
- DOI
10.1007/s00220-022-04552-1