Approximating Markov chains and V-geometric ergodicity via weak perturbation theory
arXiv:1309.2857 · doi:10.1016/j.spa.2013.09.003
Abstract
Let be a Markov kernel on a measurable space $\X$ and let $V:\X\r[1,+\infty)$. This paper provides explicit connections between the -geometric ergodicity of and that of finite-rank nonnegative sub-Markov kernels $\Pc_k$ approximating . A special attention is paid to obtain an efficient way to specify the convergence rate for from that of $\Pc_k$ and conversely. Furthermore, explicit bounds are obtained for the total variation distance between the -invariant probability measure and the $\Pc_k$-invariant positive measure. The proofs are based on the Keller-Liverani perturbation theorem which requires an accurate control of the essential spectral radius of on usual weighted supremum spaces. Such computable bounds are derived in terms of standard drift conditions. Our spectral procedure to estimate both the convergence rate and the invariant probability measure of is applied to truncation of discrete Markov kernels on $\X:=\N$.
References in corpus (2)
Cited by in corpus (9)
- Error bounds for last-column-block-augmented truncations of block-structured Markov chains
- Continuous-time block-monotone Markov chains and their block-augmented truncations
- Error bounds for augmented truncations of discrete-time block-monotone Markov chains under subgeometric drift conditions
- Approximations of Geometrically Ergodic Reversible Markov Chains
- Stationary distributions of continuous-time Markov chains: a review of theory and truncation-based approximations
- Convergence Speed and Approximation Accuracy of Numerical MCMC
- Multiplicative ergodicity of laplace transforms for additive functional of markov chains with application to age-dependent branching process
- Computable bounds of -spectral gap for discrete Markov chains with band transition matrices
- A computable bound of the essential spectral radius of finite range Metropolis--Hastings kernels