On the Ergodicity of Slow-Varying Nonstationary Markov Chains
Jinn-Wen Wu, Kuo-Chih Chen
Abstract
Jinn-Wen Wu, Kuo-Chih Chen
Abstract
We consider a nonstationary Markov chain: X(k + 1) = P(k)X(k), where and P(k) is a stochastic matrix for all k = 0,1,2,…. The main purpose of this article is to present some new conditions to guarantee the ergodicity for slow-varying nonstationary Markov chains and the bound for variation of ‖P(k + 1) − P(k)‖1 to ensure the strongly ergodicity is constructed as well.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We consider a nonstationary Markov chain: X(k + 1) = P(k)X(k), where and P(k) is a stochastic matrix for all k = 0,1,2,…. The main purpose of this article is to present some new conditions to guarantee the ergodicity for slow-varying nonstationary Markov chains and the bound for variation of ‖P(k + 1) − P(k)‖1 to ensure the strongly ergodicity is constructed as well.
Key concepts: Ergodicity, Markov chain, Mathematics, Examples of Markov chains, Statistical physics, Markov process, Stochastic matrix, Markov renewal process