| A transient Markov chain with finitely many cutpoints (2009) | |||||||||||||||
Abstract | |||||||||||||||
| Dedicated to David Freedman with admiration Abstract: We give an example of a transient reversible Markov chain that almost surely has only a finite number of cutpoints. We explain how this is relevant to a conjecture of Diaconis and Freedman and a question of Kaimanovich. We also answer Kaimanovich’s question when the Markov chain is a nearestneighbor random walk on a tree. 1. | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||