The giant component: The golden anniversary

Notices of the American Mathematical Society

Volumn 57, Issue 6, 2010, Pages 720-724

  Spencer, Joel ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77954742440     PISSN: 00029920     EISSN: 10889477     Source Type: Journal    
DOI: None     Document Type: Article

References (18)

1. D. Achlioptas, R. M. D'Souza and J. Spencer, Explosive percolation in random networks, Science 323 (5920), 1453-1455, 2009.
2. David Aldous, Brownian excursions, critical random graphs, and the multiplicative coalescent, Annals of Probability 25 (1997), 812-854.
3. N. Alon and J. Spencer, The Probabilistic Method, 3rd ed., John Wiley, 2009.
4. Béla Bollobás, Random Graphs, 2nd ed., Cambridge University Press. 2001.
5. Béla Bollobás, Christian Borgs, Jennifer Chayes, Jeong Han Kim, and David B. Wilson, The scaling window of the 2-SAT transition, Random Structures and Algorithms 21 (2002), 182-195.
6. Fan Chung, Paul Horn, and Lincoln Lu, The giant component in a random subgraph of a given graph, Proceedings of the 6th Workshop on Algorithms and Models for the Web-Graph (WAW2009), Lecture Notes in Computer Science 5427, 38-49.
7. Paul Erdoos and Alfréd Rényi, On the evolution of random graphs, Magyar Tud. Akad. Mat. Kutató Int. Közl. 5 (1960), 17-61.
8. Paul Erdos and Tomasz Łuczak, Changes of leadership in a random graph process, Random Structures and Algorithms 5 (1994), 243-252.
9. Juliana Freire, Analysis techniques for nudged random graphs, Ph.D. Thesis, Courant Institute, 2009.
10. G. Grimmett, Percolation, 2nd ed., Springer-Verlag, 1999.
11. S. Janson and M. Luczak, A new approach to the giant component problem, Random Structures and Algorithms 34 (2008), 197-216.
12. Svante Janson, Tomasz Łuczak, Donald Knuth, and Boris Pittel, The birth of the giant component, Random Structures and Algorithms 3 (1993), 233-358.
13. Svante Janson, Tomasz Łuczak, and Andrzej Rucinski, Random Graphs, John Wiley, 2000.
14. Milyun Kang and T. Seierstad, The critical phase for random graphs with a given degree sequence, Combin. Probab. Comput. 17 (2008), 67-86.
15. Malwina Luczak and Tomasz Łuczak, The phase transition in the cluster-scaled model of a random graph, Random Structures and Algorithms 28 (2006), 215-246.
16. Tomasz Łuczak and John Wierman, The chromatic number of randomgraphs at the double jump threshold, Combinatorica 9 (1989), 39-49.
17. M. Molloy and B. Reed, The size of the largest component of a random graph on a fixed degree sequence, Combin. Probab. Comput. 7 (1998), 295-306.
18. Asaf Nachmias, Mean-field conditions for percolation on finite graphs, GAFA (to appear).