A Spectral Independence View on Hard Spheres via Block Dynamics
DOI10.1137/21M143697XzbMath1498.60302arXiv2102.07443MaRDI QIDQ5043635
Marcus Pappik, Andreas Göbel, Martin S. Krejca, Tobias Friedrich
Publication date: 6 October 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.07443
partition functionMarkov chainGlauber dynamicsGibbs distributionapproximate countinghard-sphere modelspectral independence
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Approximation algorithms (68W25) Randomized algorithms (68W20) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Mathematical modeling or simulation for problems pertaining to statistical mechanics (82-10)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the hardness of sampling independent sets beyond the tree threshold
- Self-avoiding walks and trees in spread-out lattices
- Strong spatial mixing for repulsive point processes
- Correlation decay for hard spheres via Markov chains
- Disagreement percolation for the hard-sphere model
- Spatial mixing and the connective constant: optimal bounds
- The analyticity region of the hard sphere gas. Improved bounds
- Random sampling for the monomer–dimer model on a lattice
- Improved inapproximability results for counting independent sets in the hard-core model
- Counting independent sets up to the tree threshold
- On Counting Independent Sets in Sparse Graphs
- Randomly coloring sparse random graphs with fewer colors than the maximum degree
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Perfect simulation using dominating processes on ordered spaces, with application to locally stable point processes
- Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
- Computing the Independence Polynomial: from the Tree Threshold down to the Roots
- Sampling Random Colorings of Sparse Random Graphs
- ON THE HARD SPHERE MODEL AND SPHERE PACKINGS IN HIGH DIMENSIONS
- Spatial mixing and nonlocal Markov chains
- Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
- Swendsen‐Wang dynamics for general graphs in the tree uniqueness region
- Improved analysis of higher order random walks and applications
- Algorithms and Computation
- Equation of State Calculations by Fast Computing Machines
- Inapproximability of the independent set polynomial in the complex plane
- MCMC sampling colourings and independent sets of G(n, d/n) near uniqueness threshold
- Slow mixing of Glauber dynamics for the hard‐core model on regular bipartite graphs
- Combinatorial criteria for uniqueness of Gibbs measures
- Correlation Decay up to Uniqueness in Spin Systems
- Gibbs rapidly samples colorings of \(G(n, d/n)\)
- Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion
This page was built for publication: A Spectral Independence View on Hard Spheres via Block Dynamics
