Random cluster model on regular graphs
From MaRDI portal
Publication:2696100
DOI10.1007/s00220-022-04552-1OpenAlexW4309010670MaRDI QIDQ2696100
Péter Csikvári, Ferenc Bencs, Márton Borbényi
Publication date: 6 April 2023
Published in: Communications in Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.06565
Cites Work
- Unnamed Item
- Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs
- Counting in two-spin models on \(d\)-regular graphs
- Benjamini-Schramm continuity of root moments of graph polynomials
- Ising models on locally tree-like graphs
- Weighted enumeration of spanning subgraphs with degree constraints
- Short cycles in random regular graphs
- Evaluations of Tutte polynomials of regular graphs
- Counting degree-constrained subgraphs and orientations
- Factor models on locally tree-like graphs
- The replica symmetric solution for Potts models on \(d\)-regular graphs
- Loop calculus in statistical physics and information science
- Loop series for discrete statistical models on graphs
- Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models
- Information, Physics, and Computation
- Left and right convergence of graphs with bounded degree
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
- Statistical Theory of Equations of State and Phase Transitions. I. Theory of Condensation
- Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model
- A Contribution to the Theory of Chromatic Polynomials
This page was built for publication: Random cluster model on regular graphs
