scientific article; zbMATH DE number 7378644
From MaRDI portal
Publication:5009527
DOI10.4230/LIPIcs.APPROX-RANDOM.2018.32MaRDI QIDQ5009527
Antonio Blanca, Eric Vigoda, Zongchen Chen
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1806.04602
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparison inequalities and fastest-mixing Markov chains
- Can extra updates delay mixing?
- Some circumstances where extra updates can delay mixing
- Evolutionary trees and the Ising model on the Bethe lattice: A proof of Steel's conjecture
- Mixing time of critical Ising model on trees is polynomial in the height
- Random generation of combinatorial structures from a uniform distribution
- Dynamical critical behavior of the Swendson-Wang algorithm: The two-dimensional three-state Potts model revisited
- Dynamical critical behavior of a Swendsen-Wang-type algorithm for the Ashkin-Teller model
- 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
- Exact thresholds for Ising-Gibbs samplers on general graphs
- Mixing time for the Ising model: a uniform lower bound for all graphs
- The Swendsen-Wang process does not always mix rapidly
- Exponentially slow mixing in the mean-field Swendsen-Wang dynamics
- Spatial mixing and the connective constant: optimal bounds
- Tight bounds for mixing of the Swendsen-Wang algorithm at the Potts transition point
- A general lower bound for mixing of single-site dynamics on graphs
- A power law of order 1/4 for critical mean-field Swendsen-Wang dynamics
- Counting independent sets up to the tree threshold
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
- Learning, Local Interaction, and Coordination
- Polynomial-Time Approximation Algorithms for the Ising Model
- Adaptive simulated annealing: A near-optimal connection between sampling and counting
- Gibbs States on Countable Sets
- Random walks and anO*(n5) volume algorithm for convex bodies
- Random cluster dynamics for the Ising model is rapidly mixing
- Spatial Mixing and Non-local Markov chains
- Mixing in time and space for lattice spin systems: A combinatorial view
- Beitrag zur Theorie des Ferromagnetismus
- Swendsen‐Wang dynamics for general graphs in the tree uniqueness region
- Dynamics for the mean-field random-cluster model
- Swendsen-Wang Algorithm on the Mean-Field Potts Model
- Rapid mixing of Swendsen–Wang dynamics in two dimensions
- Correlation Decay up to Uniqueness in Spin Systems
- A Guide to Monte Carlo Simulations in Statistical Physics
- Quasi-factorization of the entropy and logarithmic Sobolev inequalities for Gibbs random fields
