Lee-Yang theorems and the complexity of computing averages

DOI10.1007/S00220-014-2036-7MaRDI QIDQ2249768zbMATH OpenOpenAlexFDO

Authors Alistair Sinclair, Piyush Srivastava

Publication date 3 July 2014

Published in Communications in Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00220-014-2036-7

zbMATH Keywords

computing averageferromagnetic Ising modelLee-Yang theoremmonomer-dimer model

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) Statistical mechanics of polymers (82D60)

Recommendations

• Lee-Yang theorems and the complexity of computing averages
• Computing the partition function of the Sherrington-Kirkpatrick model is hard on average
• The computational complexity of two‐state spin systems
• The Ising partition function: zeros and deterministic approximation
• The Complexity of Ferromagnetic Ising with Local Fields

Cites work

• A Complexity Dichotomy for Partition Functions with Mixed Signs
• A Dichotomy for k-Regular Graphs with {0, 1}-Vertex Assignments and Real Edge Functions
• A dichotomy theorem for constraint satisfaction problems on a 3-element set
• Complexity of counting CSP with complex weights
• Computational Complexity
• Counting independent sets up to the tree threshold
• Existence and Uniqueness of Interpolating Rational Functions
• Graph homomorphisms with complex values: a dichotomy theorem (extended abstract)
• Homogeneous multivariate polynomials with the half-plane property
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1545676 (Why is no real title available?)
• scientific article; zbMATH DE number 3284254 (Why is no real title available?)
• Partition function zeros at first-order phase transitions: a general analysis
• Partition function zeros at first-order phase transitions: Pirogov-Sinai theory
• Paths, Trees, and Flowers
• PRIMES is in P
• Pólya-Schur master theorems for circular domains and their boundaries
• Random generation of combinatorial structures from a uniform distribution
• Reducibility among combinatorial problems
• 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
• Synthesis of a Finite Two-terminal Network whose Driving-point Impedance is a Prescribed Function of Frequency
• Systems of distinct representatives and linear algebra
• The complexity of computing the permanent
• The Complexity of Enumeration and Reliability Problems
• The complexity of partition functions
• The complexity of theorem-proving procedures
• The computational complexity of two‐state spin systems
• The GHS inequality and the Riemann hypothesis
• The Lee--Yang and Pólya--Schur programs. I: Linear operators preserving stability
• The roots of the independence polynomial of a clawfree graph
• Theory of monomer-dimer systems
• Zeros of the partition function for generalized ising systems

Cited in

(5)

• The Ising partition function: zeros and deterministic approximation
• Computing the partition function of the Sherrington-Kirkpatrick model is hard on average
• The worm process for the Ising model is rapidly mixing
• Lee-Yang theorems and the complexity of computing averages
• Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs

This page was built for publication: Lee-Yang theorems and the complexity of computing averages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249768)