A transient Markov chain with finitely many cutpoints
Nicholas James, Russell Lyons, Yuval Peres
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.
First Page:
Show
Hide
Primary Subjects: 60J10
Secondary Subjects: 60J50
Keywords: birth-and-death chain; cutpoints; exchangeable; nearest-neighbor random walk; occupation numbers; transient Markov chain; trees
Full-text: Open access
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.imsc/1207580076
Digital Object Identifier: doi:10.1214/193940307000000365
References
[1] Blachère, S. (2003). Cut times for random walks on the discrete Heisenberg group. Ann. Inst. H. Poincaré Probab. Statist. 39 621–638.
Mathematical Reviews (MathSciNet):
MR1983173
Zentralblatt MATH:
1022.60004
Digital Object Identifier: doi:10.1016/S0246-0203(03)00017-7
[2] Bollobás, B. (1998). Modern Graph Theory. Springer, New York.
[3] Diaconis, P. and Freedman, D. (1980). De Finetti’s theorem for Markov chains. Ann. Probab. 8 115–130.
[4] James, N. (1996). Exchangeable events for markov chains. Ph.D. thesis, Dept. Mathematics, UC Berkeley.
Mathematical Reviews (MathSciNet):
MR2694806
[5] James, N. and Peres, Y. (1996). Cutpoints and exchangeable events for random walks. Teor. Veroyatnost. i Primenen. 41 854–868; also in Theory Probab. Appl. 41 (1996), 666–677 (1997).
Mathematical Reviews (MathSciNet):
MR1687097
[6] Kaĭmanovich, V. A. (1991). Poisson boundaries of random walks on discrete solvable groups. Probability Measures on Groups X (H. Heyer, ed.) 205–238. Plenum Press, New York.
Mathematical Reviews (MathSciNet):
MR1178986
Zentralblatt MATH:
0823.60006
[7] Kaĭmanovich, V. A. and Vershik, A. M. (1983). Random walks on discrete groups: Boundary and entropy. Ann. Probab. 11 457–490.
Mathematical Reviews (MathSciNet):
MR704539
Zentralblatt MATH:
0641.60009
Digital Object Identifier: doi:10.1214/aop/1176993497
Project Euclid: euclid.aop/1176993497
[8] Lawler, G. (1991). Intersections of Random Walks. Birkhäuser, Boston.
Mathematical Reviews (MathSciNet):
MR1117680
[9] Wilson, D. (1996). Generating random spanning trees more quickly than the cover time. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing 296–303. ACM, New York.
Mathematical Reviews (MathSciNet):
MR1427525
Zentralblatt MATH:
0946.60070
Institute of Mathematical Statistics Collections
