The hitting times of random walks on bicyclic graphs
type: Item
instance of: scholarly article
title: The hitting times of random walks on bicyclic graphs
zbMATH Open document ID: 1479.05332
author: Xiaomin Zhu
author: Xiao-Dong Zhang
published in: Graphs and Combinatorics
publication date: 2021-11-30T00:00:00Z
Mathematics Subject Classification ID: 05C81
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 60G50
Mathematics Subject Classification ID: 60J10
zbMATH DE Number: 7435728
zbMATH Keywords: hitting time
zbMATH Keywords: bicyclic graph
zbMATH Keywords: random walk
MaRDI profile type: Publication
full work available at URL: s00373-021-02360-3
OpenAlex ID: W3178620082
cites work: Hitting times for random walks on vertex-transitive graphs
cites work: Q4398864
cites work: Extremal cover times for random walks on trees
cites work: Maximum hitting time for random walks on graphs
cites work: Chung-Yau Invariants and Graphs with Symmetric Hitting Times
cites work: The electrical resistance of a graph captures its commute and cover times
cites work: Hitting times for random walks on subdivision and triangulation graphs
cites work: Asymptotic probabilities of misclassification of two discriminant functions in cases of high dimensional data
cites work: Discrete Green's functions
cites work: A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs
cites work: Q3706275
cites work: Hitting Times, Cover Cost, and the Wiener Index of a Tree
cites work: Expected hitting times for random walks on quadrilateral graphs and their applications
cites work: Further results on the expected hitting time, the cover cost and the related invariants of graphs
cites work: The hitting and cover times of random walks on finite graphs using local degree information
cites work: Q4094202
cites work: Cutpoint Decoupling and First Passage Times for Random Walks on Graphs
cites work: Expected hitting times for a random walk on a connected graph
cites work: Q4878667
cites work: Bounds on expected hitting times for a random walk on a connected graph
cites work: On hitting times of random walks on trees
cites work: Decomposing hitting times of walks on graphs into simpler ones
cites work: Non-negative matrices and Markov chains.
cites work: Random walks and the effective resistance of networks
cites work: Discrete Green's functions and random walks on graphs
cites work: An explicit formula of hitting times for random walks on graphs
cites work: Extremal hitting times of trees with some given parameters
cites work: The hitting time of random walk on unicyclic graphs
DOI: 10.1007/S00373-021-02360-3
Recommended article: Hitting times for random walks on tricyclic graphs
Recommended article: The hitting time of random walk on unicyclic graphs
Recommended article: Hitting times for random walks on vertex-transitive graphs
Recommended article: An explicit formula of hitting times for random walks on graphs
Recommended article: Q3976601
Recommended article: Bounds on expected hitting times for a random walk on a connected graph
Recommended article: Maximum hitting time for random walks on graphs
Recommended article: Hitting times for random walks on subdivision and triangulation graphs
Recommended article: On hitting times for a simple random walk on dense Erdös-Rényi random graphs
Recommended article: Expected hitting times for a random walk on a connected graph
description: scientific article; zbMATH DE number 7435728