Related references
Note: Only part of the references are listed.Correlation decay and the absence of zeros property of partition functions
David Gamarnik
RANDOM STRUCTURES & ALGORITHMS (2023)
Correlation Decay and Partition Function Zeros: Algorithms and Phase Transitions
Jingcheng Liu et al.
SIAM JOURNAL ON COMPUTING (2022)
Approximate Counting and Sampling via Local Central Limit Theorems
Vishesh Jain et al.
PROCEEDINGS OF THE 54TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '22) (2022)
Spectral Independence via Stability and Applications to Holant-Type Problems
Zongchen Chen et al.
2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021) (2022)
Some applications of Wagner's weighted subgraph counting polynomial
Ferenc Bencs et al.
ELECTRONIC JOURNAL OF COMBINATORICS (2021)
Contraction: A Unified Perspective of Correlation Decay and Zero-Freeness of 2-Spin Systems
Shuai Shao et al.
JOURNAL OF STATISTICAL PHYSICS (2021)
Fractionally Log-Concave and Sector-Stable Polynomials: Counting Planar Matchings and More
Yeganeh Alimohammadi et al.
STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (2021)
Algorithmic Pirogov-Sinai theory
Tyler Helmuth et al.
PROBABILITY THEORY AND RELATED FIELDS (2020)
Cayley Trees do Not Determine the Maximal Zero-Free Locus of the Independence Polynomial
Pjotr Buys
MICHIGAN MATHEMATICAL JOURNAL (2020)
INAPPROXIMABILITY OF THE INDEPENDENT SET POLYNOMIAL IN THE COMPLEX PLANE
Ivona Bezakova et al.
SIAM JOURNAL ON COMPUTING (2020)
Fisher zeros and correlation decay in the Ising model
Jingcheng Liu et al.
JOURNAL OF MATHEMATICAL PHYSICS (2019)
Central limit theorems from the roots of probability generating functions
Marcus Michelen et al.
ADVANCES IN MATHEMATICS (2019)
On a Conjecture of Sokal Concerning Roots of the Independence Polynomial
Han Peters et al.
MICHIGAN MATHEMATICAL JOURNAL (2019)
Christoffel-Darboux Type Identities for the Independence Polynomial
Ferenc Bencs
COMBINATORICS PROBABILITY & COMPUTING (2018)
COMPUTING THE PARTITION FUNCTION FOR GRAPH HOMOMORPHISMS
Alexander Barvinok et al.
COMBINATORICA (2017)
DETERMINISTIC POLYNOMIAL-TIME APPROXIMATION ALGORITHMS FOR PARTITION FUNCTIONS AND GRAPH POLYNOMIALS
Viresh Patel et al.
SIAM JOURNAL ON COMPUTING (2017)
Central limit theorems, Lee-Yang zeros, and graph-counting polynomials
J. L. Lebowitz et al.
JOURNAL OF COMBINATORIAL THEORY SERIES A (2016)
Left and right convergence of graphs with bounded degree
Christian Borgs et al.
RANDOM STRUCTURES & ALGORITHMS (2013)
The roots of the independence polynomial of a clawfree graph
Maria Chudnovsky et al.
JOURNAL OF COMBINATORIAL THEORY SERIES B (2007)
Simple Deterministic Approximation Algorithms for Counting Matchings
Mohsen Bayati et al.
STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING (2007)
The repulsive lattice gas, the independent-set polynomial, and the Lovasz local lemma
AD Scott et al.
JOURNAL OF STATISTICAL PHYSICS (2005)
Bounds on the complex zeros of (Di)Chromatic polynomials and Potts-model partition functions
AD Sokal
COMBINATORICS PROBABILITY & COMPUTING (2001)