Improved FPTAS for Multi-spin Systems
From MaRDI portal
Publication:2851891
DOI10.1007/978-3-642-40328-6_44zbMath1405.68446OpenAlexW9125994MaRDI QIDQ2851891
Publication date: 4 October 2013
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40328-6_44
Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Coloring of graphs and hypergraphs (05C15) Approximation algorithms (68W25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (14)
On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs ⋮ An FPTAS for the hardcore model on random regular bipartite graphs ⋮ Absence of zeros implies strong spatial mixing ⋮ What can be sampled locally? ⋮ Correlation decay and the absence of zeros property of partition functions ⋮ Uniqueness of the Gibbs measure for the anti-ferromagnetic Potts model on the infinite \(\Delta \)-regular tree for large \(\Delta \) ⋮ Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials ⋮ Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials ⋮ Counting Independent Sets and Colorings on Random Regular Bipartite Graphs ⋮ Counting hypergraph matchings up to uniqueness threshold ⋮ Zero-free regions of partition functions with applications to algorithms and graph limits ⋮ On a conjecture of Sokal concerning roots of the independence polynomial ⋮ Counting Hypergraph Colorings in the Local Lemma Regime ⋮ Improved Bounds for Perfect Sampling of $k$-Colorings in Graphs
This page was built for publication: Improved FPTAS for Multi-spin Systems
