arXiv Analytics

Sign in

arXiv:2402.11200 [cs.IT]AbstractReferencesReviewsResources

Contraction of Markovian Operators in Orlicz Spaces and Error Bounds for Markov Chain Monte Carlo

Amedeo Roberto Esposito, Marco Mondelli

Published 2024-02-17Version 1

We introduce a novel concept of convergence for Markovian processes within Orlicz spaces, extending beyond the conventional approach associated with $L_p$ spaces. After showing that Markovian operators are contractive in Orlicz spaces, our key technical contribution is an upper bound on their contraction coefficient, which admits a closed-form expression. The bound is tight in some settings, and it recovers well-known results, such as the connection between contraction and ergodicity, ultra-mixing and Doeblin's minorisation. Specialising our approach to $L_p$ spaces leads to a significant improvement upon classical Riesz-Thorin's interpolation methods. Furthermore, by exploiting the flexibility offered by Orlicz spaces, we can tackle settings where the stationary distribution is heavy-tailed, a severely under-studied setup. As an application of the framework put forward in the paper, we introduce tighter bounds on the mixing time of Markovian processes, better exponential concentration bounds for MCMC methods, and better lower bounds on the burn-in period. To conclude, we show how our results can be used to prove the concentration of measure phenomenon for a sequence of Markovian random variables.

Related articles: Most relevant | Search more
arXiv:1704.02673 [cs.IT] (Published 2017-04-09)
Lattice Gaussian Sampling by Markov Chain Monte Carlo: Convergence Rate and Decoding Complexity
arXiv:1203.2213 [cs.IT] (Published 2012-03-10)
On the Mixing Time of Markov Chain Monte Carlo for Integer Least-Square Problems
arXiv:0808.4156 [cs.IT] (Published 2008-08-29, updated 2010-05-07)
Rate-Distortion via Markov Chain Monte Carlo