By Topic

A Flow-Graph Formula for the Stationary Distribution of a Markov Chain

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Bruno O. Shubert ; Department of Operations Research and Administrative Services, Naval Postgraduate School, Monterey, Calif. 93940.

It is shown that a stationary distribution of a regular Markov chain can be obtained directly from its transition graph. The technique is similar to signal flow-graph methods, however, it uses trees of the graph rather than loops. The proof is direct and simple.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:SMC-5 ,  Issue: 5 )