arXiv Analytics

Sign in

arXiv:1301.1182 [math.PR]AbstractReferencesReviewsResources

On geometric and algebraic transience for discrete-time Markov chains

Yong-Hua Mao, Yan-Hong Song

Published 2013-01-07Version 1

General characterizations of ergodic Markov chains have been developed in considerable detail. In this paper, we study the transience for discrete-time Markov chains on general state spaces, including the geometric transience and algebraic transience. Criteria are presented through establishing the drift condition and considering the first return time. As an application, we give explicit criteria for the random walk on the half line and the skip-free chain on nonnegative integers.

Related articles: Most relevant | Search more
arXiv:2003.06978 [math.PR] (Published 2020-03-16)
Perturbation theory and uniform ergodicity for discrete-time Markov chains
arXiv:2203.02534 [math.PR] (Published 2022-03-04)
Discrete self-similar and ergodic Markov chains
arXiv:1707.08419 [math.PR] (Published 2017-07-26)
Quasi-stationarity and quasi-ergodicity for discrete-time Markov chains with absorbing boundaries moving periodically