Algorithmic Pirogov-Sinai theory
| Authors |
|
|---|---|
| Publication date | 2019 |
| Host editors |
|
| Book title | STOC '19 |
| Book subtitle | Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing |
| ISBN (electronic) |
|
| Event | 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019 |
| Pages (from-to) | 1009-1020 |
| Number of pages | 12 |
| Publisher | New York, NY: Association for Computing Machinery |
| Organisations |
|
| Abstract |
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 Zd and on the torus (Z/nZ)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 Zd with appropriate boundary conditions and an efficient sampling algorithm for the ferromagnetic Potts model on the discrete torus (Z/nZ)d at sufficiently low temperature. |
| Document type | Conference contribution |
| Language | English |
| Published at | https://doi.org/10.1145/3313276.3316305 |
| Other links | https://www.scopus.com/pages/publications/85068747330 |
| Permalink to this page | |