Finding hitting times in various graphs

被引：2
|
作者：
Rao, Shravas K. [1 ]
机构：
[1] MIT, Cambridge, MA 02139 USA
来源：
STATISTICS & PROBABILITY LETTERS | 2013年 / 83卷 / 09期
关键词：
Random walks; Hitting time; RANDOM-WALKS;
D O I：
10.1016/j.spl.2013.05.020
中图分类号：
O21 [概率论与数理统计]; C8 [统计学];
学科分类号：
020208 ; 070103 ; 0714 ;
摘要：
The hitting time, h(uv), of a random walk on a finite graph G, is the expected time for the walk to reach vertex v given that it started at vertex u. We present two methods of calculating the hitting time between vertices of finite graphs, along with applications to specific classes of graphs, including grids, trees, and the 'tadpole' graphs. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码：2067 / 2072
页数：6
相关论文
共 50 条
  • [31] Further results on the expected hitting time, the cover cost and the related invariants of graphs
    Huang, Jing
    Li, Shuchao
    Xie, Zheng
    DISCRETE MATHEMATICS, 2019, 342 (01) : 78 - 95
  • [32] Mixing Times are Hitting Times of Large Sets
    Peres, Yuval
    Sousi, Perla
    JOURNAL OF THEORETICAL PROBABILITY, 2015, 28 (02) : 488 - 519
  • [33] Some further results on the maximal hitting times of trees with some given parameters?
    Li, Shuchao
    Xu, Yangyang
    Zhang, Huihui
    DISCRETE APPLIED MATHEMATICS, 2022, 313 : 115 - 134
  • [34] Mixing Times are Hitting Times of Large Sets
    Yuval Peres
    Perla Sousi
    Journal of Theoretical Probability, 2015, 28 : 488 - 519
  • [35] Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters
    Guo, Ziliang
    Li, Shuchao
    Liu, Xin
    Mei, Xiaoling
    LINEAR & MULTILINEAR ALGEBRA, 2021, 69 (10) : 1841 - 1857
  • [36] ULTRAFAST SUBORDINATORS AND THEIR HITTING TIMES
    Kovacs, Mihaly
    Meerschaert, Mark M.
    PUBLICATIONS DE L INSTITUT MATHEMATIQUE-BEOGRAD, 2006, 80 (94): : 193 - 206
  • [37] Markov Chain Hitting Times
    Elliott, Robert J.
    van der Hoek, John
    Sworder, David
    STOCHASTIC ANALYSIS AND APPLICATIONS, 2012, 30 (05) : 827 - 830
  • [38] Hitting Times, Cover Cost, and the Wiener Index of a Tree
    Georgakopoulos, Agelos
    Wagner, Stephan
    JOURNAL OF GRAPH THEORY, 2017, 84 (03) : 311 - 326
  • [39] The generating functions of hitting times for random walk on trees
    Chen, Haiyan
    STATISTICS & PROBABILITY LETTERS, 2007, 77 (15) : 1574 - 1579
  • [40] Random walk hitting times and effective resistance in sparsely connected Erdos-Renyi random graphs
    Sylvester, John
    JOURNAL OF GRAPH THEORY, 2021, 96 (01) : 44 - 84
12345