Abstract

An algorithmic procedure for the determination of the stationary distribution of a finite, m‐state, irreducible Markov chain, that does not require the use of methods for solving systems of linear equations, is presented. The technique is based upon a succession of m, rank one, perturbations of the trivial doubly stochastic matrix whose known steady state vector is updated at each stage to yield the required stationary probability vector.

Highlights

  • Widespread attention has been given to the computation of stationary distributions of Markov chains

  • Suppose that following the th perturbation, the stationary probability vector r has been found for the Markov chain with transition matrix Pi, as given by (1.1), by using the procedure u described by Theorem 2.1 (b) for suitable choices of and i"

  • A consequence of this is that the effect of changing selected transition probabilities upon the stationary distribution can be determined. (See Hunter (1986))

Read more

Summary

INTRODUCTION

Widespread attention has been given to the computation of stationary distributions of Markov chains. Paige, Styan and Wachter (1975) presented a comprehensive survey of eight different algorithms involving a variety of procedures including the use of generalized inverses, rank reduction, least squares and power methods Their recommendation was a direct method that involved transforming the singular set of stationary equations into a non-singular system using a rank one modification followed by Gaussian elimination with row pivoting. In Hunter (1986), techniques for updating the stationary distribution of a finite irreducible Markov chain, following a rank one perturbation of its transition matrix, were presented. In this current paper, these techniques are utilized, to construct a general procedure for determining the stationary distribution of any finite irreducible Markov chain.

GENERAL THEORY
REFINEMENTS TO THE ALGORITHM
MODIFICATION TO THE A COMPUTATION
MODIFICATION TO THE i COMPUTATION
RECOMMENDED PROCEDURE
STRUCUtL RESULTS
FINAL COMMENTS
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.