Expected cover times of random walks on symmetric graphs
From MaRDI portal
Publication:1194485
DOI10.1007/BF01060439zbMATH Open0754.60077OpenAlexW2001528257MaRDI QIDQ1194485FDOQ1194485
Authors: José Luis Palacios 
Publication date: 27 September 1992
Published in: Journal of Theoretical Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01060439
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50)
Cites Work
- Title not available (Why is that?)
- Covering problems for Markov chains
- The electrical resistance of a graph captures its commute and cover times
- Random walks on highly symmetric graphs
- On the cover time of random walks on graphs
- An introduction to covering problems for random walks on graphs
- On a Result of Aleliunas et al. Concerning Random Walks on Graphs
Cited In (11)
- Bounds on expected hitting times for a random walk on a connected graph
- A note on the last new vertex visited by a random walk
- Random Walks on Regular and Irregular Graphs
- How to Design a Linear Cover Time Random Walk on a Finite Graph
- On hitting and cover times via electric networks
- Random walks on edge transitive graphs
- On the cover time of random walks on graphs
- Expected hitting and cover times of random walks on some special graphs
- Covering with blocks in the non-symmetric case
- On the Last New Vertex Visited by a Random Walk in a Directed Graph
- On a Result of Aleliunas et al. Concerning Random Walks on Graphs
This page was built for publication: Expected cover times of random walks on symmetric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1194485)
