English

On the zeros of partition functions with multi-spin interactions

Probability 2024-06-28 v3 Data Structures and Algorithms Mathematical Physics Combinatorics math.MP

Abstract

Let X1,,XnX_1, \ldots, X_n be probability spaces, let XX be their direct product, let ϕ1,,ϕm:XC\phi_1, \ldots, \phi_m: X \longrightarrow {\Bbb C} be random variables, each depending only on a few coordinates of a point x=(x1,,xn)x=(x_1, \ldots, x_n), and let f=ϕ1++ϕmf=\phi_1 + \ldots + \phi_m. The expectation EeλfE\thinspace e^{\lambda f}, where λC\lambda \in {\Bbb C}, appears in statistical physics as the partition function of a system with multi-spin interactions, and also in combinatorics and computer science, where it is known as the partition function of edge-coloring models, tensor network contractions or a Holant polynomial. Assuming that each ϕi\phi_i is 1-Lipschitz in the Hamming metric of XX, that each ϕi(x)\phi_i(x) depends on at most r2r \geq 2 coordinates x1,,xnx_1, \ldots, x_n of xXx \in X, and that for each jj there are at most c1c \geq 1 functions ϕi\phi_i that depend on the coordinate xjx_j, we prove that Eeλf0E\thinspace e^{\lambda f} \ne 0 provided λ (3cr1)1| \lambda | \leq \ (3 c \sqrt{r-1})^{-1} and that the bound is sharp up to a constant factor. Taking a scaling limit, we prove a similar result for functions ϕ1,,ϕm:RnC\phi_1, \ldots, \phi_m: {\Bbb R}^n \longrightarrow {\Bbb C} that are 1-Lipschitz in the 1\ell^1 metric of Rn{\Bbb R}^n and where the expectation is taken with respect to the standard Gaussian measure in Rn{\Bbb R}^n. As a corollary, the value of the expectation can be efficiently approximated, provided λ\lambda lies in a slightly smaller disc.

Keywords

Cite

@article{arxiv.2406.04179,
  title  = {On the zeros of partition functions with multi-spin interactions},
  author = {Alexander Barvinok},
  journal= {arXiv preprint arXiv:2406.04179},
  year   = {2024}
}

Comments

21 page, minor improvements

R2 v1 2026-06-28T16:56:03.682Z