The cutoff phenomenon in finite Markov chains.
收藏PubMed Central1996-02-20 更新2026-05-02 收录
下载链接：
https://pmc.ncbi.nlm.nih.gov/articles/PMC39998/
下载链接
链接失效反馈官方服务：
资源简介：
Natural mixing processes modeled by Markov chains often show a sharp cutoff in their convergence to long-time behavior. This paper presents problems where the cutoff can be proved (card shuffling, the Ehrenfests' urn). It shows that chains with polynomial growth (drunkard's walk) do not show cutoffs. The best general understanding of such cutoffs (high multiplicity of second eigenvalues due to symmetry) is explored. Examples are given where the symmetry is broken but the cutoff phenomenon persists.
提供机构：
National Academy of Sciences
创建时间：
1996-02-20
