A transient Markov chain with finitely many cutpoints

DOI10.1214/193940307000000365zbMath1167.60340arXiv0706.2013OpenAlexW2154734583MaRDI QIDQ3626759

Nicholas James, Yuval Peres, Russell Lyons

Publication date: 22 May 2009

Published in: Institute of Mathematical Statistics Collections (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0706.2013

zbMATH Keywords

treesexchangeabletransient Markov chainoccupation numbersbirth-and-death chaincutpointsnearest-neighbor random walk

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Boundary theory for Markov processes (60J50)

Related Items (10)

Recurrence of Markov chain traces ⋮ Asymptotics of product of nonnegative 2-by-2 matrices with applications to random walks with asymptotically zero drifts ⋮ Most transient random walks have infinitely many cut times ⋮ Arboreal structures on groups and the associated boundaries ⋮ Cutpoints of (1,2) and (2,1) random walks on the lattice of positive half line ⋮ Unnamed Item ⋮ Cutpoints and resistance of random walk paths ⋮ Cutpoints of non-homogeneous random walks ⋮ On the number of cutpoints of the transient nearest neighbor random walk on the line ⋮ Transient nearest neighbor random walk on the line

This page was built for publication: A transient Markov chain with finitely many cutpoints