A subexponential upper bound for entropy convergence of Markov chains with a spectral gap
Ergodic theory of linear operators (47A35) Equations and inequalities involving linear operators, with vector unknowns (47A50) Eigenvalue problems for linear operators (47A75) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Continuous-time Markov processes on discrete state spaces (60J27)
Let \(P\) be a Markov kernel on a measurable space \(S\) with an invariant probability \(\mu\). Let \(P^*\) be the adjoint operator of \(P\) on \(L_2(\mu)\). It is assumed that the operator \(I-PP^*\) possesses a spectral gap. It is shown that this assumption implies some estimates of the speed of convergence to zero of the entropy \(\text{Ent}(P^nm\mid\mu)\), \(n\to\infty\), where \(m\) is a given probability on \(S\) satisfying certain integrability conditions, and the action \(P^nm\) is defined in a natural way. A modification of this approach is used also for some inhomogeneous Markov chains.
- Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\).
- On spectral gap estimates of a Markov chain via hitting times and coupling
- Spectral gap and convergence rate for discrete-time Markov chains
- On improved bounds and conditions for the convergence of Markov chains
- Improved log-Sobolev inequalities, hypercontractivity and uncertainty principle on the hypercube
- Intrinsic dimensional functional inequalities on model spaces
- Analysis of Langevin Monte Carlo from Poincaré to log-Sobolev
- Exponential convergence rate in entropy
- A symmetric entropy bound on the non-reconstruction regime of Markov chains on Galton-Watson trees
This page was built for publication: A subexponential upper bound for entropy convergence of Markov chains with a spectral gap
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291154)