Expected hitting and cover times of random walks on some special graphs
From MaRDI portal
Publication:4288887
DOI10.1002/rsa.3240050116zbMath0792.60065MaRDI QIDQ4288887
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
graphs; random walk; effective resistance; expected hitting and cover times; upper and lower bounds for the expected cover times
05C80: Random graphs (graph-theoretic aspects)
60G50: Sums of independent random variables; random walks
Related Items
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, A stochastic process on a network with connections to Laplacian systems of equations, On the mean and variance of cover times for random walks on graphs, Expected hitting times for random walks on the \(k\)-triangle graph and their applications, Finding hitting times in various graphs
Cites Work