The access time of random walks on trees with given partition

DOI10.1016/J.AMC.2022.127173OpenAlexW4224143395MaRDI QIDQ2141241

Wei Wang, Guihai Yu, Lu Lu, Wei-jun Liu, Li-Hua Feng

Publication date: 23 May 2022

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

Full work available at URL: https://doi.org/10.1016/j.amc.2022.127173

zbMATH Keywords

treestopping rulerandom walk

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact mixing times for random walks on trees
• On hitting times of random walks on trees
• Expected hitting times for a random walk on a connected graph
• Random walks on graphs
• The expected hitting times for graphs with cutpoints.
• Maximum hitting time for random walks on graphs
• Reversal of Markov Chains and the Forget Time
• Finite Markov Chains and Algorithmic Applications
• Extremal cover times for random walks on trees

This page was built for publication: The access time of random walks on trees with given partition