A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs

In this paper we consider the problem of computing the expected hitting time to a vertex for random walks on graphs. We give a method for computing an upper bound on the expected hitting time from an arbitrary spanning tree of the graph. We illustrate this method with two examples. In these examples, we show that the bounds obtained from the spanning method are sharper than bounds obtained from other commonly used techniques.

• Type: Journal
• Year: 2010
• Where: SIAMDM
• Authors: Randy Cogill, Cheng Peng
• Keywords: Arbitrary Spanning Tree, Hitting Time, SIAMDM 2010, Upper Bound