On the first passage time of a simple random walk on a tree

DOI10.1016/j.spl.2011.05.017zbMath1232.60033OpenAlexW2015117969MaRDI QIDQ634583

Ravindra B. Bapat

Publication date: 16 August 2011

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2011.05.017

zbMATH Keywords

treerandom walkdistance matrixLaplace matrixmean first passage matrix

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Random walks on graphs (05C81)

Related Items

Exact and approximate mean first passage times on trees and other necklace structures: a local equilibrium approach ⋮ On partial sums of hitting times

Cites Work

• Unnamed Item
• On the inverse mean first passage matrix problem and the inverse \(M\)-matrix problem
• Random walks and the effective resistance of networks
• A note on expected hitting times for birth and death chains
• The matrix-forest theorem and measuring relations in small social groups
• The expected hitting times for graphs with cutpoints.
• On distance matrices and Laplacians
• Generalized inverses. Theory and applications.
• The generating functions of hitting times for random walk on trees
• Finite Continuous Time Markov Chains