An explicit formula of hitting times for random walks on graphs
classification
🧮 math.CO
keywords
hittingtimesgraphsformulaboundexplicitgeneralprove
read the original abstract
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, prove a sharp bound of hitting times for adjacent vertices and derive closed formulas of hitting times for some special graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.