The Engel algorithm for absorbing Markov chains

Details The Engel algorithm for absorbing Markov chains The Engel algorithm for absorbing Markov chains

2009-04-08

arxiv.org/abs/0904.1413v1

Mathematics

Probability

Version dated circa 1979; GNU FDL

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Engel algorithm for absorbing Markov chains does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Engel algorithm for absorbing Markov chains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Engel algorithm for absorbing Markov chains will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-215034