Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the zeros of partition functions with multi-spin interactions

Published 6 Jun 2024 in math.PR, cs.DS, math-ph, math.CO, and math.MP | (2406.04179v3)

Abstract: Let X1,…,XnX_1, \ldots, X_n be probability spaces, let XX be their direct product, let ϕ1,…,ϕm:X⟶C\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 E e<sup>λ</sup>fE\thinspace e<sup>{\lambda</sup> 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 r≥2r \geq 2 coordinates x1,…,xnx_1, \ldots, x_n of x∈Xx \in X, and that for each jj there are at most c≥1c \geq 1 functions ϕi\phi_i that depend on the coordinate xjx_j, we prove that E e<sup>λ</sup>f≠0E\thinspace e<sup>{\lambda</sup> f} \ne 0 provided ∣λ∣≤ (3cr−1)<sup>−1| \lambda | \leq \ (3 c \sqrt{r-1})<sup>{-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:R<sup>n</sup>⟶C\phi_1, \ldots, \phi_m: {\Bbb R}<sup>n</sup> \longrightarrow {\Bbb C} that are 1-Lipschitz in the ℓ<sup>1\ell<sup>1 metric of R<sup>n{\Bbb R}<sup>n and where the expectation is taken with respect to the standard Gaussian measure in R<sup>n{\Bbb R}<sup>n. As a corollary, the value of the expectation can be efficiently approximated, provided λ\lambda lies in a slightly smaller disc.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.