The Engel algorithm for absorbing Markov chains

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
Version dated circa 1979; GNU FDL

Keywords

Probability, 60J10

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/226259

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0904.1413
 http://arxiv.org/abs/0904.1413

Collections

arXiv