Pure and Applied Mathematics Quarterly
Volume 10 (2014)
An explicit formula of hitting times for random walks on graphs
Pages: 567 – 581
We prove an explicit formula of hitting times in terms of enumerations of spanning trees for random walks on general connected graphs.We apply the formula to improve Lawler’s bound of hitting times for general graphs and derive closed formulas of hitting times for some special graphs.
random walk, hitting time, spanning tree
2010 Mathematics Subject Classification
Primary 05C81. Secondary 05C50, 60G50.