Pages that link to "Item:Q3989014"
From MaRDI portal
The following pages link to A Technique for Lower Bounding the Cover Time (Q3989014):
Displaying 20 items.
- Cover times, blanket times, and majorizing measures (Q431644) (← links)
- Tight bounds for the cover time of multiple random walks (Q541669) (← links)
- Random walk covering of some special trees (Q809480) (← links)
- \(O(n \log n)\) procedures for tightening cover inequalities (Q1124826) (← links)
- A bound for the covering time of random walks on graphs (Q1198987) (← links)
- The electrical resistance of a graph captures its commute and cover times (Q1386176) (← links)
- Collecting coupons on trees, and the cover time of random walks (Q1386177) (← links)
- Exponential concentration of cover times (Q1748936) (← links)
- Bounds on the cover time (Q1823547) (← links)
- Lower bounds for covering times for reversible Markov chains and random walks on graphs (Q1825525) (← links)
- On an epidemic model on finite graphs (Q2180383) (← links)
- Does adding more agents make a difference? A case study of cover time for the rotor-router (Q2323346) (← links)
- Threshold limits for cover times (Q2638665) (← links)
- A lower bound for the coverability problem in acyclic pushdown VAS (Q2656343) (← links)
- A model of self‐avoiding random walks for searching complex networks (Q4648693) (← links)
- A tight lower bound on the cover time for random walks on graphs (Q4845080) (← links)
- Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time (Q5175230) (← links)
- Memory Efficient Anonymous Graph Exploration (Q5302040) (← links)
- The power of two choices for random walks (Q5886308) (← links)
- Hitting times for random walks on tricyclic graphs (Q6166239) (← links)
