Spatial mixing and the connective constant: optimal bounds
From MaRDI portal
Publication:2359740
DOI10.1007/s00440-016-0708-2zbMath1373.82026OpenAlexW3135924815MaRDI QIDQ2359740
Alistair Sinclair, Piyush Srivastava, Yitong Yin, Daniel Štefanković
Publication date: 22 June 2017
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://authors.library.caltech.edu/78025/
Analysis of algorithms (68W40) Statistical mechanics of polymers (82D60) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Approximation algorithms (68W25)
Related Items
A Spectral Independence View on Hard Spheres via Block Dynamics, Strong spatial mixing for repulsive point processes, Perfect Sampling in Infinite Spin Systems Via Strong Spatial Mixing, Algorithms for hard-constraint point processes via discretization, Approximation Algorithms for the Random Field Ising Model, Unnamed Item, Unnamed Item, Analyticity for classical gasses via recursion, The Ising partition function: zeros and deterministic approximation, Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model, Counting hypergraph matchings up to uniqueness threshold, Uniqueness for the 3-state antiferromagnetic Potts model on the tree, Unnamed Item, Unnamed Item, Phase Coexistence for the Hard-Core Model on ℤ2, Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs, Contraction: a unified perspective of correlation decay and zero-freeness of 2-spin systems, Sufficient condition for root reconstruction by parsimony on binary trees with general weights, Finitary codings for spatial mixing Markov random fields
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
- Counting in two-spin models on \(d\)-regular graphs
- Random walks and percolation on trees
- Coupling with the stationary distribution and improved sampling for colorings and independent sets
- Random generation of combinatorial structures from a uniform distribution
- Gibbs measures and phase transitions
- Random matchings in regular graphs
- Approach to equilibrium of Glauber dynamics in the one phase region. I: The attractive case
- Approach to equilibrium of Glauber dynamics in the one phase region. II: The general case
- A note on the Glauber dynamics for sampling independent sets
- Robust phase transitions for Heisenberg and other models on general trees
- The Ising model and percolation on trees and tree-like graphs
- Exact thresholds for Ising-Gibbs samplers on general graphs
- Improved mixing condition on the grid for counting and sampling independent sets
- Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\)
- Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
- Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions
- Improved inapproximability results for counting independent sets in the hard-core model
- Counting independent sets up to the tree threshold
- The hard-hexagon model and Rogers—Ramanujan type identities
- Rapid mixing of Gibbs sampling on graphs that are sparse on average
- Enumeration of self-avoiding walks on the square lattice
- Approximating the Permanent
- Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models
- Matchings and walks in graphs
- Upper Bounds for the Connective Constant of Self-Avoiding Walks
- The computational complexity of two‐state spin systems
- Upper and lower bounds for the connective constants of self-avoiding walks on the Archimedean and Laves lattices
- On Markov Chains for Independent Sets
- MCMC sampling colourings and independent sets of G(n, d/n) near uniqueness threshold
- Strong Spatial Mixing with Fewer Colors for Lattice Graphs
- On the Number of Self-Avoiding Walks. II
- Correlation Decay up to Uniqueness in Spin Systems
- Approximate Counting via Correlation Decay in Spin Systems
- Gibbs rapidly samples colorings of \(G(n, d/n)\)
