arXiv Analytics

Sign in

arXiv:1808.07033 [math.PR]AbstractReferencesReviewsResources

Quantitative contraction rates for Markov chains on general state spaces

Andreas Eberle, Mateusz B. Majka

Published 2018-08-21Version 1

We investigate the problem of quantifying contraction coefficients of Markov transition kernels in Kantorovich ($L^1$ Wasserstein) distances. For diffusion processes, relatively precise quantitative bounds on contraction rates have recently been derived by combining appropriate couplings with carefully designed Kantorovich distances. In this paper, we partially carry over this approach from diffusions to Markov chains. We derive quantitative lower bounds on contraction rates for Markov chains on general state spaces that are powerful if the dynamics is dominated by small local moves. For Markov chains on $\mathbb{R^d}$ with isotropic transition kernels, the general bounds can be used efficiently together with a coupling that combines maximal and reflection coupling. The results are applied to Euler discretizations of stochastic differential equations with non-globally contractive drifts, and to the Metropolis adjusted Langevin algorithm for sampling from a class of probability measures on high dimensional state spaces that are not globally log-concave.

Related articles: Most relevant | Search more
arXiv:1301.7357 [math.PR] (Published 2013-01-30, updated 2013-02-08)
Comparison Theory for Markov Chains on Different State Spaces and Application to Random Walk on Derangements
arXiv:1911.04377 [math.PR] (Published 2019-11-11)
Markov chains in random environment with applications in queueing theory and machine learning
arXiv:1503.08632 [math.PR] (Published 2015-03-30)
Entrance and sojourn times for Markov chains. Application to $(L,R)$-random walks