An explicit formula of hitting times for random walks on graphs

DOI10.4310/PAMQ.2014.v10.n3.a6zbMath1306.05228arXiv1312.0065MaRDI QIDQ2514190

Hao Xu, Shing Tung Yau

Publication date: 2 February 2015

Published in: Pure and Applied Mathematics Quarterly (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.0065

zbMATH Keywords

spanning treerandom walkhitting time

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random walks on graphs (05C81)

Related Items (8)

Further results on the expected hitting time, the cover cost and the related invariants of graphs ⋮ Some further results on the maximal hitting times of trees with some given parameters ⋮ Hitting times for random walks on subdivision and triangulation graphs ⋮ The hitting times of random walks on bicyclic graphs ⋮ Chung-Yau Invariants and Graphs with Symmetric Hitting Times ⋮ Expected hitting times for random walks on the \(k\)-triangle graph and their applications ⋮ The hitting time of random walk on unicyclic graphs ⋮ Dumbbell graphs with extremal (reverse) cover cost

This page was built for publication: An explicit formula of hitting times for random walks on graphs