Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains
DOI10.1214/105051604000000639zbMath1067.60065arXivmath/0503537OpenAlexW2022380818MaRDI QIDQ1769410
Prasad Tetali, Eric Vigoda, Jung-Bae Son, Mark R. Jerrum
Publication date: 21 March 2005
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0503537
spectral gaplogarithmic Sobolev inequalitiesPoincaré inequalitiesMarkov chain Monte Carlo algorithmsmixing time of Markov chainsdecomposition of Markov chainsrestriction and projection Markov chains
Computational methods in Markov chains (60J22) Markov processes: estimation; hidden Markov models (62M05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40) Randomized algorithms (68W20)
Related Items
Cites Work
- Unnamed Item
- Logarithmic Sobolev inequality for some models of random walks
- Comparison theorems for reversible Markov chains
- Glauber dynamics on trees: Boundary conditions and mixing time
- Glauber dynamics on trees and hyperbolic graphs
- Markov chain decomposition for convergence rate analysis
- Logarithmic Sobolev inequalities for finite Markov chains
- Mixing properties of the Swendsen–Wang process on the complete graph and narrow grids
- Hydrodynamics and large deviation for simple exclusion processes
- Quasi-factorization of the entropy and logarithmic Sobolev inequalities for Gibbs random fields