A transient Markov chain with finitely many cutpoints

@misc{citeulike:2895832, 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.}, author = {James, Nicholas and Lyons, Russell and Peres, Yuval }, citeulike-article-id = {2895832}, eprint = {0706.2013}, keywords = {markov, tree}, month = {May}, posted-at = {2008-06-15 09:02:27}, priority = {2}, title = {A transient Markov chain with finitely many cutpoints}, url = {http://arxiv.org/abs/0706.2013}, year = {2008} }

TY - ELEC ID - citeulike:2895832 L3 - citeulike-article-id:2895832 TI - A transient Markov chain with finitely many cutpoints N2 - 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. KW - markov KW - tree AU - James, Nicholas AU - Lyons, Russell AU - Peres, Yuval PY - 2008/May/19/ UR - http://arxiv.org/abs/0706.2013 ER -