The cover time of sparse random graphs

Authors:
Colin Cooper;Alan Frieze
Affiliations:
Department of Mathematical and Computing Sciences, Goldsmiths College, London SW14 6NW, UK;Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213
Venue:
Random Structures & Algorithms - Proceedings from the 12th International Conference “Random Structures and Algorithms”, August1-5, 2005, Poznan, Poland
Year:
2007

Citing 0
Cited 10

On certain connectivity properties of the internet topology

Journal of Computer and System Sciences - Special issue on FOCS 2003
The cover time of random geometric graphs

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Expander properties and the cover time of random intersection graphs

Theoretical Computer Science
Tight bounds for the cover time of multiple random walks

Theoretical Computer Science
Stationary distribution and cover time of random walks on random digraphs

Journal of Combinatorial Theory Series B
Selected combinatorial properties of random intersection graphs

Algebraic Foundations in Computer Science
Expander properties and the cover time of random intersection graphs

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Opinion Fluctuations and Disagreement in Social Networks

Mathematics of Operations Research
A guided tour in random intersection graphs

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the cover time of a random walk on graphs Gε Gn,p when $p={c\log n\over n}, c1$. We prove that whp, the cover time, isasymptotic to $c\log({c \over c-1})n\log n$. ©WileyPeriodicals, Inc. Random Struct. Alg., 2007