The Ising partition function: zeros and deterministic approximation
From MaRDI portal
Publication:1730971
DOI10.1007/s10955-018-2199-2zbMath1412.82012arXiv1704.06493OpenAlexW3098145045WikidataQ128764306 ScholiaQ128764306MaRDI QIDQ1730971
Piyush Srivastava, Alistair Sinclair, Jing-Cheng Liu
Publication date: 6 March 2019
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.06493
Monte Carlo methods (65C05) Hypergraphs (05C65) Numerical analysis or methods applied to Markov chains (65C40) Phase transitions (general) in equilibrium statistical mechanics (82B26) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Statistical mechanics of magnetic materials (82D40)
Related Items
The complexity of approximating the complex-valued Potts model, Zeros and approximations of holant polynomials on the complex plane, Algorithmic Pirogov-Sinai theory, Location of zeros for the partition function of the Ising model on bounded degree graphs, Some applications of Wagner's weighted subgraph counting polynomial, Unnamed Item, Fisher zeros and correlation decay in the Ising model, Weighted counting of solutions to sparse systems of equations, Contraction: a unified perspective of correlation decay and zero-freeness of 2-spin systems, More on zeros and approximation of the Ising partition function, The complexity of approximating the complex-valued Potts model, Efficient algorithms for approximating quantum partition functions, 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
- Unnamed Item
- Unnamed Item
- Computing the permanent of (some) complex matrices
- The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs
- Critical Ising on the square lattice mixes in polynomial time
- Counting in two-spin models on \(d\)-regular graphs
- Combinatorics and complexity of partition functions
- Computing the partition function for graph homomorphisms
- The Lee--Yang and Pólya--Schur programs. I: Linear operators preserving stability
- Computing the partition function for graph homomorphisms with multiplicities
- Benjamini-Schramm continuity of root moments of graph polynomials
- Inapproximability of the Tutte polynomial
- Characterization of Lee-Yang polynomials
- On a problem of Spencer
- Random generation of combinatorial structures from a uniform distribution
- Griffiths' singularities in diluted Ising models on the Cayley tree
- Approach to equilibrium of Glauber dynamics in the one phase region. I: The attractive case
- Approach to equilibrium of Glauber dynamics in the one phase region. II: The general case
- Glauber dynamics on trees: Boundary conditions and mixing time
- Glauber dynamics on trees and hyperbolic graphs
- Exact thresholds for Ising-Gibbs samplers on general graphs
- Approximating partition functions of the two-state spin system
- Lee-Yang theorems and the complexity of computing averages
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
- Spatial mixing and the connective constant: optimal bounds
- The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
- Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
- Improved inapproximability results for counting independent sets in the hard-core model
- A power law of order 1/4 for critical mean-field Swendsen-Wang dynamics
- Counting independent sets up to the tree threshold
- Negative dependence and the geometry of polynomials
- Polynomial-Time Approximation Algorithms for the Ising Model
- Approximating the Permanent
- Computing the partition function for cliques in a graph
- The Lee‐Yang and Pólya‐Schur programs. II. Theory of stable polynomials and applications
- The computational complexity of two‐state spin systems
- Random cluster dynamics for the Ising model is rapidly mixing
- FPTAS for Hardcore and Ising Models on Hypergraphs
- Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
- Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model
- Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems
- Counting hypergraph matchings up to uniqueness threshold
- Left and right convergence of graphs with bounded degree
- Real stable polynomials and matroids: optimization and counting
- A generalization of permanent inequalities and applications in counting and optimization
- Beitrag zur Theorie des Ferromagnetismus
- A Complexity Dichotomy for Partition Functions with Mixed Signs
- Correlation Decay up to Uniqueness in Spin Systems
- Statistical Theory of Equations of State and Phase Transitions. I. Theory of Condensation
- Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model
- Graph Homomorphisms with Complex Values: A Dichotomy Theorem
- On the distribution and gap structure of Lee-Yang zeros for the Ising model: Periodic and aperiodic couplings
