Algorithmic Pirogov-Sinai theory
From MaRDI portal
Publication:5212841
DOI10.1145/3313276.3316305zbMath1437.82006arXiv1806.11548OpenAlexW2963026085MaRDI QIDQ5212841
Will Perkins, Guus Regts, Tyler Helmuth
Publication date: 30 January 2020
Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.11548
statistical physicsPotts modelhard-core modelsampling algorithmsPirogov-Sinai theoryapproximate counting algorithms
Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Statistical mechanics of magnetic materials (82D40) Basic methods in statistical mechanics (82M99)
Related Items
An FPTAS for the hardcore model on random regular bipartite graphs, Zeros and approximations of holant polynomials on the complex plane, A dichotomy for bounded degree graph homomorphisms with nonnegative weights, Fast algorithms at low temperatures via Markov chains†, Algorithms for hard-constraint point processes via discretization, Spatial mixing and the random‐cluster dynamics on lattices, Large scale stochastic dynamics. Abstracts from the workshop held September 11--17, 2022, Homomorphisms from the torus, Low-temperature Ising dynamics with random initializations, Unnamed Item, Unnamed Item, Large scale stochastic dynamics. Abstracts from the workshop held September 15--21, 2019, Counting Independent Sets and Colorings on Random Regular Bipartite Graphs, Unnamed Item, Unnamed Item, Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs, Weighted counting of solutions to sparse systems of equations, Polymer dynamics via cliques: new conditions for approximations
