4.3 Article

Algorithmic Pirogov-Sinai theory

期刊

PROBABILITY THEORY AND RELATED FIELDS
卷 176, 期 3-4, 页码 851-895

出版社

SPRINGER HEIDELBERG
DOI: 10.1007/s00440-019-00928-y

关键词

Approximate sampling; Approximation algorithms; FPTAS; Discrete spin systems; Pirogov-Sinai theory; Cluster expansion

资金

  1. EPSRC [EP/P009913/1, EP/P003656/1]
  2. NSF [DMS-1847451]
  3. NWO Veni Grant
  4. EPSRC [EP/P003656/1, EP/P009913/1] Funding Source: UKRI

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.3
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据