Cutpoints and resistance of random walk paths

Details Cutpoints and resistance of random walk paths Cutpoints and resistance of random walk paths

2009-02-01

arxiv.org/abs/0902.0115v2

Annals of Probability 2011, Vol. 39, No. 3, 1122-1136

Mathematics

Probability

Published in at http://dx.doi.org/10.1214/10-AOP569 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of

Scientific paper

10.1214/10-AOP569

We construct a bounded degree graph $G$, such that a simple random walk on it is transient but the random walk path (i.e., the subgraph of all the edges the random walk has crossed) has only finitely many cutpoints, almost surely. We also prove that the expected number of cutpoints of any transient Markov chain is infinite. This answers two questions of James, Lyons and Peres [A Transient Markov Chain With Finitely Many Cutpoints (2007) Festschrift for David Freedman]. Additionally, we consider a simple random walk on a finite connected graph $G$ that starts at some fixed vertex $x$ and is stopped when it first visits some other fixed vertex $y$. We provide a lower bound on the expected effective resistance between $x$ and $y$ in the path of the walk, giving a partial answer to a question raised in [Ann. Probab. 35 (2007) 732--738].

Affiliated with

Also associated with

No associations

Rating

Cutpoints and resistance of random walk paths does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cutpoints and resistance of random walk paths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cutpoints and resistance of random walk paths will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-158908