The Cover Time of Random Digraphs

Authors:
Colin Cooper;Alan Frieze
Affiliations:
Department of Computer Science, King's College, University of London, London WC2R 2LS, UK;Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh PA15213, USA
Venue:
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
Year:
2007

Citing 7
Cited 0

A tight upper bound on the cover time for random walks on graphs

Random Structures & Algorithms
A tight lower bound on the cover time for random walks on graphs

Random Structures & Algorithms
The cover time of sparse random graphs.

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The Cover Time of Random Regular Graphs

SIAM Journal on Discrete Mathematics
The cover time of the preferential attachment graph

Journal of Combinatorial Theory Series B
Random walks, universal traversal sequences, and the complexity of maze problems

SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
The cover time of the giant component of a random graph

Random Structures & Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the cover time of a random walk on the random digraph Dn,pwhen $p=\frac{d\log n}{n}, d1$. We prove that whpthe cover time is asymptotic to .