The cover time of sparse random graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 140-147

  Cooper, Colin ^a   Frieze, Alan ^b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; CALCULATIONS; GRAPH THEORY; MARKOV PROCESSES; METHOD OF MOMENTS; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; THEOREM PROVING;

COUPON COLLECTOR PROBLEM; RANDOM WALK; WEB GRAPH;

ALGORITHMS;

EID: 0038077580     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovász and C. Rackoff, Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science (1979) 218-223.
2. B. Bollobás, Random graphs (Second edition), Cambridge University Press (2001).
3. B. Bollobás, T. Fenner and A.M. Frieze, An algorithm for finding Hamilton paths and cycles in random graphs, Combinatorica 7 (1987) 327-341.
4. C. Cooper and A.M. Frieze, Crawling on web graphs, to appear in Proceedings of STOC 2002.
5. P. Erdös and A. Rényi, On random graphs I, Publ. Math. Debrecen 6 (1959) 290-297.
6. U. Feige, A tight upper bound for the cover time of random walks on graphs, Random structures and algorithms 6 (1995) 51-54.
7. U. Feige, A tight lower bound for the cover time of random walks on graphs, Random structures and algorithms 6 (1995) 433-438.
8. S. Janson, T. Luczak and A. Ruciński, Random graphs, Wiley (2000).
9. M. Jerrum and A. Sinclair, The Markov chain Monte Carlo method: an approach to approximate counting and integration. In Approximation Algorithms for NP-hard Problems. (D. Hochbaum ed.) PWS (1996) 482-520.
10. J. Jonasson, On the cover time of random walks on random graphs, Combinatorics, Probability and Computing, 7 (1998), 265-279.