On the Cover Time of Random Geometric Graphs
Authors:
- 1 January 2005
- book chapter
- Published by Springer Nature
- p. 677-689
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Efficient and robust query processing in dynamic environments using random walk techniques2004
- Gossip-based computation of aggregate information2004
- On the Cover Time for Random Walks on Random GraphsCombinatorics, Probability and Computing, 1998
- Robotic Exploration, Brownian Motion and Electrical ResistanceLecture Notes in Computer Science, 1998
- A technique for lower bounding the cover time1990
- The electrical resistance of a graph captures its commute and cover times1989
- Bounds on the cover timeJournal of Theoretical Probability, 1989
- Lower bounds for covering times for reversible Markov chains and random walks on graphsJournal of Theoretical Probability, 1989
- Covering Problems for Brownian Motion on SpheresThe Annals of Probability, 1988
- Random walks, universal traversal sequences, and the complexity of maze problems1979