A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs

DOI10.1137/090758982zbMath1223.05287OpenAlexW2080892432MaRDI QIDQ3008009

Cheng Peng, Randy Cogill

Publication date: 17 June 2011

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ebc468ce063c5c1a95c93a11e4a02d6a866d26d5

zbMATH Keywords

hitting timesrandom walks on graphsspanning trees

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graph algorithms (graph-theoretic aspects) (05C85) Random walks on graphs (05C81)

Related Items (10)

Further results on the expected hitting time, the cover cost and the related invariants of graphs ⋮ Finding hitting times in various graphs ⋮ Hitting times for random walks on tricyclic graphs ⋮ Hitting times for random walks on subdivision and triangulation graphs ⋮ 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 ⋮ The hitting times of random walks on bicyclic graphs ⋮ Expected hitting times for random walks on the \(k\)-triangle graph and their applications ⋮ The hitting time of random walk on unicyclic graphs ⋮ Dumbbell graphs with extremal (reverse) cover cost

This page was built for publication: A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs