A near-optimal zero-free disk for the Ising model
From MaRDI portal
Publication:6615526
DOI10.5070/c64264237zbMATH Open1547.0514MaRDI QIDQ6615526
Viresh Patel, Ayla Stam, Guus Regts
Publication date: 8 October 2024
Published in: Combinatorial Theory (Search for Journal in Brave)
Graph polynomials (05C31) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Counting in two-spin models on \(d\)-regular graphs
- Combinatorics and complexity of partition functions
- On the convergence of cluster expansions for polymer gases
- Maxmaxflow and counting subgraphs
- Random even graphs
- Cluster expansion for abstract polymer models
- The Ising partition function: zeros and deterministic approximation
- Cluster expansion for abstract polymer models. New bounds from an old approach
- Graph Theory
- Location of zeros for the partition function of the Ising model on bounded degree graphs
- Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
- More on zeros and approximation of the Ising partition function
- Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
- Fisher zeros and correlation decay in the Ising model
- Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
- Statistical Mechanics of Lattice Systems
- Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model
- The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs
This page was built for publication: A near-optimal zero-free disk for the Ising model
