The hitting times of random walks on bicyclic graphs

DOI10.1007/s00373-021-02360-3zbMath1479.05332OpenAlexW3178620082MaRDI QIDQ2053698

Xiaomin Zhu, Xiao Dong Zhang

Publication date: 30 November 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02360-3

zbMATH Keywords

random walkhitting timebicyclic graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random walks on graphs (05C81)

Related Items (2)

Some further results on the maximal hitting times of trees with some given parameters ⋮ Hitting times for random walks on tricyclic graphs

Cites Work

• 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
• On hitting times of random walks on trees
• Expected hitting times for a random walk on a connected graph
• The electrical resistance of a graph captures its commute and cover times
• Discrete Green's functions
• Further results on the expected hitting time, the cover cost and the related invariants of graphs
• Discrete Green's functions and random walks on graphs
• Decomposing hitting times of walks on graphs into simpler ones
• Non-negative matrices and Markov chains.
• 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
• Cutpoint Decoupling and First Passage Times for Random Walks on Graphs
• Extremal cover times for random walks on trees
• Chung-Yau Invariants and Graphs with Symmetric Hitting Times
• Extremal hitting times of trees with some given parameters
• The hitting time of random walk on unicyclic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The hitting times of random walks on bicyclic graphs