Exponential concentration of cover times
ELECTRONIC JOURNAL OF PROBABILITY, 2018.
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  and Ding . 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
PPT (Upload PPT)