Algorithmic Pirogov-Sinai theory
From MaRDI portal
Publication:2174663
DOI10.1007/S00440-019-00928-YzbMATH Open1436.82007OpenAlexW2995442611WikidataQ127615864 ScholiaQ127615864MaRDI QIDQ2174663FDOQ2174663
Authors: Tyler Helmuth, Will Perkins, Guus Regts 
Publication date: 21 April 2020
Published in: Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00440-019-00928-y
Recommendations
- Algorithmic Pirogov-Sinai theory
- scientific article; zbMATH DE number 3092551
- scientific article; zbMATH DE number 3966050
- scientific article; zbMATH DE number 3077776
- First-order approximation of algorithmic theories
- Algorithmic theories of problems. A constructive and a non-constructive approach
- Algorithmic meta-theorems
approximation algorithmsFPTAScluster expansiondiscrete spin systemsPirogov-Sinai theoryapproximate sampling
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Approximation algorithms (68W25) 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) Basic methods in statistical mechanics (82M99)
Cites Work
- Random generation of combinatorial structures from a uniform distribution
- The relative complexity of approximate counting problems
- Slow mixing of glauber dynamics via topological obstructions
- The Random-Cluster Model
- Cluster expansion for abstract polymer models
- Cluster expansion for abstract polymer models. New bounds from an old approach
- The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
- \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
- Counting independent sets up to the tree threshold
- Polynomial-Time Approximation Algorithms for the Ising Model
- Approximating the Partition Function of the Ferromagnetic Potts Model
- Title not available (Why is that?)
- Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
- Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model
- Sequential cavity method for computing free energy and surface pressure
- Approximate counting, uniform generation and rapidly mixing Markov chains
- The number of trees
- Representation and poly-time approximation for pressure of \(\mathbb Z^2\) lattice models in the non-uniqueness region
- Computing the permanent of (some) complex matrices
- Computing the partition function for cliques in a graph
- Title not available (Why is that?)
- Left and right convergence of graphs with bounded degree
- Counting in two-spin models on \(d\)-regular graphs
- A unified approach to phase diagrams in field theory and statistical mechanics
- On Phase Transition in the Hard-Core Model on ${\mathbb Z}^d$
- Quasi-polynomial mixing of the 2D stochastic Ising model with ``plus boundary up to criticality
- On a problem of Spencer
- Odd cutsets and the hard-core model on \(\mathbb{Z}^{d}\)
- Boundary-connectivity via graph theory
- Interfaces in the Potts model. I: Pirogov-Sinai theory of the Fortuin- Kasteleyn representation
- On the hard-hexagon model and the theory of modular functions
- Title not available (Why is that?)
- Constant Time Generation of Rooted Trees
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
- Rapid mixing of Swendsen–Wang dynamics in two dimensions
- Combinatorics and complexity of partition functions
- Computing the partition function for graph homomorphisms with multiplicities
- Tight bounds for mixing of the Swendsen-Wang algorithm at the Potts transition point
- On a conjecture of Sokal concerning roots of the independence polynomial
- Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
- Modular properties of the hard hexagon model.
- Random cluster dynamics for the Ising model is rapidly mixing
- Mixing Times of Critical Two‐Dimensional Potts Models
- Phase Coexistence for the Hard-Core Model on ℤ2
- Random-cluster dynamics in \(\mathbb {Z}^2\)
- The Ising partition function: zeros and deterministic approximation
- Computing the number of induced copies of a fixed graph in a bounded degree graph
- Algorithms for #BIS-hard problems on expander graphs
- Computing the Independence Polynomial: from the Tree Threshold down to the Roots
- Weighted counting of solutions to sparse systems of equations
- FPTAS for #BIS with Degree Bounds on One Side
- Inapproximability of the independent set polynomial in the complex plane
Cited In (19)
- Title not available (Why is that?)
- Algorithms for #BIS-Hard Problems on Expander Graphs
- Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs
- Absence of zeros implies strong spatial mixing
- Efficient sampling and counting algorithms for the Potts model on ℤd at all temperatures
- Sequential cavity method for computing free energy and surface pressure
- Independent sets in the hypercube revisited
- Approximation Algorithms for the Random Field Ising Model
- Approximately counting independent sets in bipartite graphs via graph containers
- On the zeroes of hypergraph independence polynomials
- Quasipolynomial-time algorithms for Gibbs point processes
- An algorithmic view of pseudochaos
- Fast mixing via polymers for random graphs with unbounded degree
- Asymptotic linearity of binomial random hypergraphs via cluster expansion under graph-dependence
- Title not available (Why is that?)
- Correlation decay and the absence of zeros property of partition functions
- Sampling from the low temperature Potts model through a Markov chain on flows
- Efficient algorithms for the Potts model on small-set expanders
- Efficient algorithms for approximating quantum partition functions
Uses Software
This page was built for publication: Algorithmic Pirogov-Sinai theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174663)
