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 mentioned.

[1]  K. Symanzik.  Euclidean Quantum Field Theory. I: Equations For A Scalar Model , 2015 .

[2]  J. Bell.  Gaussian Hilbert spaces , 2015 .

[3]  A. Sznitman.  Disconnection and level-set percolation for the Gaussian free field , 2014, 1407.0269.

[4]  Titus Lupu.  From loop clusters and random interlacement to the free field , 2014, 1402.0298.

[5]  Jian Ding,et al.  Asymptotics of cover times via Gaussian free fields: Bounded-degree graphs and general trees , 2011, 1103.4402.

[6]  Mohammed Abdullah,et al.  The Cover Time of Random Walks on Graphs , 2012, ArXiv.

[7]  A PTAS for Computing the Supremum of Gaussian Processes , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[8]  A. Sznitman.  An isomorphism theorem for random interlacements , 2011, 1111.4818.

[9]  École d'été de probabilités de Saint-Flour,et al.  Markov Paths, Loops and Fields: École d'Été de Probabilités de Saint-Flour XXXVIII – 2008 , 2011 .

[10]  Yuval Peres,et al.  Cover times, blanket times, and majorizing measures , 2010, STOC '11.

[11]  Y. Jan.  Markov paths, loops and fields , 2008, 0808.2303.

[12]  Y. Jan.  Markov loops and renormalization , 2008, 0802.2478.

[13]  A. Comtet,et al.  TOPICAL REVIEW: Functionals of Brownian motion, localization and metric graphs , 2005, cond-mat/0504513.

[14]  A. Dembo,et al.  Cover times for Brownian motion and random walks in two dimensions , 2001, math/0107191.

[15]  M. Ledoux.  The concentration of measure phenomenon , 2001 .

[16]  H. Kaspi,et al.  A Ray-Knight theorem for symmetric Markov processes , 2000 .

[17]  László Lovász,et al.  The cover time, the blanket time, and the Matthews bound , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[18]  O. Schramm,et al.  On the Cover Time of Planar Graphs , 2000, math/0002034.

[19]  David Nualart Rodón,et al.  GAUSSIAN HILBERT SPACES (Cambridge Tracts in Mathematics 129) By SVANTE JANSON: 340 pp., £40.00, ISBN 0 521 56128 0 (Cambridge University Press, 1997) , 1998 .

[20]  Nathalie Eisenbaum.  Une version sans conditionnement du theoreme d’isomorphisme de Dynkin , 1995 .

[21]  M. Marcus,et al.  Sample Path Properties of the Local Times of Strongly Symmetric Markov Processes Via Gaussian Processes , 1992 .

[22]  D. Aldous.  Random walk covering of some special trees , 1991 .

[23]  D. Aldous.  Threshold limits for cover times , 1991 .

[24]  David Zuckerman,et al.  A technique for lower bounding the cover time , 1990, STOC '90.

[25]  P. Matthews.  Covering Problems for Markov Chains , 1988 .

[26]  E. Dynkin,et al.  Gaussian and non-Gaussian random fields associated with Markov processes , 1984 .

[27]  J. Fröhlich,et al.  The random walk representation of classical spin systems and correlation inequalities , 1982 .

[28]  F. Knight,et al.  Random walks and a sojourn density process of Brownian motion , 1963 .