The Engel algorithm for absorbing Markov chains

In this module, suitable for use in an introductory probability course, we present Engel's chip-moving algorithm for finding the basic descriptive quantities for an absorbing Markov chain, and prove that it works. The tricky part of the proof involves showing that the initial distribution of ch...

Full description

Saved in:
Bibliographic Details
Main Author Snell, J. Laurie
Format Journal Article
LanguageEnglish
Published 08.04.2009
Subjects
Mathematics - Probability
Online AccessGet full text

Cover

More Information
Summary:In this module, suitable for use in an introductory probability course, we present Engel's chip-moving algorithm for finding the basic descriptive quantities for an absorbing Markov chain, and prove that it works. The tricky part of the proof involves showing that the initial distribution of chips recurs. At the time of writing (circa 1979) no published proof of this was available, though Engel had stated that such a proof had been found by L. Scheller.
DOI:10.48550/arxiv.0904.1413