Efficient sampling and counting algorithms for the Potts model on ℤd at all temperatures
From MaRDI portal
Publication:6051061
DOI10.1002/RSA.21131MaRDI QIDQ6051061
Christian Borgs, Will Perkins, Prasad Tetali, Tyler Helmuth, Jennifer T. Chayes
Publication date: 12 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
phase transitionPotts modelrandom cluster modelPirogov-Sinai theoryapproximate counting and sampling
Cites Work
- Counting in two-spin models on \(d\)-regular graphs
- Interfaces in the Potts model. I: Pirogov-Sinai theory of the Fortuin- Kasteleyn representation
- On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs
- Cluster expansion for abstract polymer models
- A unified approach to phase diagrams in field theory and statistical mechanics
- For 2-D lattice spin systems weak mixing implies strong mixing
- Random cluster dynamics for the Ising model is rapidly mixing
- Sharp phase transition for the random-cluster and Potts models via decision trees
- The relative complexity of approximate counting problems
- Mixing properties and exponential decay for lattice systems in finite volumes.
- Algorithmic Pirogov-Sinai theory
- Random-cluster dynamics in \(\mathbb {Z}^2\)
- Tight bounds for mixing of the Swendsen-Wang algorithm at the Potts transition point
- Comparison of Swendsen-Wang and heat-bath dynamics
- Counting independent sets up to the tree threshold
- Polynomial-Time Approximation Algorithms for the Ising Model
- Approximating the Permanent
- Lectures on the Ising and Potts Models on the Hypercubic Lattice
- Algorithms for #BIS-Hard Problems on Expander Graphs
- Adaptive simulated annealing: A near-optimal connection between sampling and counting
- Mixing Times of Critical Two‐Dimensional Potts Models
- Left and right convergence of graphs with bounded degree
- Quasi‐polynomial mixing of critical two‐dimensional random cluster models
- Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures
- Counting independent sets in unbalanced bipartite graphs
- Weighted counting of solutions to sparse systems of equations
- Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
- Counting Independent Sets and Colorings on Random Regular Bipartite Graphs
- Fast algorithms at low temperatures via Markov chains†
This page was built for publication: Efficient sampling and counting algorithms for the Potts model on ℤd at all temperatures
