✳flâneur — a map of the web's best reading

refining bounds - cover times

arxiv.org · 95 words · saved by 1 readers

N/A

Exponential concentration of cover times 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 ment

Explore this link on the map →

saved by

related reading