article Open access
Cover Times and Generic Chaining
Joseph Leheca b✉
- aUniversité Paris-Dauphine
- bCEntre de REcherches en MAthématiques de la DEcision
- ✉Corresponding author
Looking for the full paper…
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
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.
TL;DRA simpler approach to the cover time of the random walk on a graph based on elementary hitting times estimates and chaining arguments is presented. (Semantic Scholar)