Discrete Green's functions and random walks on graphs
@article{Xu2013DiscreteGF, title={Discrete Green's functions and random walks on graphs}, author={Hao Xu and Shing-Tung Yau}, journal={J. Comb. Theory, Ser. A}, year={2013}, volume={120}, pages={483-499} }
We prove an explicit formula of Chung-Yau@?s Discrete Green@?s functions as well as hitting times of random walks on graphs. The formula is expressed in terms of two natural counting invariants of graphs. Uniform derivations of Green@?s functions and hitting times for trees and other special graphs are given.
Topics from this paper.
Citations
Publications citing this paper.
SHOWING 1-6 OF 6 CITATIONS
A Hitting Time Formula for the Discrete Green's Function
VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED
The discrete Green's function and stopping rules for random walks on graphs
VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED
An explicit formula of hitting times for random walks on graphs
VIEW 3 EXCERPTS
CITES BACKGROUND
Random Walks on Complete Multipartite Graphs 395
VIEW 2 EXCERPTS
CITES BACKGROUND
References
Publications referenced by this paper.
SHOWING 1-10 OF 11 REFERENCES
The expected hitting times for graphs with cutpoints
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL
Spectral Graph Theory CBMS Series
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL
PageRank and Random Walks on Graphs
VIEW 1 EXCERPT
On hitting times of random walks on trees
VIEW 2 EXCERPTS
An Extension of Foster's Network Theorem
VIEW 1 EXCERPT
Collisions among Random Walks on a Graph
VIEW 1 EXCERPT