Exponential concentration of cover times

ELECTRONIC JOURNAL OF PROBABILITY, 2018.

Cited by: 1|Views4

Abstract:

We prove an exponential concentration bound for cover times of general graphs in terms of the Gaussian free field, extending the work of Ding, Lee, and Peres [8] and Ding [7]. The estimate is asymptotically sharp as the ratio of hitting time to cover time goes to zero.& para;& para;The bounds are obtained by showing a stochastic dominatio...More

Code:

Data:

Your rating :
0

 

Tags
Comments