Balint Virag
Published 2001-02-26Version 1
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.
Comments: 22 pages
Journal: Probab. Theory Related Fields 124 (2002), no. 1, 50-72
On upper and lower bounds for probabilities of combinations of events
Lower bounds for bootstrap percolation on Galton-Watson trees
Sharpness of the phase transition and lower bounds for the critical intensity in continuum percolation on $\mathbb{R}^d$
![QR code for arXiv:math/0102200 [math.PR]](http://oss.arxitics.com/images/favicon.svg)