The hitting time of random walk on unicyclic graphs
From MaRDI portal
Publication:5858679
DOI10.1080/03081087.2019.1611732zbMath1461.05190OpenAlexW2943605996WikidataQ127960342 ScholiaQ127960342MaRDI QIDQ5858679
Publication date: 14 April 2021
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2019.1611732
Related Items (4)
Some further results on the maximal hitting times of trees with some given parameters ⋮ Extremal hitting times of trees with some given parameters ⋮ Hitting times for random walks on tricyclic graphs ⋮ The hitting times of random walks on bicyclic graphs
Cites Work
- Unnamed Item
- Unnamed Item
- The best mixing time for random walks on trees
- Random walks and the effective resistance of networks
- Bounds on expected hitting times for a random walk on a connected graph
- The hitting and cover times of random walks on finite graphs using local degree information
- Expected hitting times for a random walk on a connected graph
- Non-negative matrices and Markov chains. 2nd ed
- Further results on the expected hitting time, the cover cost and the related invariants of graphs
- Decomposing hitting times of walks on graphs into simpler ones
- An explicit formula of hitting times for random walks on graphs
- Asymptotic probabilities of misclassification of two discriminant functions in cases of high dimensional data
- Hitting Times, Cover Cost, and the Wiener Index of a Tree
- A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs
- Hitting times for random walks on vertex-transitive graphs
- Maximum hitting time for random walks on graphs
- Hitting times for random walks on subdivision and triangulation graphs
- Expected hitting times for random walks on quadrilateral graphs and their applications
- Extremal cover times for random walks on trees
- Chung-Yau Invariants and Graphs with Symmetric Hitting Times
This page was built for publication: The hitting time of random walk on unicyclic graphs
