The evolution of the mixing rate of a simple random walk on the giant component of a random graph

Random Structures and Algorithms

Volumn 33, Issue 1, 2008, Pages 68-86

  Fountoulakis, N ^a   Reed, B A ^b,c  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b MCGILL UNIVERSITY   (Canada)

^c CNRS   (France)

Author keywords

Giant component; Mixing time; Random graph

Indexed keywords

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

References (23)

1. D. J. Aldous and J. A. Fill, Reversible Markov chains and random walks on graphs, book preprint, Available at, http://www.stat.berkeley.edu/∼aldous/ RWG/book.html.
2. E. A. Bender and E. R. Canfield, The asymptotic number of labelled graphs with given degree sequences, J Comb Theory Ser A 24 (1978), 296-307.
3. I. Benjamini, G. Kozma, and N. Wormald, The mixing time of the giant component of a random graph, preprint.
4. I. Benjamini and E. Mossel, On the mixing time of a simple random walk on the super critical percolation cluster, Probab Theory Relat Fields 125 (2003), 408-420.
5. B. Bollobás, A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, Eur J Comb 1 (1980), 311-316.
6. B. Bollobás, Random graphs, Cambridge University Press, Cambridge, 2001.
7. F. R. Chung and L. Lu, The diameter of sparse random graphs, Ad Appl Math 26 (2001), 257-279.
8. W. Feller, An introduction to probability theory and its applications I, 3rd edition, Wiley, 1968, xviii+509 p.
9. D. Fernholz and V. Ramachandran, The diameter of sparse random graphs, Random Struct Algorithms 31 (2007), 482-516.
10. N. Fountoulakis and B. A. Reed, Faster mixing and small bottlenecks, Probab Theory Relat Fields 137 (2007), 475-486.
11. N. Fountoulakis and B. A. Reed, The mixing time of a random walk on the giant component of a (not too) sparse random graph, in preparation.
12. N. Fountoulakis and B. A. Reed, The sampling width of Markov chains, in preparation.
13. M. Hildebrand, Random walks on random simple graphs, Random Struct Algorithms 8 (1996), 301-318.
14. S. Janson, T. Luczak, and A. Rucinski, Random graphs, Wiley, New York, 2000.
15. M. Jerrum and A. Sinclair, Conductance and the rapid mixing property for Markov chains: the approximation of the permanent resolved, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988, pp. 235-244.
16. L. Lovász and R. Kannan, Faster mixing via average conductance, Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, 282-287.
17. L. Lovász and P. Winkler, Mixing Times, In D. Aldous and J. Propp, editors, Microsurveys in discrete probability, DIMACS series in discrete math, and theoretical computer science 41, Amer. Math. Soc., Providence RI, 1998, pp. 85-134.
18. L. Lovász and P. Winkler, Mixing of random walks and other diffusions on a graph, In P. Rowlinson, editor, Surveys in Combinatorics, 1995, pp. 119-154.
19. 1/2), Combinatorica 11 (1991), 369-382.
20. A. Nachmias and Y. Peres, Critical random graphs: diameter and mixing time, preprint Available at, http://xxx.lanl.gov/abs/math/0701316.
21. B. Pittel, On tree census and the giant component in sparse random graphs, Random Struct Algorithms 1 (1990), 311-342.
22. B. Pittel, J. H. Spencer, and N. C. Wormald, Sudden emergence of a giant k-core in a random graph, J Combin Theory Ser B 67 (1996), 111-151.
23. B. A. Reed, Randomly growing your neighbourhood, Submitted.