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] Hitting times of quantum and classical random walks in potential spaces
Varsamis, Georgios D.
Karafyllidis, Ioannis G.
Sirakoulis, Georgios Ch.
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2022, 606
[22] Hitting and trapping times on branched structures
Agliari, Elena
Sartori, Fabio
Cattivelli, Luca
Cassi, Davide
PHYSICAL REVIEW E, 2015, 91 (05):
[23] THE MEASURABILITY OF HITTING TIMES
Bass, Richard F.
ELECTRONIC COMMUNICATIONS IN PROBABILITY, 2010, 15 : 99 - 105
[24] Reducing the hitting and the cover times of random walks on finite graphs by local topological information
Ikeda, S
Kubo, I
Yamashita, M
VLSI'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON VLSI, 2003, : 203 - 207
[25] The hitting and cover times of random walks on finite graphs using local degree information
Ikeda, Satoshi
Kubo, Izumi
Yamashita, Masafumi
THEORETICAL COMPUTER SCIENCE, 2009, 410 (01) : 94 - 100
[26] The Hitting Time of Random Walks on Unicyclic Graphs with a Given Maximum DegreeThe Hitting Time of Random Walks on Unicyclic Graphs...X.-M. Zhu et al.
Xiao-Min Zhu
Ya-Li Xie
Ying-Ke Yan
Jing Chen
Bulletin of the Malaysian Mathematical Sciences Society, 2025, 48 (4)
[27] On hitting times for a simple random walk on dense Erdos-Renyi random graphs
Loewe, Matthias
Torres, Felipe
STATISTICS & PROBABILITY LETTERS, 2014, 89 : 81 - 88
[28] The expected hitting times for finite Markov chains
Chen, Haiyan
Zhang, Fuji
LINEAR ALGEBRA AND ITS APPLICATIONS, 2008, 428 (11-12) : 2730 - 2749
[29] Sum rules for hitting times of Markov chains
Luis Palacios, Jose
Renom, Jose M.
LINEAR ALGEBRA AND ITS APPLICATIONS, 2010, 433 (02) : 491 - 497
[30] Meeting times of random walks on graphs
Bshouty, NH
Higham, L
Warpechowska-Gruca, J
INFORMATION PROCESSING LETTERS, 1999, 69 (05) : 259 - 265

← 1 2 3 4 5 →