scholarly journals Convergence of mixing times for sequences of random walks on finite graphs

2012 ◽  
Vol 17 (0) ◽  
Author(s):  
David Croydon ◽  
Ben Hambly ◽  
Takashi Kumagai
2018 ◽  
Vol 28 (4) ◽  
pp. 1977-2002 ◽  
Author(s):  
Luca Avena ◽  
Hakan Güldaş ◽  
Remco van der Hofstad ◽  
Frank den Hollander

2014 ◽  
Vol 46 (4) ◽  
pp. 739-761 ◽  
Author(s):  
Shuji Kijima ◽  
Kentaro Koga ◽  
Kazuhisa Makino
Keyword(s):  

Author(s):  
Nicolás Rivera ◽  
Thomas Sauerwald ◽  
Alexandre Stauffer ◽  
John Sylvester
Keyword(s):  

1989 ◽  
Vol 106 (1) ◽  
pp. 179-191 ◽  
Author(s):  
David Aldous

AbstractFor random walks on finite graphs, we record some equalities, inequalities and limit theorems (as the size of graph tends to infinity) which hold for vertex-transitive graphs but not for general regular graphs. The main result is a sharp condition for asymptotic exponentiality of the hitting time to a single vertex. Another result is a lower bound for the coefficient of variation of hitting times. Proofs exploit the complete monotonicity properties of the associated continuous-time walk.


2020 ◽  
Vol 19 (11) ◽  
Author(s):  
Matheus G. Andrade ◽  
Franklin de Lima Marquezino ◽  
Daniel R. Figueiredo
Keyword(s):  

2004 ◽  
Vol 9 (0) ◽  
pp. 825-845 ◽  
Author(s):  
Yuval Peres ◽  
David Revelle

Sign in / Sign up

Export Citation Format

Share Document