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 条
  • [21] Spectra, Hitting Times and Resistance Distances of q- Subdivision Graphs
    Zeng, Yibo
    Zhang, Zhongzhi
    COMPUTER JOURNAL, 2021, 64 (01): : 76 - 92
  • [22] A SPANNING TREE METHOD FOR BOUNDING HITTING TIMES OF RANDOM WALKS ON GRAPHS
    Cogill, Randy
    Peng, Cheng
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 24 (03) : 808 - 820
  • [23] Means of Hitting Times for Random Walks on Graphs: Connections, Computation, and Optimization
    Xia, Haisong
    Xu, Wanyue
    Zhang, Zuobai
    Zhang, Zhongzhi
    ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2025, 19 (02)
  • [24] Concentration of hitting times in Erdős-Rényi graphs
    Ottolini, Andrea
    Steinerberger, Stefan
    JOURNAL OF GRAPH THEORY, 2024, 107 (02) : 245 - 262
  • [25] Community detection in directed graphs using stationary distribution and hitting times methods
    Tien Dat Dang
    Duy Hieu Do
    Thi Ha Duong Phan
    Social Network Analysis and Mining, 13
  • [26] EXPECTED HITTING AND COVER TIMES OF RANDOM-WALKS ON SOME SPECIAL GRAPHS
    PALACIOS, JL
    RANDOM STRUCTURES & ALGORITHMS, 1994, 5 (01) : 173 - 182
  • [27] Community detection in directed graphs using stationary distribution and hitting times methods
    Dang, Tien Dat
    Do, Duy Hieu
    Phan, Thi Ha Duong
    SOCIAL NETWORK ANALYSIS AND MINING, 2023, 13 (01)
  • [28] Implementation of quantum hitting times of cubelike graphs on IBM's Qiskit platform
    Mulherkar, Jaideep
    Rajdeepak, Rishikant
    Sunitha, V.
    INTERNATIONAL JOURNAL OF QUANTUM INFORMATION, 2022, 20 (07)
  • [29] Asymptotics for hitting times
    Kupsa, M
    Lacroix, Y
    ANNALS OF PROBABILITY, 2005, 33 (02): : 610 - 619
  • [30] HITTING TIMES OF SEQUENCES
    PITTENGER, AO
    STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 1987, 24 (02) : 225 - 240
12345