The critical random graph, with martingales

[1]  Svante Janson,et al.  A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution , 2007, Comb. Probab. Comput..

[2]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[3]  Alex D. Scott,et al.  Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time , 2006, Combinatorics, Probability and Computing.

[4]  J. Spencer,et al.  Random subgraphs of finite graphs: I. The scaling window under the triangle condition , 2004, Random Struct. Algorithms.

[5]  Boris G. Pittel,et al.  On the Largest Component of the Random Graph at a Nearcritical Stage , 2001, J. Comb. Theory, Ser. B.

[6]  S. Janson,et al.  Random Graphs: Janson/Random , 2000 .

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

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

[9]  S. Janson,et al.  The Birth of the Giant Component , 1993, Random Struct. Algorithms.

[10]  Paul Erdös,et al.  The Giant Component 1960-1993 , 1993, Random Struct. Algorithms.

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

[12]  David Williams,et al.  Probability with Martingales , 1991, Cambridge mathematical textbooks.

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

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

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

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

[17]  Andrzej Rucinski,et al.  Random Graphs , 2018, Foundations of Data Science.

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

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

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