Expected hitting and cover times of random walks on some special graphs

DOI10.1002/rsa.3240050116zbMath0792.60065OpenAlexW2070900938MaRDI QIDQ4288887

José Luis Palacios

Publication date: 14 July 1994

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240050116

zbMATH Keywords

graphsrandom walkeffective resistanceexpected hitting and cover timesupper and lower bounds for the expected cover times

Mathematics Subject Classification ID

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

Related Items (7)

On the mean and variance of cover times for random walks on graphs ⋮ Finding hitting times in various graphs ⋮ A stochastic process on a network with connections to Laplacian systems of equations ⋮ 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 ⋮ Expected hitting times for random walks on the \(k\)-triangle graph and their applications

Cites Work

• The Editor's Corner: The White Screen Problem

This page was built for publication: Expected hitting and cover times of random walks on some special graphs