Hostname: page-component-848d4c4894-8kt4b Total loading time: 0 Render date: 2024-06-14T16:39:53.740Z Has data issue: false hasContentIssue false
  • English
  • Français

Cover Times and Generic Chaining

Part of: Stochastic processes Markov processes

Published online by Cambridge University Press:  30 January 2018

Joseph Lehec
Joseph Lehec*
Affiliation:
Université Paris-Dauphine
*
∗ Postal address: Université Paris-Dauphine, UMR CNRS 7534, Place de Lattre de Tassigny, Paris, 75016, France. Email address: lehec@ceremade.dauphine.fr
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A recent result of Ding, Lee and Peres (2012) expressed the cover time of the random walk on a graph in terms of generic chaining for the commute distance. Their argument is based on Dynkin's isomorphism theorem. The purpose of this article is to present an alternative approach to this problem, based only on elementary hitting time estimates and chaining arguments.

Keywords

Markov chainhitting timecover timegeneric chaining

MSC classification

Primary: 60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
Secondary: 60G15: Gaussian processes
Type
Research Article
Information
Journal of Applied Probability , Volume 51 , Issue 1 , March 2014 , pp. 247 - 261
Copyright
© Applied Probability Trust 

References

Aldous, D. and Fill, J. A. (2014). Reversible Markov chains and random walks on graphs. In preparation. Early drafts of chapters available at: http://www.stat.berkeley.edu/users/aldous/RWG/book.html Google Scholar
Barlow, M. T., Ding, J., Nachmias, A. and Peres, Y. (2011). The evolution of the cover time. Combin. Prob. Comput. 20, 331–345.Google Scholar
Ding, J., Lee, J. R. and Peres, Y. (2012). Cover times, blanket times, and majorizing measures. Ann. Math. 175, 1409–1471.Google Scholar
Kahn, J., Kim, J. H., Lovász, L. and Vu, V. H. (2000). The cover time, the blanket time, and the Matthews bound. In 41st Annual Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, pp. 467–475.Google Scholar
Levin, D. A., Peres, Y. and Wilmer, E. L. (2009). Markov Chains and Mixing Times. American Mathematical Society, Providence, RI.Google Scholar
Matthews, P. (1988). Covering problems for Brownian motion on spheres. Ann. Prob. 16, 189–199.Google Scholar
Talagrand, M. (2005). The Generic Chaining. Springer, Berlin.Google Scholar