Effective geometric ergodicty for Markov chains in random environment
Yeor Hafouta
TL;DR
The paper proves effective geometric ergodicity for Markov chains in random environments under a random Doeblin condition, producing a random invariant family $μ_ω$ and exponential convergence with rate $ρ∈(0,1)$ tempered by integrable random constants $K_p(ω)$. The rate and constants are explicitly constructed via a regenerative scheme and upper mixing bounds, ensuring $K_p∈L^p$ for any $p≥1$. This yields quantitative quenched ASIP rates, exponential decay of correlations for Markovian skew products, and exponential tails for random mixing times, with additional verifiable conditions for existing results (e.g., Kifer 1998). The framework connects probabilistic ergodicity with spectral-type interpretations in random operator cocycles and extends prior non-effective results to an effective, integrable setting. These results provide practical, verifiable conditions and rates for limit theorems in random dynamical systems and related stochastic processes.
Abstract
In this short note we prove ``effective" geometric ergodicity (i.e a Perron-Frobenius theorem) for Markov chains in random mixing dynamical environment satisfying a random non-uniform version of the Doeblin condition. Effectivity here means that all the random variables involved in the random exponential rates are integrable with arbitrarily large order. This compliments \cite[Theorem 2.1]{Kifer 1996}, where ``non-effective" geometric ergodicity was obtained. From a different perspective, our result is also motivated by egrodic theory, as it can be seen as an effective version of the ``spectral" gap in the top Oseledets space in the Oseledets multiplicative ergodic theorem for the random Markov operator cocycle (when it applies). We also present applications of the effective ergodicity to rates in the (quenched) almost sure invariance principle (ASIP), exponential decay of correlations for Markovian skew products and for exponential tails for random mixing times. As a byproduct of the proof of the ASIP rates we also provide easy to verify sufficient conditions for the verification of the assumptions of \cite[Theorem 2.4]{Kifer 1998}.
