A Technique for Lower Bounding the Cover Time
From MaRDI portal
Publication:3989014
DOI10.1137/0405007zbMATH Open0743.60068OpenAlexW2138144746MaRDI QIDQ3989014FDOQ3989014
Authors: David Zuckerman 
Publication date: 28 June 1992
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/019c97e89307b3e08793cc21c797169674fdd2e1
Recommendations
stationary distributionvertex transitiveexpected hitting timescovering times of random walks on graphs
Cited In (20)
- A tight lower bound on the cover time for random walks on graphs
- The electrical resistance of a graph captures its commute and cover times
- On an epidemic model on finite graphs
- How to Design a Linear Cover Time Random Walk on a Finite Graph
- Does adding more agents make a difference? A case study of cover time for the rotor-router
- Tight bounds for the cover time of multiple random walks
- \(O(n \log n)\) procedures for tightening cover inequalities
- A lower bound for the coverability problem in acyclic pushdown VAS
- Exponential concentration of cover times
- Memory Efficient Anonymous Graph Exploration
- Hitting times for random walks on tricyclic graphs
- Lower bounds for covering times for reversible Markov chains and random walks on graphs
- Random walk covering of some special trees
- Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time
- A model of self‐avoiding random walks for searching complex networks
- Bounds on the cover time
- Cover times, blanket times, and majorizing measures
- A bound for the covering time of random walks on graphs
- The power of two choices for random walks
- Threshold limits for cover times
This page was built for publication: A Technique for Lower Bounding the Cover Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3989014)
