Finding hitting times in various graphs
Probability
2012-08-13 v1 Discrete Mathematics
Combinatorics
Abstract
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.
Keywords
Cite
@article{arxiv.1208.2171,
title = {Finding hitting times in various graphs},
author = {Shravas Rao},
journal= {arXiv preprint arXiv:1208.2171},
year = {2012}
}