Finding hitting times in various graphs
The hitting time, huv, 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.
Year of publication: |
2013
|
---|---|
Authors: | Rao, Shravas K. |
Published in: |
Statistics & Probability Letters. - Elsevier, ISSN 0167-7152. - Vol. 83.2013, 9, p. 2067-2072
|
Publisher: |
Elsevier |
Subject: | Random walks | Hitting time |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
Abbring, Jaap H., (2007)
-
Subdiffusive option price model with inverse Gaussian subordinator
Shchestyuk, Nataliya, (2024)
-
Valuation of credit default swaps via Bessel bridges
del Valle, Gerardo Hernández, (2014)
- More ...