Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters
DOI10.1080/03081087.2019.1643822zbMATH Open1472.05135OpenAlexW2962778578WikidataQ127445067 ScholiaQ127445067MaRDI QIDQ4959293FDOQ4959293
Authors: Ziliang Guo, Shuchao Li, Xin Liu, Xiaoling Mei 
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
Recommendations
- Expected hitting times for random walks on quadrilateral graphs and their applications
- Expected hitting times for random walks on the \(k\)-triangle graph and their applications
- Hitting times for random walks on subdivision and triangulation graphs
- The hitting times of random walks on bicyclic graphs
- Decomposing hitting times of walks on graphs into simpler ones
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Connectivity (05C40) Random walks on graphs (05C81)
Cites Work
- Title not available (Why is that?)
- Spanning trees and random walks on weighted graphs
- An introduction to the theory of graph spectra
- Title not available (Why is that?)
- Title not available (Why is that?)
- The role of Kemeny's constant in properties of Markov chains
- Resistance distance and the normalized Laplacian spectrum
- Asymptotic probabilities of misclassification of two discriminant functions in cases of high dimensional data
- A note on expected hitting times for birth and death chains
- Counting spanning trees in self-similar networks by evaluating determinants
- Random walks and the effective resistance of networks
- On the Ihara zeta function and resistance distance-based indices
- Title not available (Why is that?)
- The electrical resistance of a graph captures its commute and cover times
- Hitting times for random walks on vertex-transitive graphs
- More on random walks, electrical networks, and the harmonic \(k\)-server algorithm.
- The hitting and cover times of random walks on finite graphs using local degree information
- Hitting times, cover cost, and the Wiener index of a tree
- Bounds on expected hitting times for a random walk on a connected graph
- Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains
- The expected hitting times for finite Markov chains
- Discrete Green's functions and random walks on graphs
- The normalized Laplacian spectra of the corona and edge corona of two graphs
- Hitting times for random walks on subdivision and triangulation graphs
- Expected hitting times for random walks on quadrilateral graphs and their applications
- A collection of results concerning electric resistance and simple random walk on distance-regular graphs
- Expected hitting times for a random walk on a connected graph
- The hitting time of multiple random walks
- Random walks on the triangular prism and other vertex-transitive graphs
- Expected hitting and cover times of random walks on some special graphs
- Decomposing hitting times of walks on graphs into simpler ones
- A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs
- Chung-Yau invariants and graphs with symmetric hitting times
- Tutte polynomials of two self-similar network models
Cited In (6)
- Fractal and first-passage properties of a class of self-similar networks
- First-passage properties of bundled networks
- Hitting times for random walks on tricyclic graphs
- The normalized Laplacian spectrum of n -polygon graphs and applications
- Tutte polynomial of tensor product graph and its applications
- Expected hitting times for random walks on quadrilateral graphs and their applications
This page was built for publication: Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4959293)
