Exponential concentration of cover times
From MaRDI portal
Publication:1748936
DOI10.1214/18-EJP149zbMATH Open1391.60177arXiv1407.7617WikidataQ115517769 ScholiaQ115517769MaRDI QIDQ1748936
Author name not available (Why is that?)
Publication date: 15 May 2018
Published in: (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1407.7617
No records found.
No records found.
This page was built for publication: Exponential concentration of cover times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1748936)
