generic chaining
Recently Published Documents

TOTAL DOCUMENTS

14
(FIVE YEARS 1)

H-INDEX

4
(FIVE YEARS 0)
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

scholarly journals Cover Times and Generic Chaining

2014 ◽  
Vol 51 (1) ◽  
pp. 247-261
Author(s):  
Joseph Lehec
Keyword(s):  
Random Walk ◽  
Recent Result ◽  
Hitting Time ◽  
Isomorphism Theorem ◽  
Cover Time ◽  
Time Estimates ◽  
Alternative Approach ◽  
Cover Times ◽  
Generic Chaining ◽  
Commute Distance

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.

scholarly journals Cover Times and Generic Chaining

2014 ◽  
Vol 51 (01) ◽  
pp. 247-261
Author(s):  
Joseph Lehec
Keyword(s):  
Random Walk ◽  
Recent Result ◽  
Hitting Time ◽  
Isomorphism Theorem ◽  
Cover Time ◽  
Time Estimates ◽  
Alternative Approach ◽  
Cover Times ◽  
Generic Chaining ◽  
Commute Distance

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.

scholarly journals Generic chaining and the ℓ1-penalty

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

Generic chaining and the rejoinder

2013 ◽  
Vol 143 (6) ◽  
pp. 1026-1028
Author(s):  
Sara van de Geer
Keyword(s):  
Generic Chaining
Load More ...
Sign in / Sign up

Export Citation Format

Share Document