The cover time of sparse random graphs.

Authors:
Colin Cooper;Alan Frieze
Affiliations:
Goldsmiths College, London, UK;Carnegie Mellon University, Pittsburgh
Venue:
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2003

The cover time of two classes of random graphs

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The power of choice in random walks: an empirical study

Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
The cover time of the preferential attachment graph

Journal of Combinatorial Theory Series B
On the cover time and mixing time of random geometric graphs

Theoretical Computer Science
The power of choice in random walks: An empirical study

Computer Networks: The International Journal of Computer and Telecommunications Networking
Quasirandom rumor spreading

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Many random walks are faster than one

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Distance graphs: from random geometric graphs to Bernoulli graphs and between

Proceedings of the fifth international workshop on Foundations of mobile computing
DANTE: A Self-adapting Peer-to-Peer System

Agents and Peer-to-Peer Computing
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
On the cover time of random geometric graphs

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Hi-index	0.00

We study the cover time of a random walk on graphs G ∈ Gn, p when p = c log n/n, c whpthe cover time is asymptotic to c log (c/c--1) n log n.