Sharp Mixing Rates for Markov Chains on General Spaces with Unbounded Random Environments
Abstract: We consider Markov chains on general state spaces in stationary random environment which are defined by a random mapping that is contractive up to a bounded perturbation. We prove their convergence to a limiting law, providing convergence rates. We also show that these processes are strongly mixing and estimate their mixing coefficients. Our results significantly extend those available in the literature. In particular, for some additive autoregressive processes with exogenous covariates we achieve mixing rates that are optimal up to logarithmic factors.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.