|
|||||
|
|
|
|
|
|
|
|
|
Spanning trees and
random walks on weighted graphs
Xiao Chang, Hao Xu and Shing-Tung Yau |
|
Vol. 273 (2015), No. 1, 241–255
|
Abstract |
|
Using two graph invariants arising from Chung and Yau’s 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. |
Keywords
hitting time, random walk, spanning tree
|
Mathematical Subject Classification 2010
Primary: 05C81
|
Milestones
Received: 24 February 2014
Accepted: 20 April 2014
Published: 6 December 2014
|
Authors |
| Xiao Chang | |
| Department of Mathematics University of Pittsburgh 301 Thackeray Hall Pittsburgh, PA 15260 United States |
|
| Hao Xu | |
| Department of Mathematics University of Pittsburgh 301 Thackeray Hall Pittsburgh, PA 15260 United States |
|
| Shing-Tung Yau | |
| Department of Mathematics Harvard University Cambridge, MA 02138 United States |
|
|
