Expected hitting times for random walks on quadrilateral graphs and their applications

DOI10.1080/03081087.2017.1395793zbMath1397.05168OpenAlexW2766073208MaRDI QIDQ4689926

Shuchao Li, Jing Huang

Publication date: 22 October 2018

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2017.1395793

zbMATH Keywords

spanning treehitting timedegree-Kirchhoff indexKemeny's constantquadrilateral graph

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Distance in graphs (05C12) Connectivity (05C40) Random walks on graphs (05C81)

Related Items (7)

Some further results on the maximal hitting times of trees with some given parameters ⋮ Hitting times for random walks on tricyclic graphs ⋮ The normalized Laplacian spectrum of n -polygon graphs and applications ⋮ Bounds on Kemeny's constant of trees with a prescribed matching number ⋮ Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters ⋮ The hitting times of random walks on bicyclic graphs ⋮ The hitting time of random walk on unicyclic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains
• On the Ihara zeta function and resistance distance-based indices
• The (normalized) Laplacian eigenvalue of signed graphs
• 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
• The expected hitting times for graphs with cutpoints.
• The normalized Laplacian, degree-Kirchhoff index and spanning trees of the linear polyomino chains
• The normalized Laplacian spectrum of quadrilateral graphs and its applications
• 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
• Algebraic aspects of the normalized Laplacian
• 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
• Chung-Yau Invariants and Graphs with Symmetric Hitting Times
• ON THE NORMALISED LAPLACIAN SPECTRUM, DEGREE-KIRCHHOFF INDEX AND SPANNING TREES OF GRAPHS
• The Role of Kemeny's Constant in Properties of Markov Chains

This page was built for publication: Expected hitting times for random walks on quadrilateral graphs and their applications