Winning probabilities in Pass the Buck on complete binary and k-ary trees are computed using the Stochastic Abacus.
The Engel algorithm for absorbing Markov chains
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
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.
fields
math.PR 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Pass the Buck on a Complete Binary Tree
Winning probabilities in Pass the Buck on complete binary and k-ary trees are computed using the Stochastic Abacus.