Fetching the paper…
Reading the bibliography…
We prove an optimal $\Omega(n^{-1})$ lower bound for modified log-Sobolev (MLS) constant of the Glauber dynamics for anti-ferromagnetic two-spin systems with $n$ vertices in the tree uniqueness regime.
Polynomial-time approximation algorithms for the Ising model
Mark Jerrum and Alistair Sinclair · 1993
Earlier work this paper cites.
The computational complexity of two-state spin systems
Leslie Ann Goldberg, Mark Jerrum, and Mike Paterson · 2003
Earlier work this paper cites.
Rapid mixing of Glauber dynamics up to uniqueness via contraction
Zongchen Chen, Kuikui Liu, and Eric Vigoda · 2004
Earlier work this paper cites.
Combinatorial criteria for uniqueness of Gibbs measures
Dror Weitz · 2005
Earlier work this paper cites.
Modified logarithmic Sobolev inequalities in discrete settings
Sergey G. Bobkov and Prasad Tetali · 2006
Earlier work this paper cites.
Coupling with the stationary distribution and improved sampling for colorings and independent sets
Thomas P. Hayes and Eric Vigoda · 2006
Earlier work this paper cites.
Counting independent sets up to the tree threshold
Dror Weitz · 2006
Earlier work this paper cites.
A general lower bound for mixing of single-site dynamics on graphs
Thomas P. Hayes and Alistair Sinclair · 2007
Earlier work this paper cites.
Computational transition at the uniqueness threshold
Allan Sly · 2010
Earlier work this paper cites.
Optimal mixing of Glauber dynamics: Entropy factorization via high-dimensional expansion
Zongchen Chen, Kuikui Liu, and Eric Vigoda · 2011
Earlier work this paper cites.
Matrix analysis
Roger A. Horn and Charles R. Johnson · 2012
Earlier work this paper cites.
Approximate counting via correlation decay in spin systems
Liang Li, Pinyan Lu, and Yitong Yin · 2012
Earlier work this paper cites.
The computational hardness of counting in two-spin models on d-regular graphs
Allan Sly and Nike Sun · 2012
Earlier work this paper cites.
Correlation decay up to uniqueness in spin systems
Liang Li, Pinyan Lu, and Yitong Yin · 2013
Earlier work this paper cites.
Exact thresholds for Ising-Gibbs samplers on general graphs
Elchanan Mossel and Allan Sly · 2013
Cited alongside, same era.
Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
Alistair Sinclair, Piyush Srivastava, and Marc Thurley · 2014
Cited alongside, same era.
Approximate tensorization of entropy at high temperature
Pietro Caputo, Georg Menz, and Prasad Tetali · 2015
Cited alongside, same era.
Inapproximability for antiferromagnetic spin systems in the tree nonuniqueness region
Andreas Galanis, Daniel Štefankovič, and Eric Vigoda · 2015
Cited alongside, same era.
Entropic Ricci curvature bounds for discrete interacting systems
Max Fathi and Jan Maas · 2016
Cited alongside, same era.
Ricci curvature bounds for weakly interacting Markov chains
Matthias Erbar, Christopher Henderson, Georg Menz, and Prasad Tetali · 2017
A probabilistic approach to convex
Giovanni Conforti · 2020
Later among the works it cites.
Block factorization of the relative entropy via spatial mixing
Pietro Caputo and Daniel Parisi · 2020
Later among the works it cites.
High order random walks: Beyond spectral gap
Tali Kaufman and Izhar Oppenheim · 2020
Later among the works it cites.
Logarithmic Sobolev inequalities for finite spin systems and applications
Holger Sambale and Arthur Sinulis · 2020
Later among the works it cites.
Fractionally log-concave and sector-stable polynomials: counting planar matchings and more
Yeganeh Alimohammadi, Nima Anari, Kirankumar Shiragur, and Thuy-Duong Vuong · 2021
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.
Markov chains and mixing times
David A. Levin, Yuval Peres, and Elizabeth L. Wilmer · 2017
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.
Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid
Nima Anari, Kuikui Liu, Shayan Oveis Gharan, and Cynthia Vinzant · 2019
Cited alongside, same era.
Convergence of MCMC and loopy BP in the tree uniqueness region for the hard-core model
Charilaos Efthymiou, Thomas P. Hayes, Daniel Štefankovič, Eric Vigoda, and Yitong Yin · 2019
Cited alongside, same era.
Logarithmic Sobolev inequalities in discrete product spaces
Katalin Marton · 2019
Cited alongside, same era.
Improved analysis of higher order random walks and applications
Vedat Levi Alev and Lap Chi Lau · 2020
Cited alongside, same era.
Nima Anari, Vishesh Jain, Frederic Koehler, Huy Tuan Pham, and Thuy-Duong Vuong · 2021
Later among the works it cites.
Nima Anari, Vishesh Jain, Frederic Koehler, Huy Tuan Pham, and Thuy-Duong Vuong · 2021
Later among the works it cites.
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
Later among the works it cites.
Optimal mixing time for the ising model in the uniqueness regime
Xiaoyu Chen, Weiming Feng, Yitong Yin, and Xinyuan Zhang · 2021
Later among the works it cites.
Rapid mixing of Glauber dynamics via spectral independence for all degrees
Xiaoyu Chen, Weiming Feng, Yitong Yin, and Xinyuan Zhang · 2021
Later among the works it cites.
Modified log-Sobolev inequalities for strongly log-concave distributions
Mary Cryan, Heng Guo, and Giorgos Mousa · 2021
Later among the works it cites.
Rapid mixing from spectral independence beyond the boolean domain
Weiming Feng, Heng Guo, Yitong Yin, and Chihao Zhang · 2021
Later among the works it cites.
Vishesh Jain, Huy Tuan Pham, and Thuy Duong Vuong · 2021
Later among the works it cites.
Localization schemes: A framework for proving mixing bounds for markov chains
Yuansi Chen and Ronen Eldan · 2022
Closest in time.