Sampling from the low temperature Potts model through a Markov chain on flows
From MaRDI portal
Publication:6077056
DOI10.1002/rsa.21089arXiv2103.07360OpenAlexW3138824174MaRDI QIDQ6077056
Guus Regts, Unnamed Author, Viresh Patel
Publication date: 17 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.07360
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random even graphs
- Random cluster dynamics for the Ising model is rapidly mixing
- The relative complexity of approximate counting problems
- Algorithmic Pirogov-Sinai theory
- Tight bounds for mixing of the Swendsen-Wang algorithm at the Potts transition point
- Polynomial-Time Approximation Algorithms for the Ising Model
- Algorithms for #BIS-Hard Problems on Expander Graphs
- Mixing of the Glauber dynamics for the ferromagnetic Potts model
- A more rapidly mixing Markov chain for graph colorings
- Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures
- Weighted counting of solutions to sparse systems of equations
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
- A Contribution to the Theory of Chromatic Polynomials
- Fast algorithms at low temperatures via Markov chains†