The cover time of the giant component of a random graph

Random Structures and Algorithms

Volumn 32, Issue 4, 2008, Pages 401-439

  Cooper, Colin ^a   Frieze, Alan ^b  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Cover time; Giant component; Random graphs

Indexed keywords

EID: 52349103151     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20201     Document Type: Article

References (20)

1. D. Aldous and J. Fill, Reversible Markov Chains and Random Walks on Graphs, http://stat-www.berkeley.edu/pub/users/aldous/RWG/book.html.
2. 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, Proc 20th IEEE Foundations Comput Sci, 1979, pp. 218-223.
3. B. Bollobás, Random graphs, 2nd ed, Cambridge University Press, Cambridge, 2001.
4. B. Bollobás, A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, Eur J Combinatorics 1 (1980), 311-316.
5. J. Brown and R. Churchill, Complex variables and applications, 6th ed, McGraw-Hill, New York, 1996.
6. C. Cooper and A. M. Frieze, The cover time of sparse random graphs, Proc SODA, 2003.
7. C. Cooper and A. M. Frieze, The cover time of random regular graphs, SIAM J Discrete Math 18 (2005), 728-740.
8. C. Cooper and A. M. Frieze, The cover time of the preferential attachment graph, J Combin Theory B 97 (2007), 269-290.
9. C. Cooper, The cores of random hypergraphs with a given degree sequence, Random Struct Algorithms 25 (2004), 353-375.
10. P. G. Doyle and J. L. Snell, Random walks and electrical networks, Carus Mathematical Monograph 22, AMA, Washington, D.C., 1984.
11. P. Erdos and A. Rényi, The evolution of random graphs, Publ Math Inst Hungar Acad Sci 5 (1960), 17-61.
12. U. Feige, A tight upper bound for the cover time of random walks on graphs, Random Struct Algorithms 6 (1995), 51-54.
13. U. Feige, A tight lower bound for the cover time of random walks on graphs, Random Struct Algorithms 6 (1995), 433-438.
14. W. Feller, An introduction to probability theory, Vol. I, 2nd edition, Wiley, New York, 1960.
15. M. Jerrum and A. Sinclair, "The Markov chain Monte Carlo method: an approach to approximate counting and integration", Approximation Algorithms for NP-hard Problems, D. Hochbaum (Editor), PWS, 1996, pp. 482-520.
16. J. Jonasson, On the cover time of random walks on random graphs, Combinator Probab Comput 7 (1998), 265-279.
17. B. Pittel, On tree census and the giant component in sparse random graphs, Random Struct Algorithms 1.3 (1990), 311-342.
18. B. Pittel, J. Spencer, and N. Wormald, Sudden emergence of a giant k-core in a random graph, J Combinator Theory B 67 (1996), 111-151.
19. H. Wilf, Generatingfunctionology, Academic Press, San Diego, 1990.
20. D. Zuckerman, On the time to traverse all edges of a graph, Inform Process Lett 38 (1991), 335-337.