Shravas Rao
Published 2012-08-10Version 1
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.
Random walks with $k$-wise independent increments
Moderate deviations for random walk in random scenery
Random walk in mixed random environment without uniform ellipticity
![QR code for arXiv:1208.2171 [math.PR]](http://oss.arxitics.com/images/favicon.svg)