Expected hitting times for a random walk on a connected graph

DOI10.1016/0012-365X(86)90030-0zbMath0599.60012MaRDI QIDQ1080258

Gregory F. Lawler

Publication date: 1986

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

zbMATH Keywords

undirected connected graph

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)

Related Items

Further results on the expected hitting time, the cover cost and the related invariants of graphs ⋮ Maximum hitting time for random walks on graphs ⋮ The access time of random walks on trees with given partition ⋮ Hitting times for random walks on tricyclic graphs ⋮ Bounds on expected hitting times for a random walk on a connected graph ⋮ Hitting times for random walks on subdivision and triangulation graphs ⋮ Slowdown for the geodesic-biased random walk ⋮ 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 ⋮ On a Result of Aleliunas et al. Concerning Random Walks on 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

Cites Work

• Finite Continuous Time Markov Chains