加载中…
Let be a -geometrically ergodic Markov chain on a measurable space with invariant probability distribution . In this paper, we propose a discretization scheme providing a computable sequence of probability measures which approximates as growths to infinity. The probability measure is computed from the invariant probability distribution of a finite Markov chain. The convergence rate in total variation of to is given. As a result, the specific case of first order autoregressive processes with linear and non-linear errors is studied. Finally, illustrations of the procedure for such autoregressive processes are provided, in particular when no explicit formula for is known.

生成讲解博客的中文版本

生成AI智能校验的中文版本