The expected hitting times for graphs with cutpoints.

DOI10.1016/j.spl.2003.08.012zbMath1113.60046OpenAlexW2041002160MaRDI QIDQ1423039

Hai-Yan Chen, Fu Ji Zhang

Publication date: 14 February 2004

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2003.08.012

zbMATH Keywords

Random walksEffective resistanceThe expected hitting time

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50)

Related Items

Some further results on the maximal hitting times of trees with some given parameters ⋮ The access time of random walks on trees with given partition ⋮ Decomposing hitting times of walks on graphs into simpler ones ⋮ On the moments of hitting times for random walks on trees ⋮ Hitting times for random walks on tricyclic graphs ⋮ On the first passage time of a simple random walk on a tree ⋮ On the (reverse) cover cost of trees with some given parameters ⋮ The generating functions of hitting times for random walk on trees ⋮ Hitting times for random walks on subdivision and triangulation graphs ⋮ Expected hitting times for random walks on quadrilateral graphs and their applications ⋮ Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost ⋮ On hitting times of random walks on trees ⋮ Extremal cover cost and reverse cover cost of trees with given segment sequence ⋮ Expected hitting times for random walks on the \(k\)-triangle graph and their applications ⋮ Dumbbell graphs with extremal (reverse) cover cost

Cites Work

• Unnamed Item
• Unnamed Item
• Random walks and the effective resistance of networks
• Random walks on highly symmetric graphs
• Random walks on the triangular prism and other vertex-transitive graphs
• A note on expected hitting times for birth and death chains
• Random walks on edge-transitive graphs. II
• Random walks on edge transitive graphs
• Hitting times for random walks on vertex-transitive graphs
• Potential Theory on Distance-Regular Graphs
• Cutpoint Decoupling and First Passage Times for Random Walks on Graphs