The hitting times of random walks on bicyclic graphs

DOI10.1007/S00373-021-02360-3MaRDI QIDQ2053698zbMATH OpenOpenAlexFDO

Authors 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

bicyclic graphhitting timerandom walk

Mathematics Subject Classification ID

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

Recommendations

• Hitting times for random walks on tricyclic graphs
• The hitting time of random walk on unicyclic graphs
• Hitting times for random walks on vertex-transitive graphs
• An explicit formula of hitting times for random walks on graphs
• scientific article; zbMATH DE number 19173
• Bounds on expected hitting times for a random walk on a connected graph
• Maximum hitting time for random walks on graphs
• Hitting times for random walks on subdivision and triangulation graphs
• On hitting times for a simple random walk on dense Erdös-Rényi random graphs
• Expected hitting times for a random walk on a connected graph

Cites work

• A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs
• 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
• Bounds on expected hitting times for a random walk on a connected graph
• Chung-Yau invariants and graphs with symmetric hitting times
• Cutpoint Decoupling and First Passage Times for Random Walks on Graphs
• Decomposing hitting times of walks on graphs into simpler ones
• Discrete Green's functions
• Discrete Green's functions and random walks on graphs
• Expected hitting times for a random walk on a connected graph
• Expected hitting times for random walks on quadrilateral graphs and their applications
• Extremal cover times for random walks on trees
• Extremal hitting times of trees with some given parameters
• Further results on the expected hitting time, the cover cost and the related invariants of graphs
• Hitting times for random walks on subdivision and triangulation graphs
• Hitting times for random walks on vertex-transitive graphs
• Hitting times, cover cost, and the Wiener index of a tree
• scientific article; zbMATH DE number 3934150 (Why is no real title available?)
• scientific article; zbMATH DE number 3514781 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 878897 (Why is no real title available?)
• Maximum hitting time for random walks on graphs
• Non-negative matrices and Markov chains.
• On hitting times of random walks on trees
• Random walks and the effective resistance of networks
• The electrical resistance of a graph captures its commute and cover times
• The hitting and cover times of random walks on finite graphs using local degree information
• The hitting time of random walk on unicyclic graphs

Cited in

(15)

• 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
• Finding hitting times in various graphs
• scientific article; zbMATH DE number 5629593 (Why is no real title available?)
• Maximum hitting time for random walks on graphs
• Hitting times for random walks on subdivision and triangulation graphs
• Simple random walks on wheel graphs
• Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters
• The hitting time of random walk on unicyclic graphs
• Hitting times for random walks on tricyclic graphs
• On the weighted reverse cover cost of trees and unicyclic graphs with given diameter
• Hitting times of random walks on unicyclic graphs with a given number of pendant vertices
• The hitting time of random walks on unicyclic graphs with a given maximum degree
• On the average hitting times of the squares of cycles
• Some further results on the maximal hitting times of trees with some given parameters

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053698)