Location of zeros for the partition function of the Ising model on bounded degree graphs

DOI10.1112/jlms.12286zbMath1447.82010arXiv1810.01699OpenAlexW2895543709WikidataQ126863847 ScholiaQ126863847MaRDI QIDQ3296755

Han Peters, Guus Regts

Publication date: 1 July 2020

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.01699

zbMATH Keywords

ferromagnetic Ising modelLee-Yang theorem

Mathematics Subject Classification ID

Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Statistical mechanics of magnetic materials (82D40)

Related Items

On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs ⋮ Chromatic zeros on hierarchical lattices and equidistribution on parameter space ⋮ Ising model with Curie-Weiss perturbation ⋮ Zero-freeness and approximation of real Boolean Holant problems ⋮ Lee-Yang zeros of the antiferromagnetic Ising model ⋮ Approximating the chromatic polynomial is as hard as computing it exactly ⋮ Thermodynamic limit of the first Lee‐Yang zero ⋮ Zeros, chaotic ratios and the computational complexity of approximating the independence polynomial ⋮ Some applications of Wagner's weighted subgraph counting polynomial ⋮ Unnamed Item ⋮ Contraction: a unified perspective of correlation decay and zero-freeness of 2-spin systems ⋮ More on zeros and approximation of the Ising partition function ⋮ Limiting measure of Lee-Yang zeros for the Cayley tree ⋮ The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs ⋮ Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs

Cites Work

• Unnamed Item
• The complexity of computing the permanent
• The Lee--Yang and Pólya--Schur programs. I: Linear operators preserving stability
• Characterization of Lee-Yang polynomials
• Griffiths' singularities in diluted Ising models on the Cayley tree
• The complexity of approximating complex-valued Ising and Tutte partition functions
• The Ising partition function: zeros and deterministic approximation
• Some new results on Yang-Lee zeros of the Ising model partition function
• On a conjecture of Sokal concerning roots of the independence polynomial
• Limiting measure of Lee-Yang zeros for the Cayley tree
• Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
• Counting independent sets up to the tree threshold
• Polynomial-Time Approximation Algorithms for the Ising Model
• Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs
• The Lee‐Yang and Pólya‐Schur programs. II. Theory of stable polynomials and applications
• The Complexity of Enumeration and Reliability Problems
• Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
• Fisher zeros and correlation decay in the Ising model
• Inapproximability of the independent set polynomial in the complex plane
• Computational Complexity
• Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
• Dynamics in One Complex Variable. (AM-160)
• Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model
• Zeros of the partition function for generalized ising systems
• On the distribution and gap structure of Lee-Yang zeros for the Ising model: Periodic and aperiodic couplings