A transient Markov chain with finitely many cutpoints
| dc.creator | James, Nicholas | |
| dc.creator | Lyons, Russell | |
| dc.creator | Peres, Yuval | |
| dc.date | 2007-06-13 | |
| dc.date | 2008-05-19 | |
| dc.date.accessioned | 2026-07-07T09:39:15Z | |
| dc.date.available | 2026-07-07T09:39:15Z | |
| dc.description | 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. | |
| dc.description | 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) | |
| dc.identifier | https://arxiv.org/abs/0706.2013 | |
| dc.identifier | http://arxiv.org/abs/0706.2013 | |
| dc.identifier | IMS Collections 2008, Vol. 2, 24-29 | |
| dc.identifier | doi:10.1214/193940307000000365 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/161102 | |
| dc.subject | Probability | |
| dc.subject | 60J10 (Primary) 60J50 (Secondary) | |
| dc.title | A transient Markov chain with finitely many cutpoints | |
| dc.type | text |