Abstract (EN)

A recent result of Ding, Lee and Peres expresses the cover time of the random walk on a graph in terms of generic chaining for the commute distance. Their argument is based on the Ray-Knight isomorphism theorem. The purpose of this article is to present an alternative approach to this problem, based only on elementary hitting times estimates and chaining arguments.