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 条
  • [1] The expected hitting times for graphs with cutpoints
    Chen, HY
    Zhang, FJ
    STATISTICS & PROBABILITY LETTERS, 2004, 66 (01) : 9 - 17
  • [2] The Hitting Times of Random Walks on Bicyclic Graphs
    Xiaomin Zhu
    Xiao-Dong Zhang
    Graphs and Combinatorics, 2021, 37 : 2365 - 2386
  • [3] Hitting Times for Random Walks on Sierpiski Graphs and Hierarchical Graphs
    Qi, Yi
    Dong, Yuze
    Zhang, Zhongzhi
    Zhang, Zhang
    COMPUTER JOURNAL, 2020, 63 (09): : 1385 - 1396
  • [4] Cover and hitting times of hyperbolic random graphs
    Kiwi, Marcos
    Schepers, Markus
    Sylvester, John
    RANDOM STRUCTURES & ALGORITHMS, 2024, 65 (04) : 915 - 978
  • [5] The Hitting Times of Random Walks on Bicyclic Graphs
    Zhu, Xiaomin
    Zhang, Xiao-Dong
    GRAPHS AND COMBINATORICS, 2021, 37 (06) : 2365 - 2386
  • [6] Hitting times for random walks on tricyclic graphs
    Zhu, Xiao-Min
    Yang, Xu
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2023, 20 (01) : 65 - 72
  • [7] Ranking graphs through hitting times of Markov chains
    De Santis, Emilio
    RANDOM STRUCTURES & ALGORITHMS, 2021, 59 (02) : 189 - 203
  • [8] Hitting and Commute Times in Large Random Neighborhood Graphs
    von Luxburg, Ulrike
    Radl, Agnes
    Hein, Matthias
    JOURNAL OF MACHINE LEARNING RESEARCH, 2014, 15 : 1751 - 1798
  • [9] Decomposing Hitting Times of Walks on Graphs into Simpler Ones
    Miguel Del Río
    José Luis Palacios
    Methodology and Computing in Applied Probability, 2016, 18 : 1035 - 1042
  • [10] An Explicit Formula of Hitting Times for Random Walks on Graphs
    Xu, Hao
    Yau, Shing-Tung
    PURE AND APPLIED MATHEMATICS QUARTERLY, 2014, 10 (03) : 567 - 581
12345