caa a22 4500 386385459 CHVBK 20180307112057.0 cr unu---uuuuu 161130e198907 xx s 000 0 eng 10.1017/S0305004100068079 doi S0305004100068079 pii (NATIONALLICENCE)cambridge-10.1017/S0305004100068079 Aldous David Department of Statistics, University of California, Berkeley CA 94720, U.S.A. Hitting times for random walks on vertex-transitive graphs [Elektronische Daten] [David Aldous] For 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. Copyright © Cambridge Philosophical Society 1989 Mathematical Proceedings of the Cambridge Philosophical Society Cambridge University Press 106/1(1989-07), 179-191 0305-0041 106:1<179 1989 106 PSP https://doi.org/10.1017/S0305004100068079 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1017/S0305004100068079 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Aldous David Department of Statistics, University of California, Berkeley CA 94720, U.S.A NATIONALLICENCE 773 0- Mathematical Proceedings of the Cambridge Philosophical Society Cambridge University Press 106/1(1989-07), 179-191 0305-0041 106:1<179 1989 106 PSP CC0 http://creativecommons.org/publicdomain/zero/1.0 nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-cambridge