Fast graphs for the random walker

Details Fast graphs for the random walker Fast graphs for the random walker

2001-02-26

arxiv.org/abs/math/0102200v1

Probab. Theory Related Fields 124 (2002), no. 1, 50-72

Mathematics

Probability

22 pages

Scientific paper

10.1007/s004400200200

Consider the time T_oz when the random walk on a weighted graph started at the vertex o first hits the vertex set z. We present lower bounds for T_oz in terms of the volume of z and the graph distance between o and z. The bounds are for expected value and large deviations, and are asymptotically sharp. We deduce rate of escape results for random walks on infinite graphs of exponential or polynomial growth, and resolve a conjecture of Benjamini and Peres.

Affiliated with

Also associated with

No associations

Rating

Fast graphs for the random walker 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 Fast graphs for the random walker, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast graphs for the random walker will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-563425