Zero-Freeness is All You Need: A Weitz-Type FPTAS for the Entire Lee-Yang Zero-Free Region

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Shao, Shuai, Shi, Ke
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917152935641088
author Shao, Shuai
Shi, Ke
author_facet Shao, Shuai
Shi, Ke
contents We present a Weitz-type FPTAS for the ferromagnetic Ising model across the entire Lee--Yang zero-free region, without relying on the strong spatial mixing (SSM) property. Our algorithm is Weitz-type for two reasons. First, it expresses the partition function as a telescoping product of ratios, with the key being to approximate each ratio. Second, it uses Weitz's self-avoiding walk tree, and truncates it at logarithmic depth to give a good and efficient approximation. The key difference from the standard Weitz algorithm is that we approximate a carefully designed edge-deletion ratio instead of the marginal probability of a vertex being assigned a particular spin, ensuring our algorithm does not require SSM. Furthermore, by establishing local dependence of coefficients (LDC), we prove a novel form of SSM for these edge-deletion ratios, which, in turn, implies the standard SSM for the random cluster model. This is the first SSM result for the random cluster model on general graphs, beyond lattices. Our proof of LDC is based on a new divisibility relation, and we show such relations hold quite universally. This leads to a broadly applicable framework for proving LDC across a variety of models, including the Potts model, the hypergraph independence polynomial, and Holant problems. Combined with existing zero-freeness results for these models, we derive new SSM results for them.
format Preprint
id arxiv_https___arxiv_org_abs_2509_06623
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Zero-Freeness is All You Need: A Weitz-Type FPTAS for the Entire Lee-Yang Zero-Free Region
Shao, Shuai
Shi, Ke
Data Structures and Algorithms
Combinatorics
Probability
We present a Weitz-type FPTAS for the ferromagnetic Ising model across the entire Lee--Yang zero-free region, without relying on the strong spatial mixing (SSM) property. Our algorithm is Weitz-type for two reasons. First, it expresses the partition function as a telescoping product of ratios, with the key being to approximate each ratio. Second, it uses Weitz's self-avoiding walk tree, and truncates it at logarithmic depth to give a good and efficient approximation. The key difference from the standard Weitz algorithm is that we approximate a carefully designed edge-deletion ratio instead of the marginal probability of a vertex being assigned a particular spin, ensuring our algorithm does not require SSM. Furthermore, by establishing local dependence of coefficients (LDC), we prove a novel form of SSM for these edge-deletion ratios, which, in turn, implies the standard SSM for the random cluster model. This is the first SSM result for the random cluster model on general graphs, beyond lattices. Our proof of LDC is based on a new divisibility relation, and we show such relations hold quite universally. This leads to a broadly applicable framework for proving LDC across a variety of models, including the Potts model, the hypergraph independence polynomial, and Holant problems. Combined with existing zero-freeness results for these models, we derive new SSM results for them.
title Zero-Freeness is All You Need: A Weitz-Type FPTAS for the Entire Lee-Yang Zero-Free Region
topic Data Structures and Algorithms
Combinatorics
Probability
url https://arxiv.org/abs/2509.06623