A transient Markov chain with finitely many cutpoints
Probability
2008-05-19 v2
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 nearest-neighbor random walk on a tree.
Cite
@article{arxiv.0706.2013,
title = {A transient Markov chain with finitely many cutpoints},
author = {Nicholas James and Russell Lyons and Yuval Peres},
journal= {arXiv preprint arXiv:0706.2013},
year = {2008}
}