On the Largest Component of the Random Graph at a Nearcritical Stage

The random graphs G(n, Pr(edge)=p), G(n, #edges=M) at the critical range p=(1+?n?1/3)/n and M=(n/2)(1+?n?1/3) are studied. The limiting distribution of the largest component size is determined.

[1]  Boris G. Pittel,et al.  On Tree Census and the Giant Component in Sparse Random Graphs , 1990, Random Struct. Algorithms.

[2]  Boris G. Pittel,et al.  Linear Probing: The Probable Largest Search Time Grows Logarithmically with the Number of Records , 1987, J. Algorithms.

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

[4]  J. Moon.  Counting labelled trees , 1970 .

[5]  I. S. Gradshteyn,et al.  Table of Integrals, Series, and Products , 1976 .

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

[7]  V. A. Voblyi.  Wright and Stepanov-Wright coefficients , 1987 .

[8]  V. E. BRITIKOV.  On the random graph structure near the critical point , 1991 .

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

[10]  Edward M. Wright,et al.  The number of connected sparsely edged graphs. III. Asymptotic results , 1980, J. Graph Theory.

[11]  Joel Spencer.  ENUMERATING GRAPHS AND BROWNIAN MOTION , 1997 .

[12]  B. Bollobás.  The evolution of random graphs , 1984 .

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

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

[15]  V. E. Stepanov.  On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$ , 1970 .

[16]  R. Eric O'Connor.  Canadian Mathematical Congress , 1945 .

[17]  Boris G. Pittel,et al.  Components of Random Forests , 1992, Combinatorics, Probability and Computing.

[18]  V. E. Stepanov.  Phase Transitions in Random Graphs , 1970 .

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

[20]  V. E. Stepanov.  On Some Features of the Structure of a Random Graph Near a Critical Point , 1988 .

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

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

[23]  Béla Bollobás,et al.  Random Graphs , 1985 .

[24]  V. F. Kolchin.  On the Behavior of a Random Graph Near a Critical Point , 1987 .

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

[26]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[27]  A. Erdélyi,et al.  Higher Transcendental Functions , 1954 .