A transient Markov chain with finitely many cutpoints

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.

Published in at http://dx.doi.org/10.1214/193940307000000365 the IMS Collections (http://www.imstat.org/publications/imscollections.htm) by the Institute of Mathematical Statistics (http://www.imstat.org)

Cited by in corpus (5)

• Cutpoints and resistance of random walk paths
• On a maximum of nearest-neighbor random walk with asymptotically zero drift on lattice of positive half line
• Cutpoints of non-homogeneous random walks
• Regeneration of branching processes with immigration in varying environments
• Transient NN random walk on the line