arXiv Analytics

Sign in

arXiv:2001.00134 [math.PR]AbstractReferencesReviewsResources

Inverse Problems for Ergodicity of Markov Chains

Zhi-Feng Wei

Published 2020-01-01Version 1

For both continuous-time and discrete-time Markov Chains, we provide criteria for inverse problems of classical types of ergodicity: (ordinary) erogodicity, algebraic ergodicity, exponential ergodicity and strong ergodicity. Our criteria are in terms of the existence of solutions to inequalities involving the $Q$-matrix (or transition matrix $P$ in time-discrete case) of the process. Meanwhile, these criteria are applied to some examples and provide "universal" treatment, including single birth processes and several multi-dimensional models.

Related articles: Most relevant | Search more
arXiv:1301.1182 [math.PR] (Published 2013-01-07)
On geometric and algebraic transience for discrete-time Markov chains
arXiv:2102.07069 [math.PR] (Published 2021-02-14)
Convergence Rates in Strong Ergodicity by Hitting Times and $L^2$-exponential Convergence Rates
arXiv:1411.6099 [math.PR] (Published 2014-11-22)
Unified representation of formulas for single birth processes