Component sizes of the random graph outside the scaling window

We provide simple proofs describing the behavior of the largest com- ponent of the Erd} os-R enyi random graph G(n; p) outside of the scaling window, p = 1+ (n) n where (n) ! 0 but (n)n 1=3 ! 1.

[1]  Y. Peres,et al.  The critical random graph, with martingales , 2005, math/0512201.

[2]  David Aldous,et al.  Brownian excursions, critical random graphs and the multiplicative coalescent , 1997 .

[3]  B. Pittel,et al.  The structure of a random graph at the point of the phase transition , 1994 .

[4]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[5]  R. Durrett.  Probability: Theory and Examples , 1993 .

[6]  Tomasz Łuczak.  Component behavior near the critical point of the random graph process , 1990 .

[7]  Brendan D. McKay,et al.  The Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and Edges , 1990, Random Struct. Algorithms.

[8]  Richard M. Karp,et al.  The Transitive Closure of a Random Digraph , 1990, Random Struct. Algorithms.

[9]  Tomasz Luczak,et al.  Component Behavior Near the Critical Point of the Random Graph Process , 1990, Random Struct. Algorithms.

[10]  Anders Martin-Löf,et al.  Symmetric sampling procedures, general epidemic processes and their threshold limit theorems , 1986, Journal of Applied Probability.

[11]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[12]  Edward M. Wright,et al.  The number of connected sparsely edged graphs , 1977, J. Graph Theory.

[13]  I. Kovalenko.  An introduction to probability theory and its applications. Vol. II , 1968 .

[14]  F. Spitzer.  A Combinatorial Lemma and its Application to Probability Theory , 1956 .

[15]  W. Feller.  An Introduction to Probability Theory and Its Applications , 1959 .

[16]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .