Cover times and generic chaining
Lehec, Joseph (2014), Cover times and generic chaining, Journal of Applied Probability, 51, 1, p. 247-261. http://dx.doi.org/10.1239/jap/1395771427
Type
Article accepté pour publication ou publiéExternal document link
https://hal.archives-ouvertes.fr/hal-01100928Date
2014Journal name
Journal of Applied ProbabilityVolume
51Number
1Publisher
Applied Probability Trust
Pages
247-261
Publication identifier
Metadata
Show full item recordAbstract (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.Subjects / Keywords
Cover times; generic chaining; random walkRelated items
Showing items related by title and author.
-
Klartag, Bo'az; Lehec, Joseph (2019) Article accepté pour publication ou publié
-
Chafaï, Djalil; Lehec, Joseph (2018) Document de travail / Working paper
-
Caglar, Umut; Fradelizi, Matthieu; Guédon, Olivier; Lehec, Joseph; Schütt, Carsten; Werner, Elisabeth (2016) Article accepté pour publication ou publié
-
Lehec, Joseph (2014) Article accepté pour publication ou publié
-
Lehec, Joseph (2013) Article accepté pour publication ou publié