Chung-Yau Invariants and Graphs with Symmetric Hitting Times

被引：16

作者：

Chang, Xiao ^{[1
]}

Xu, Hao ^{[1
]}

机构：

[1] Univ Pittsburgh, Dept Math, Pittsburgh, PA 15260 USA

来源：

JOURNAL OF GRAPH THEORY | 2017年 / 85卷 / 03期

关键词：

random walk; Chung-Yau invariants; reversible graphs; DISCRETE GREENS-FUNCTIONS; RANDOM-WALKS;

D O I：

10.1002/jgt.22099

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The Chung-Yau graph invariants were originated from Chung-Yau's work on discrete Green's function. We show how they could be used to derive new explicit formulas and estimates for hitting times of random walks. We also apply them to study graphs with symmetric hitting times. (C) 2017 Wiley Periodicals, Inc.

引用

页码：691 / 705

页数：15

共 19 条

[1]

Aleliunas Romas., 1979, Proceedings of the 20th Symposium on Foundations of Computer Science (FOCS), P218, DOI [10.1109/SFCS.1979.34, DOI 10.1109/SFCS.1979.34]

[2]

[Anonymous], 1984, CARUS MATH MONOGRAPH

[3]

Chandra A. K., 1989, Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, P574, DOI 10.1145/73007.73062

[4] Random Walks on Complete Multipartite Graphs [J].