Abstract
We prove that every infinite-state stochastic matrix P say, that is irreducible and consists of positive-recurrrent states can be represented in the form I – P=(A – I)(B – S), where A is strictly upper-triangular, B is strictly lower-triangular, and S is diagonal. Moreover, the elements of A are expected values of random variables that we will specify, and the elements of B and S are probabilities of events that we will specify. The decomposition can be used to obtain steady-state probabilities, mean first-passage-times and the fundamental matrix.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference8 articles.
1. A stable recursion for the steady state vector in Markov chains of M/G/1 type;Ramaswami;Stock Models,1988
2. Regenerative Analysis and Steady State Distributions for Markov Chains
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Index;Orthogonal Polynomials in the Spectral Analysis of Markov Processes;2021-10-31
2. References;Orthogonal Polynomials in the Spectral Analysis of Markov Processes;2021-10-31
3. Spectral Representation of Diffusion Processes;Orthogonal Polynomials in the Spectral Analysis of Markov Processes;2021-10-31
4. Spectral Representation of Birth–Death Processes;Orthogonal Polynomials in the Spectral Analysis of Markov Processes;2021-10-31
5. Small Phenomena, Big Implications;Orthogonal Polynomials in the Spectral Analysis of Markov Processes;2021-10-31