Spanning trees and random walks on weighted graphs. (English) Zbl 1307.05207
Summary: Using two graph invariants arising from F. Chung and S. T. Yau’s [J. Comb. Theory, Ser. A 91, No. 1–2, 191–214 (2000; Zbl 0963.65120)] discrete Green’s function, we derive explicit formulas and new estimates of hitting times of random walks on weighted graphs through the enumeration of spanning trees.
MSC:
05C81 | Random walks on graphs |
05C22 | Signed and weighted graphs |
05C05 | Trees |
05C30 | Enumeration in graph theory |