This article provides series expansions of the stationary distribution of a finite Markov chain. This leads to an efficient numerical algorithm for computing the stationary distribution of a finite Markov chain. Numerical examples are given to illustrate the performance of the algorithm. © 2007 Cambridge University Press.
|Number of pages||19|
|Journal||Probability in the Engineering and Informational Sciences|
|Publication status||Published - 2007|