A Technique for Lower Bounding the Cover Time
From MaRDI portal
(Redirected from Publication:3989014)
Recommendations
Cited in
(21)- A model of self-avoiding random walks for searching complex networks
- 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
- Tight bounds for the cover time of multiple random walks
- Does adding more agents make a difference? A case study of cover time for the rotor-router
- How to Design a Linear Cover Time Random Walk on a Finite Graph
- \(O(n \log n)\) procedures for tightening cover inequalities
- A lower bound for the coverability problem in acyclic pushdown VAS
- Cover time and broadcast time
- 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
- Bounds on the cover time
- Cover times, blanket times, and majorizing measures
- A bound for the covering time of random walks on graphs
- Random walks which prefer unvisited edges: exploring high girth even degree expanders in linear time
- 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)
