generic chaining
Recently Published Documents


TOTAL DOCUMENTS

14
(FIVE YEARS 1)

H-INDEX

4
(FIVE YEARS 0)

2014 ◽  
Vol 51 (1) ◽  
pp. 247-261
Author(s):  
Joseph Lehec

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.


2014 ◽  
Vol 51 (01) ◽  
pp. 247-261
Author(s):  
Joseph Lehec

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.


2013 ◽  
Vol 143 (6) ◽  
pp. 1001-1012 ◽  
Author(s):  
Sara van de Geer
Keyword(s):  

2013 ◽  
Vol 143 (6) ◽  
pp. 1026-1028
Author(s):  
Sara van de Geer
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document