On the first passage time of a simple random walk on a tree
From MaRDI portal
Publication:634583
DOI10.1016/J.SPL.2011.05.017zbMATH Open1232.60033OpenAlexW2015117969MaRDI QIDQ634583FDOQ634583
Authors: R. 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
Recommendations
Cites Work
- The matrix-forest theorem and measuring relations in small social groups
- Generalized inverses. Theory and applications.
- A note on expected hitting times for birth and death chains
- Title not available (Why is that?)
- Random walks and the effective resistance of networks
- Finite Continuous Time Markov Chains
- On distance matrices and Laplacians
- The generating functions of hitting times for random walk on trees
- On the inverse mean first passage matrix problem and the inverse \(M\)-matrix problem
- The expected hitting times for graphs with cutpoints.
Cited In (8)
- Mixing time for a random walk on rooted trees
- The generating functions of hitting times for random walk on trees
- On partial sums of hitting times
- Exact and approximate mean first passage times on trees and other necklace structures: a local equilibrium approach
- On the moments of hitting times for random walks on trees
- The first Dirichlet eigenvalue of birth-death process on trees
- Random walks on the triangular prism and other vertex-transitive graphs
- Extremal first passage times for trees
This page was built for publication: On the first passage time of a simple random walk on a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q634583)