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.
Citation
Joseph Lehec. "Cover times and generic chaining." J. Appl. Probab. 51 (1) 247 - 261, March 2014. https://doi.org/10.1239/jap/1395771427
Information
