We say a probability distribution μ is spectrally independent if an associated pairwise
influence matrix has a bounded largest eigenvalue for the distribution and all of its …

The answer depends on who you ask. You get one (multi) set of answers if you ask
physicists, and another (multi) set if you ask mathematicians (we allow multisets, in case we …

In this paper we show a new way of constructing deterministic polynomial-time
approximation algorithms for computing complex-valued evaluations of a large class of …

We introduce a unified framework to compute the solution space properties of a broad class
of combinatorial optimization problems. These properties include finding one of the optimum …

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 …

In this article, we introduce a new approach to approximate counting in bounded degree
systems with higher-order constraints. Our main result is an algorithm to approximately count …

We study the complex zeros of the partition function of the Ising model, viewed as a
polynomial in the “interaction parameter”; these are known as Fisher zeros in light of their …

We study the complexity of approximating the value of the independent set polynomial ZG
(λ) of a graph G with maximum degree Δ when the activity λ is a complex number. When λ is …

We give an FPTAS for computing the number of matchings of size k in a graph G of
maximum degree Δ on n vertices, for all k≤(1− δ) m*(G), where δ> 0 is fixed and m*(G) is …

We study the connection between the correlation decay property (more precisely, strong
spatial mixing) and the zero-freeness of the partition function of 2-spin systems on graphs of …