Algorithmic Pirogov-Sinai theory

We develop an efficient algorithmic approach for approximate counting and sampling in the low-temperature regime of a broad class of statistical physics models on finite subsets of the lattice ℤ d and on the torus (ℤ/ n ℤ) d . Our approach is based on combining contour representations from Pirogov–Sinai theory with Barvinok’s approach to approximate counting using truncated Taylor series. Some consequences of our main results include an FPTAS for approximating the partition function of the hard-core model at sufficiently high fugacity on subsets of ℤ d with appropriate boundary conditions and an efficient sampling algorithm for the ferromagnetic Potts model on the discrete torus (ℤ/ n ℤ) d at sufficiently low temperature.

Authors

• Tyler Helmuth
• Will Perkins 0001
• Guus Regts

Keywords

• Approximate counting algorithms
• Hard-core model
• Pirogov-Sinai theory
• Potts model
• sampling algorithms
• statistical physics