Hitting times for random walks on tricyclic graphs

DOI10.1080/09728600.2023.2182244MaRDI QIDQ6166239zbMATHOpenAlexFDO

Authors Xiaomin Zhu, Xu Yang

Publication date 2 August 2023

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

hitting timerandom walkstricyclic graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random walks on graphs (05C81)

Recommendations

• The hitting times of random walks on bicyclic graphs
• The hitting time of random walk on unicyclic graphs
• scientific article; zbMATH DE number 5629593
• Finding hitting times in various graphs
• Maximum hitting time for random walks on graphs

Cites work

• scientific article; zbMATH DE number 3145626 (Why is no real title available?)
• scientific article; zbMATH DE number 3934150 (Why is no real title available?)
• scientific article; zbMATH DE number 878897 (Why is no real title available?)
• A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs
• A Technique for Lower Bounding the Cover Time
• An upper bound on the cover time for powers of graphs
• 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
• Expected hitting times for a random walk on a connected graph
• Expected hitting times for random walks on quadrilateral graphs and their applications
• Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters
• Extremal cover cost and reverse cover cost of trees with given segment sequence
• Extremal cover times for random walks on trees
• Extremal hitting times of trees with some given parameters
• Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost
• Further results on the expected hitting time, the cover cost and the related invariants of graphs
• Hitting and commute times in large random neighborhood 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
• Maximum hitting time for random walks on graphs
• Non-negative matrices and Markov chains. 2nd ed
• On hitting times of random walks on trees
• On the (reverse) cover cost of trees with some given parameters
• On the fundamental matrix of finite state Markov chains, its eigensystem and its relation to hitting times
• Random walks and the effective resistance of networks
• Some further results on the maximal hitting times of trees with some given parameters
• The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains
• The expected hitting times for graphs with cutpoints.
• The hitting and cover times of random walks on finite graphs using local degree information
• The hitting time of random walk on unicyclic graphs
• The hitting times of random walks on bicyclic graphs

Cited in

(8)

• Some further results on the maximal hitting times of trees with some given parameters
• Finding hitting times in various graphs
• The hitting time of random walk on unicyclic graphs
• The hitting times of random walks on bicyclic graphs
• scientific article; zbMATH DE number 5629593 (Why is no real title available?)
• Hitting times for random walks on subdivision and triangulation graphs
• Decomposing hitting times of walks on graphs into simpler ones
• Expected hitting times for random walks on the \(k\)-triangle graph and their applications

This page was built for publication: Hitting times for random walks on tricyclic graphs

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