Fetching the paper…
Reading the bibliography…
We present a new lower bound on the spectral gap of the Glauber dynamics for the Gibbs distribution of a spectrally independent $q$-spin system on a graph $G = (V,E)$ with maximum degree $\Delta$.
Approximating the permanent
Mark Jerrum and Alistair Sinclair · 1989
Earlier work this paper cites.
Approximate counting, uniform generation and rapidly mixing Markov chains
Alistair Sinclair and Mark Jerrum · 1989
Earlier work this paper cites.
A very simple algorithm for estimating the number of k-colorings of a low-degree graph
Mark Jerrum · 1995
Earlier work this paper cites.
Reversible Markov chains and random walks on graphs, 2002
David Aldous and Jim Fill · 2002
Earlier work this paper cites.
A non-Markovian coupling for randomly sampling colorings
Thomas P Hayes and Eric Vigoda · 2003
Earlier work this paper cites.
Counting, sampling and integrating: algorithms and complexity
Mark Jerrum · 2003
Earlier work this paper cites.
The ising model on trees: Boundary conditions and mixing time
Fabio Martinelli, Alistair Sinclair, and Dror Weitz · 2003
Earlier work this paper cites.
Randomly coloring constant degree graphs
Martin Dyer, Alan Frieze, Thomas P Hayes, and Eric Vigoda · 2004
Earlier work this paper cites.
A general lower bound for mixing of single-site dynamics on graphs
Thomas P Hayes and Alistair Sinclair · 2005
Earlier work this paper cites.
Coupling with the stationary distribution and improved sampling for colorings and independent sets
Thomas Hayes and Eric Vigoda · 2006
Cited alongside, same era.
Randomly colouring graphs with girth five and large maximum degree
Lap Chi Lau and Michael Molloy · 2006
Cited alongside, same era.
Adaptive simulated annealing: A near-optimal connection between sampling and counting
Daniel Štefankovič, Santosh Vempala, and Eric Vigoda · 2009
Cited alongside, same era.
Local uniformity properties for Glauber dynamics on graph colorings
Thomas P Hayes · 2013
Cited alongside, same era.
High dimensional expanders imply agreement expanders
Irit Dinur and Tali Kaufman · 2017
Cited alongside, same era.
Markov Chains and Mixing Times
David Levin and Yuval Peres · 2017
Convergence of MCMC and loopy BP in the tree uniqueness region for the hard-core model
Charilaos Efthymiou, Thomas P Hayes, Daniel Stefankovic, Eric Vigoda, and Yitong Yin · 2019
Later among the works it cites.
Improved analysis of higher order random walks and applications
Vedat Levi Alev and Lap Chi Lau · 2020
Later among the works it cites.
Spectral independence in high-dimensional expanders and applications to the hardcore model
Nima Anari, Kuikui Liu, and Shayan Oveis Gharan · 2020
Later among the works it cites.
Optimal mixing of Glauber dynamics: Entropy factorization via high-dimensional expansion
Zongchen Chen, Kuikui Liu, and Eric Vigoda · 2020
Later among the works it cites.
Rapid mixing of Glauber dynamics up to uniqueness via contraction
Zongchen Chen, Kuikui Liu, and Eric Vigoda · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
High order random walks: Beyond spectral gap
Tali Kaufman and Izhar Oppenheim · 2018
Cited alongside, same era.
Local spectral expansion approach to high dimensional expanders part i: Descent of spectral gaps
Izhar Oppenheim · 2018
Cited alongside, same era.
On mixing of Markov chains: Coupling, spectral independence, and entropy factorization
Antonio Blanca, Pietro Caputo, Zongchen Chen, Daniel Parisi, Daniel Štefankovič, and Eric Vigoda · 2021
Closest in time.
Rapid mixing for colorings via spectral independence
Zongchen Chen, Andreas Galanis, Daniel Štefankovič, and Eric Vigoda · 2021
Closest in time.
Rapid mixing from spectral independence beyond the Boolean domain
Weiming Feng, Heng Guo, Yitong Yin, and Chihao Zhang · 2021
Closest in time.