The electrical resistance of a graph captures its commute and cover times
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Maximum hitting time for random walks on graphs
Random Structures & Algorithms
| Hi-index | 0.00 |
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 one of these examples, we show that the bounds obtained from the spanning method are sharper than bounds obtained from other commonly used techniques.