Exponential concentration of cover times
Probability
2014-07-30 v1
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-Peres and Ding. The estimate is asymptotically sharp as the ratio of hitting time to cover time goes to zero. The bounds are obtained by showing a stochastic domination in the generalized second Ray-Knight theorem, which was shown to imply exponential concentration of cover times by Ding. This stochastic domination result appeared earlier in a preprint of Lupu, but the connection to cover times was not mentioned.
Keywords
Cite
@article{arxiv.1407.7617,
title = {Exponential concentration of cover times},
author = {Alex Zhai},
journal= {arXiv preprint arXiv:1407.7617},
year = {2014}
}