On the zeros of partition functions with multi-spin interactions (2406.04179v3)
Abstract: Let $X_1, \ldots, X_n$ be probability spaces, let $X$ be their direct product, let $\phi_1, \ldots, \phi_m: X \longrightarrow {\Bbb C}$ be random variables, each depending only on a few coordinates of a point $x=(x_1, \ldots, x_n)$, and let $f=\phi_1 + \ldots + \phi_m$. The expectation $E\thinspace e{\lambda f}$, where $\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 $\phi_i$ is 1-Lipschitz in the Hamming metric of $X$, that each $\phi_i(x)$ depends on at most $r \geq 2$ coordinates $x_1, \ldots, x_n$ of $x \in X$, and that for each $j$ there are at most $c \geq 1$ functions $\phi_i$ that depend on the coordinate $x_j$, we prove that $E\thinspace e{\lambda f} \ne 0$ provided $| \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 $\phi_1, \ldots, \phi_m: {\Bbb R}n \longrightarrow {\Bbb C}$ that are 1-Lipschitz in the $\ell1$ metric of ${\Bbb R}n$ and where the expectation is taken with respect to the standard Gaussian measure in ${\Bbb R}n$. As a corollary, the value of the expectation can be efficiently approximated, provided $\lambda$ lies in a slightly smaller disc.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.