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

来源：

PACIFIC JOURNAL OF MATHEMATICS | 2015年 / 273卷 / 01期

关键词：

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 条

[31] Heavy cycles and spanning trees with few leaves in weighted graphs
Li, Binlong
Zhang, Shenggui
APPLIED MATHEMATICS LETTERS, 2011, 24 (06) : 908 - 910
[32] Diameter-Preserving Spanning Trees in Sparse Weighted Graphs
Yue Liu
Jing Huang
Graphs and Combinatorics, 2009, 25 : 753 - 758
[33] Diameter-Preserving Spanning Trees in Sparse Weighted Graphs
Liu, Yue
Huang, Jing
GRAPHS AND COMBINATORICS, 2009, 25 (05) : 753 - 758
[34] A SPANNING TREE METHOD FOR BOUNDING HITTING TIMES OF RANDOM WALKS ON GRAPHS
Cogill, Randy
Peng, Cheng
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 24 (03) : 808 - 820
[35] Optimal path and minimal spanning trees in random weighted networks
Braunstein, Lidia A.
Wu, Zhenhua
Chen, Yiping
Buldyrev, Sergey V.
Kalisky, Tomer
Sreenivasan, Sameet
Cohen, Reuven
Lopez, Eduardo
Havlin, Shlomo
Stanley, H. Eugene
INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS, 2007, 17 (07): : 2215 - 2255
[36] Rainbow spanning trees in random subgraphs of dense regular graphs
Bradshaw, Peter
DISCRETE MATHEMATICS, 2024, 347 (06)
[37] Random spanning trees of Cayley graphs and an associated compactification of semigroups
Evans, SN
PROCEEDINGS OF THE EDINBURGH MATHEMATICAL SOCIETY, 1999, 42 : 611 - 620
[38] Power of k choices and rainbow spanning trees in random graphs
Bal, Deepak
Bennett, Patrick
Frieze, Alan
Pralat, Pawel
ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (01):
[39] Sharp threshold for the appearance of certain spanning trees in random graphs
Hefetz, Dan
Krivelevich, Michael
Szabo, Tibor
RANDOM STRUCTURES & ALGORITHMS, 2012, 41 (04) : 391 - 412
[40] RANDOM-WALKS ON WEIGHTED GRAPHS AND APPLICATIONS TO ONLINE ALGORITHMS
COPPERSMITH, D
DOYLE, P
RAGHAVAN, P
SNIR, M
JOURNAL OF THE ACM, 1993, 40 (03) : 421 - 453

← 1 2 3 4 5 →