arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0904.1413math.PR
收藏

吸收马尔可夫链的Engel算法

The Engel algorithm for absorbing Markov chains

J. Laurie Snell

摘要:

在这个模块中,适用于在一个介绍性的概率课程,我们提出了恩格尔的芯片移动算法找到基本的描述量的吸收马尔可夫链,并证明它的工作。证明的棘手部分涉及到表明筹码的初始分布是递归的。在撰写本文时(大约1979年),还没有公开的证据可以证明这一点,尽管恩格尔说L.谢勒

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑