Computable Convergence Rates for Subgeometrically Ergodic Markov Chains

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In this paper, we give quantitative bounds on the $f$-total variation distance from convergence of an Harris recurrent Markov chain on an arbitrary under drift and minorisation conditions implying ergodicity at a sub-geometric rate. These bounds are then specialized to the stochastically monotone case, covering the case where there is no minimal reachable element. The results are illustrated on two examples from queueing theory and Markov Chain Monte Carlo.

Keywords

Probability, 60J10

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/104875

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0511273
 http://arxiv.org/abs/math/0511273

Collections

arXiv