SPANNING TREES AND RANDOM WALKS ON WEIGHTED GRAPHS

被引:23
|
作者
Chang, Xiao [1 ]
Xu, Hao [1 ]
Yau, Shing-Tung [2 ]
机构
[1] Univ Pittsburgh, Dept Math, Pittsburgh, PA 15260 USA
[2] Harvard Univ, Dept Math, Cambridge, MA 02138 USA
关键词
hitting time; random walk; spanning tree; DISCRETE GREENS-FUNCTIONS;
D O I
10.2140/pjm.2015.273.241
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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.
引用
收藏
页码:241 / 255
页数:15
相关论文
共 50 条