Perfect Sampling in Infinite Spin Systems Via Strong Spatial Mixing
From MaRDI portal
Publication:5096108
DOI10.1137/21M1437433MaRDI QIDQ5096108
Publication date: 12 August 2022
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.15992
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Combinatorial probability (60C05) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Randomized algorithms (68W20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the partition function for graph homomorphisms
- Finitary codings for spatial mixing Markov random fields
- For 2-D lattice spin systems weak mixing implies strong mixing
- On the existence and nonexistence of finitary codings for a class of random fields
- Approximating partition functions of the two-state spin system
- High order random walks: beyond spectral gap
- Contraction: a unified perspective of correlation decay and zero-freeness of 2-spin systems
- Spatial mixing and the connective constant: optimal bounds
- Random sampling for the monomer–dimer model on a lattice
- Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions
- Counting independent sets up to the tree threshold
- Approximating the Permanent
- How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
- Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
- Mixing in time and space for lattice spin systems: A combinatorial view
- Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid
- Uniform Sampling Through the Lovász Local Lemma
- Statistical Mechanics of Lattice Systems
- Strong Spatial Mixing with Fewer Colors for Lattice Graphs
- Time-Dependent Statistics of the Ising Model
