Abstract
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.
Publisher
Cambridge University Press (CUP)
Reference20 articles.
1. Random flights on regular graphs
2. Markov Chain Models — Rarity and Exponentiality
3. Random walks on graphs
4. [9] Cox J. T. . Coalescing random walks and voter model consensus times on the torus. Ann. Probab. (to appear).
5. [4] Aldous D. J. . Random walks on large graphs. (Unpublished lecture notes, projected monograph.)
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献