scientific article; zbMATH DE number 7053327
From MaRDI portal
Publication:5743449
zbMath1423.82005MaRDI QIDQ5743449
Piyush Srivastava, Alistair Sinclair, Marc Thurley
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095191
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Phase transitions (general) in equilibrium statistical mechanics (82B26) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Approximation algorithms (68W25) Statistical mechanics of magnetic materials (82D40)
Related Items (10)
\(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region ⋮ Zero-freeness and approximation of real Boolean Holant problems ⋮ The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs ⋮ Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs ⋮ A dichotomy for bounded degree graph homomorphisms with nonnegative weights ⋮ Approximability of the complementarily symmetric Holant problems on cubic graphs ⋮ Commuting quantum circuits and complexity of Ising partition functions ⋮ Approximation Algorithms for the Random Field Ising Model ⋮ Unnamed Item ⋮ Approximate Counting via Correlation Decay in Spin Systems
Cites Work
- On the hardness of sampling independent sets beyond the tree threshold
- Gibbs measures and phase transitions
- Approximating partition functions of the two-state spin system
- Improved mixing condition on the grid for counting and sampling independent sets
- Improved inapproximability results for counting independent sets in the hard-core model
- Counting independent sets up to the tree threshold
- Polynomial-Time Approximation Algorithms for the Ising Model
- On Counting Independent Sets in Sparse Graphs
- The computational complexity of two‐state spin systems
- Approximate Counting via Correlation Decay in Spin Systems
This page was built for publication:
