| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10525841 | Statistics & Probability Letters | 2013 | 6 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Statistics and Probability
Authors
Shravas K. Rao,