Fetching the paper…
Reading the bibliography…
For $d \ge 2$ and all $q\geq q_{0}(d)$ we give an efficient algorithm to approximately sample from the $q$-state ferromagnetic Potts and random cluster models on finite tori $(\mathbb Z / n \mathbb Z )^d$ for any inverse temperature $\beta\geq 0$.
General properties of polymer systems
C. Gruber and H. Kunz · 1971
Earlier work this paper cites.
Phase diagrams of classical lattice systems
S. A. Pirogov and Y. G. Sinai · 1975
Earlier work this paper cites.
First-order phase transitions in large entropy lattice models
R. Koteckỳ and S. Shlosman · 1982
Earlier work this paper cites.
Cluster expansion for abstract polymer models
R. Kotecký and D. Preiss · 1986
Earlier work this paper cites.
A unified approach to phase diagrams in field theory and statistical mechanics
C. Borgs and J. Z. Imbrie · 1989
Earlier work this paper cites.
Approximating the permanent
M. Jerrum and A. Sinclair · 1989
Earlier work this paper cites.
Finite-size scaling for Potts models
C. Borgs, R. Kotecký, and S. Miracle-Solé · 1991
Earlier work this paper cites.
Interfaces in the Potts model I: Pirogov-Sinai theory of the Fortuin-Kasteleyn representation
L. Laanait, A. Messager, S. Miracle-Solé, J. Ruiz, and S. Shlosman · 1991
Earlier work this paper cites.
Polynomial-time approximation algorithms for the Ising model
M. Jerrum and A. Sinclair · 1993
Earlier work this paper cites.
For 2-d lattice spin systems weak mixing implies strong mixing
F. Martinelli, E. Olivieri, and R. H. Schonmann · 1994
Earlier work this paper cites.
Mixing properties and exponential decay for lattice systems in finite volumes
K. S. Alexander · 2004
Earlier work this paper cites.
The relative complexity of approximate counting problems
M. Dyer, L. A. Goldberg, C. Greenhill, and M. Jerrum · 2004
Earlier work this paper cites.
Pirogov-sinai theory
R. Koteckỳ · 2006
Earlier work this paper cites.
Counting independent sets up to the tree threshold
D. Weitz · 2006
Earlier work this paper cites.
Adaptive simulated annealing: A near-optimal connection between sampling and counting
D. Štefankovič, S. Vempala, and E. Vigoda · 2009
Cited alongside, same era.
Computational transition at the uniqueness threshold
A. Sly · 2010
Cited alongside, same era.
Tight bounds for mixing of the Swendsen–Wang algorithm at the Potts transition point
C. Borgs, J. T. Chayes, and P. Tetali · 2012
Cited alongside, same era.
Left and right convergence of graphs with bounded degree
C. Borgs, J. Chayes, J. Kahn, and L. Lovász · 2013
Cited alongside, same era.
Comparison of Swendsen-Wang and heat-bath dynamics
M. Ullrich · 2013
Cited alongside, same era.
Counting in two-spin models on d-regular graphs
A. Sly and N. Sun · 2014
Cited alongside, same era.
Rigidity of proper colorings of ℤ d \mathbb{Z}^{d}
R. Peled and Y. Spinka · 2018
Later among the works it cites.
Weighted counting of solutions to sparse systems of equations
A. Barvinok and G. Regts · 2019
Closest in time.
On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs
F. Bencs, E. Davies, V. Patel, and G. Regts · 2019
Closest in time.
Zeros and approximations of Holant polynomials on the complex plane
K. Casel, P. Fischbeck, T. Friedrich, A. Göbel, and J. Lagodzinski · 2019
Closest in time.
Sharp phase transition for the random-cluster and Potts models via decision trees
H. Duminil-Copin, A. Raoufi, and V. Tassion · 2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models
A. Galanis, D. Štefankovič, and E. Vigoda · 2016
Cited alongside, same era.
Ferromagnetic Potts model: Refined #-BIS-hardness and related results
A. Galanis, D. Stefankovic, E. Vigoda, and L. Yang · 2016
Cited alongside, same era.
Combinatorics and complexity of partition functions
A. Barvinok · 2017
Cited alongside, same era.
Random-cluster dynamics in ℤ 2 \mathbb{Z}^{2}
A. Blanca and A. Sinclair · 2017
Cited alongside, same era.
Lectures on the Ising and Potts models on the hypercubic lattice
H. Duminil-Copin · 2017
Cited alongside, same era.
Statistical Mechanics of Lattice Systems: a Concrete Mathematical Introduction
S. Friedli and Y. Velenik · 2017
Cited alongside, same era.
Counting independent sets and colorings on random regular bipartite graphs
C. Liao, J. Lin, P. Lu, and Z. Mao · 2019
Closest in time.
A deterministic algorithm for counting colorings with 2-Delta colors
J. Liu, A. Sinclair, and P. Srivastava · 2019
Closest in time.
Efficient sampling and counting algorithms for the Potts model on ℤ d \mathbb{Z}^{d} at all temperatures (extended abstract)
C. Borgs, J. Chayes, T. Helmuth, W. Perkins, and P. Tetali · 2020
Closest in time.
Counting independent sets in unbalanced bipartite graphs
S. Cannon and W. Perkins · 2020
Closest in time.
Quasi-polynomial mixing of critical two-dimensional random cluster models
R. Gheissari and E. Lubetzky · 2020
Closest in time.
Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs
T. Helmuth, M. Jenssen, and W. Perkins · 2020
Closest in time.
Algorithmic Pirogov-Sinai theory
T. Helmuth, W. Perkins, and G. Regts · 2020
Closest in time.
Algorithms for #BIS-hard problems on expander graphs
M. Jenssen, P. Keevash, and W. Perkins · 2020
Closest in time.
Fast algorithms at low temperatures via Markov chains
Z. Chen, A. Galanis, L. A. Goldberg, W. Perkins, J. Stewart, and E. Vigoda · 2021
Closest in time.