On the zeros of partition functions with multi-spin interactions
Abstract
Let X1, …, Xn be probability spaces, let X be their direct product, let φ1, …, φm: X C be random variables, each depending only on a few coordinates of a point x=(x1, …, xn), and let f=φ1 + … + φm. The expectation E eλ f, where λ ∈ 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 is 1-Lipschitz in the Hamming metric of X, that each φi(x) depends on at most r ≥ 2 coordinates x1, …, xn of x ∈ X, and that for each j there are at most c ≥ 1 functions φi that depend on the coordinate xj, we prove that E eλ f 0 provided | λ | ≤ \ (3 c 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: Rn C that are 1-Lipschitz in the 1 metric of Rn and where the expectation is taken with respect to the standard Gaussian measure in Rn. As a corollary, the value of the expectation can be efficiently approximated, provided λ lies in a slightly smaller disc.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.