The Cover Time of Random Digraphs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
The cover time of random geometric graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Multiple Random Walks and Interacting Particle Systems
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Efficient broadcast on random geometric graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
The cover time of deterministic random walks
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Multiple Random Walks in Random Regular Graphs
SIAM Journal on Discrete Mathematics
Random Walks with Look-Ahead in Scale-Free Random Graphs
SIAM Journal on Discrete Mathematics
The evolution of the cover time
Combinatorics, Probability and Computing
Cover times, blanket times, and majorizing measures
Proceedings of the forty-third annual ACM symposium on Theory of computing
The cover times of random walks on hypergraphs
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Viral processes by random walks on random regular graphs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Component structure of the vacant set induced by a random walk on a random graph
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Stationary distribution and cover time of random walks on random digraphs
Journal of Combinatorial Theory Series B
The cover times of random walks on random uniform hypergraphs
Theoretical Computer Science
| Hi-index | 0.00 |
We study the cover time of a random walk on the largest component of the random graph Gn,p. We determine its value up to a factor 1 + o(1) whenever np = c 1, c = O(lnn). In particular, we show that the cover time is not monotone for c = Θ(lnn). We also determine the cover time of the k-cores, k ≥ 2. © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2008