6 research outputs found
Computing the partition function of a polynomial on the Boolean cube
For a polynomial f: {-1, 1}^n --> C, we define the partition function as the
average of e^{lambda f(x)} over all points x in {-1, 1}^n, where lambda in C is
a parameter. We present a quasi-polynomial algorithm, which, given such f,
lambda and epsilon >0 approximates the partition function within a relative
error of epsilon in N^{O(ln n -ln epsilon)} time provided |lambda| < 1/(2 L
sqrt{deg f}), where L=L(f) is a parameter bounding the Lipschitz constant of f
from above and N is the number of monomials in f. As a corollary, we obtain a
quasi-polynomial algorithm, which, given such an f with coefficients +1 and -1
and such that every variable enters not more than 4 monomials, approximates the
maximum of f on {-1, 1}^n within a factor of O(sqrt{deg f}/delta), provided the
maximum is N delta for some 0< delta <1. If every variable enters not more than
k monomials for some fixed k > 4, we are able to establish a similar result
when delta > (k-1)/k.Comment: The final version of this paper is due to be published in the
collection of papers "A Journey through Discrete Mathematics. A Tribute to
Jiri Matousek" edited by Martin Loebl, Jaroslav Nesetril and Robin Thomas, to
be published by Springe
The Ising Partition Function: Zeros and Deterministic Approximation
We study the problem of approximating the partition function of the
ferromagnetic Ising model in graphs and hypergraphs. Our first result is a
deterministic approximation scheme (an FPTAS) for the partition function in
bounded degree graphs that is valid over the entire range of parameters
(the interaction) and (the external field), except for the case
(the "zero-field" case). A randomized algorithm (FPRAS)
for all graphs, and all , has long been known. Unlike most other
deterministic approximation algorithms for problems in statistical physics and
counting, our algorithm does not rely on the "decay of correlations" property.
Rather, we exploit and extend machinery developed recently by Barvinok, and
Patel and Regts, based on the location of the complex zeros of the partition
function, which can be seen as an algorithmic realization of the classical
Lee-Yang approach to phase transitions. Our approach extends to the more
general setting of the Ising model on hypergraphs of bounded degree and edge
size, where no previous algorithms (even randomized) were known for a wide
range of parameters. In order to achieve this extension, we establish a tight
version of the Lee-Yang theorem for the Ising model on hypergraphs, improving a
classical result of Suzuki and Fisher.Comment: clarified presentation of combinatorial arguments, added new results
on optimality of univariate Lee-Yang theorem
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 and on the torus
. 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 with
appropriate boundary conditions and an efficient sampling algorithm for the
ferromagnetic Potts model on the discrete torus at
sufficiently low temperature
Recommended from our members
Approximate counting, phase transitions and geometry of polynomials
In classical statistical physics, a phase transition is understood by studying the geometry (the zero-set) of an associated polynomial (the partition function). In this thesis, we will show that one can exploit this notion of phase transitions algorithmically, and conversely exploit the analysis of algorithms to understand phase transitions. As applications, we give efficient deterministic approximation algorithms (FPTAS) for counting -colorings, and for computing the partition function of the Ising model