Hitting times for random walks on tricyclic graphs

DOI10.1080/09728600.2023.2182244zbMATH Open1517.05161OpenAlexW4323044757MaRDI QIDQ6166239FDOQ6166239

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

Recommendations

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

zbMATH Keywords

hitting timerandom walkstricyclic graph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Maximum hitting time for random walks on graphs
• The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains
• Non-negative matrices and Markov chains. 2nd ed
• On hitting times of random walks on trees
• Title not available (Why is that?)
• Random walks and the effective resistance of networks
• An upper bound on the cover time for powers of graphs
• Extremal cover times for random walks on trees
• Hitting times for random walks on vertex-transitive graphs
• A Technique for Lower Bounding the Cover Time
• 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
• The expected hitting times for graphs with cutpoints.
• Cutpoint Decoupling and First Passage Times for Random Walks on Graphs
• Bounds on expected hitting times for a random walk on a connected graph
• Extremal cover cost and reverse cover cost of trees with given segment sequence
• Further results on the expected hitting time, the cover cost and the related invariants of graphs
• The hitting times of random walks on bicyclic graphs
• On the (reverse) cover cost of trees with some given parameters
• Hitting times for random walks on subdivision and triangulation graphs
• Expected hitting times for random walks on quadrilateral graphs and their applications
• The hitting time of random walk on unicyclic graphs
• Some further results on the maximal hitting times of trees with some given parameters
• Expected hitting times for a random walk on a connected graph
• Hitting and commute times in large graphs are often misleading
• 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
• Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost
• Extremal hitting times of trees with some given parameters
• On the fundamental matrix of finite state Markov chains, its eigensystem and its relation to hitting times
• Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters

Cited In (6)

• The hitting time of random walk on unicyclic graphs
• Expected hitting times for random walks on the \(k\)-triangle graph and their applications
• The hitting times of random walks on bicyclic graphs
• Title not available (Why is that?)
• Decomposing hitting times of walks on graphs into simpler ones
• Hitting times for random walks on subdivision and triangulation graphs

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)