Abstract
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.
Author information
Authors and Affiliations
Additional information
Received: 31 October 2000 / Revised version: 5 January 2002 / Published online: 22 August 2002
Rights and permissions
About this article
Cite this article
Virág, B. Fast graphs for the random walker. Probab Theory Relat Fields 124, 50–72 (2002). https://doi.org/10.1007/s004400200200
Issue Date:
DOI: https://doi.org/10.1007/s004400200200
Keywords
- Lower Bound
- Peris
- Random Walk
- Weighted Graph
- Polynomial Growth