Problems from the Discrete to the Continuous pp 109-131 | Cite as
The Phase Transition Concerning the Giant Component in a Sparse Random Graph: A Theorem of Erdős and Rényi
Chapter
First Online:
Abstract
Let \(G_{n}(p_{n}) = ([n],E_{n}(p_{n}))\) denote the Erdős–Rényi graph of size n which was introduced in Chap. 9. As in Chap. 9, the generic notation P for probability and E for expectation will be used in this chapter.
Keywords
Random Graph Probability Generate Function Extinction Probability Extinction Time Graph Size
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
- 2.Alon, N., Spencer, J.: The Probabilistic Method, 3rd edn. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, Hoboken (2008)CrossRefMATHGoogle Scholar
- 7.Athreya, K., Ney, P.: Branching Processes, reprint of the 1963 original [Springer, Berlin]. Dover Publications, Inc., Mineola (2004)Google Scholar
- 8.Bollobás, B.: The evolution of random graphs. Trans. Am. Math. Soc. 286, 257–274 (1984)CrossRefMATHGoogle Scholar
- 9.Bollobás, B.: Modern Graph Theory. Graduate Texts in Mathematics, vol. 184. Springer, New York (1998)Google Scholar
- 13.Dembo, A., Zeitouni, O.: Large Deviations Techniques and Applications, 2nd edn. Springer, New York (1998)CrossRefMATHGoogle Scholar
- 16.Durrett, R.: Probability: Theory and Examples, 4th edn. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, Cambridge (2010)CrossRefGoogle Scholar
- 18.Erdős, P., Rényi, A.: On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl 5, 17–61 (1960)Google Scholar
- 24.Harris, T.: The Theory of Branching Processes, corrected reprint of the 1963 original [Springer, Berlin]. Dover Publications, Inc., Mineola (2002)Google Scholar
Copyright information
© Springer International Publishing Switzerland 2014