Translator Disclaimer
Open Access
VOL. 2 | 2008 A transient Markov chain with finitely many cutpoints
Nicholas James, Russell Lyons, Yuval Peres

Editor(s) Deborah Nolan, Terry Speed

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.

Information

Published: 1 January 2008
First available in Project Euclid: 7 April 2008

zbMATH: 1167.60340
MathSciNet: MR2459947

Digital Object Identifier: 10.1214/193940307000000365

Subjects:
Primary: 60J10
Secondary: 60J50

Keywords: birth-and-death chain , cutpoints , Exchangeable , nearest-neighbor random walk , occupation numbers , transient Markov chain , trees

Rights: Copyright © 2008, Institute of Mathematical Statistics

CHAPTER
6 PAGES


SHARE
Back to Top