The cover time of sparse random graphs

Random Structures and Algorithms

Volumn 30, Issue 1-2, 2007, Pages 1-16

  Cooper, Colin ^a   Frieze, Alan ^b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Cover time; Random graphs; Random walk

Indexed keywords

EID: 33846661518     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20151     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.", In Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, 1979, pp. 218-223.
2. B. Bollobás, Random graphs, 2nd ed., Cambridge University Press, Cambridge, 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. A. Z. Broder and A. Karlin, Bounds on the cover time, J Theor Probab 2 (1989), 101-120.
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 Struct Algorithms 6 (1995), 51-54.
7. U. Feige, A tight lower bound for the cover time of random walks on graphs, Random Struct Algorithms 6 (1995), 433-438.
8. S. Janson, T. Luczak, and A. Rucinski, Random graphs, Wiley, New York, NY, 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 (Editor), PWS, Boston, MA, 1996, pp. 482-520.
10. J. Jonasson, On the cover time of random walks on random graphs, Combinatorics Probab Comput 7 (1998), 265-279.