Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters
From MaRDI portal
Publication:4959293
DOI10.1080/03081087.2019.1643822zbMath1472.05135OpenAlexW2962778578WikidataQ127445067 ScholiaQ127445067MaRDI QIDQ4959293
Xiaoling Mei, Xin Liu, Shuchao Li, Ziliang Guo
Publication date: 13 September 2021
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2019.1643822
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Connectivity (05C40) Random walks on graphs (05C81)
Related Items (3)
Hitting times for random walks on tricyclic graphs ⋮ The normalized Laplacian spectrum of n -polygon graphs and applications ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Ihara zeta function and resistance distance-based indices
- Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains
- Random walks and the effective resistance of networks
- Resistance distance and the normalized Laplacian spectrum
- A collection of results concerning electric resistance and simple random walk on distance-regular graphs
- Bounds on expected hitting times for a random walk on a connected graph
- The expected hitting times for finite Markov chains
- The hitting and cover times of random walks on finite graphs using local degree information
- Random walks on the triangular prism and other vertex-transitive graphs
- Expected hitting times for a random walk on a connected graph
- A note on expected hitting times for birth and death chains
- The electrical resistance of a graph captures its commute and cover times
- Tutte polynomials of two self-similar network models
- More on random walks, electrical networks, and the harmonic \(k\)-server algorithm.
- Discrete Green's functions and random walks on graphs
- Spanning trees and random walks on weighted graphs
- Decomposing hitting times of walks on graphs into simpler ones
- Asymptotic probabilities of misclassification of two discriminant functions in cases of high dimensional data
- Counting spanning trees in self-similar networks by evaluating determinants
- The normalized Laplacian spectra of the corona and edge corona of two graphs
- Hitting Times, Cover Cost, and the Wiener Index of a Tree
- A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs
- The Hitting Time of Multiple Random Walks
- Hitting times for random walks on vertex-transitive graphs
- Expected hitting and cover times of random walks on some special graphs
- Hitting times for random walks on subdivision and triangulation graphs
- Expected hitting times for random walks on quadrilateral graphs and their applications
- Chung-Yau Invariants and Graphs with Symmetric Hitting Times
- The Role of Kemeny's Constant in Properties of Markov Chains
This page was built for publication: Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters
