Article contents
Cover Times and Generic Chaining
Published online by Cambridge University Press: 30 January 2018
Abstract
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.
MSC classification
- Type
- Research Article
- Information
- Copyright
- © Applied Probability Trust
References
- 1
- Cited by