The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs
From MaRDI portal
Publication:5866450
DOI10.1137/21M1454043MaRDI QIDQ5866450
Leslie Ann Goldberg, Andrés Herrera-Poyatos, Andreas Galanis
Publication date: 21 September 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.00287
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Holant problems for 3-regular graphs with complex edge functions
- Combinatorics and complexity of partition functions
- Computing in the field of complex algebraic numbers
- The complexity of approximating complex-valued Ising and Tutte partition functions
- The Ising partition function: zeros and deterministic approximation
- The complexity of approximating the complex-valued Potts model
- Cayley trees do not determine the maximal zero-free locus of the independence polynomial
- On a conjecture of Sokal concerning roots of the independence polynomial
- Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
- Theory of monomer-dimer systems
- Counting independent sets up to the tree threshold
- Polynomial-Time Approximation Algorithms for the Ising Model
- An Introduction to Riemann Surfaces
- Location of zeros for the partition function of the Ising model on bounded degree graphs
- Matchings and walks in graphs
- Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
- On the computational complexity of the Jones and Tutte 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
- The Complexity of Approximating the Matching Polynomial in the Complex Plane
- Fisher Zeros and Correlation Decay in the Ising Model
- Beitrag zur Theorie des Ferromagnetismus
- The Complexity of Computing the Sign of the Tutte Polynomial
- Inapproximability of the Independent Set Polynomial in the Complex Plane
- Classical algorithms, correlation decay, and complex zeros of partition functions of Quantum many-body systems
- Zeros of ferromagnetic 2-spin systems
- Weighted counting of solutions to sparse systems of equations
- Zeros of Holant problems: locations and algorithms
- Real Algebraic Numbers: Complexity Analysis and Experimentation
- Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
- STATISTICAL MECHANICS OF EQUILIBRIUM AND NONEQUILIBRIUM PHASE TRANSITIONS: THE YANG–LEE FORMALISM
- Dynamics in One Complex Variable. (AM-160)
- Statistical Theory of Equations of State and Phase Transitions. I. Theory of Condensation
This page was built for publication: The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs
