On the largest component of the random graph at a nearcritical stage

Journal of Combinatorial Theory. Series B

Volumn 82, Issue 2, 2001, Pages 237-269

  Pittel, Boris ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

Random graph; component; limiting distribution

Indexed keywords

EID: 0035402347     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.2000.2033     Document Type: Article

References (33)

1. Aldous D. J. Brownian excursions, critical random graphs and the multiplicative coalescent. Ann. Probab. 25:1997;812-854.
2. Bagaev G. N. Sluchainye grafy so stepen'iu sviznosti 2. Discretnyi Analiz. 22:1973;3-14.
3. Bagaev G. N., Dmitriev E. F. Perechislenie sviaznykh otmechennykh dvudol'nykh grafov. Dokl. Akad. Nauk BSSR. 28:1984;1061-1063.
4. Bateman H., Erdélyi A. Higher Transcendental Functions I. 1953;Mc Graw-Hill, New York.
5. Bender E. A., Canfield E. R., McKay B. D. The asymptotic number of labeled connected graphs with a given number of vertices and edges. Random Structures Algorithms. 1:1990;127-169.
6. Bollobás B. The evolution of random graphs. Trans. Amer. Math. Soc. 286:1984;257-274.
7. Bollobás B. The evolution of sparse random graphs. Graph Theory and Combinatorics (Proc. Cambridge Combinatorial Conf. in Honour of Paul Erdos). 1984;Academic Press, San Diego. p. 35-57.
8. Bollobás B. Random Graphs. 1985;Academic Press, San Diego.
9. Britikov V. E. On the random graph structure near the critical point. Discrete Math. Appl. 1:1991;301-309.
10. Durrett R. Probability: Theory and Examples. 1996;Duxbury Press, Wadsworth/Belmont.
11. Erdos P., Rényi A. On the evolution of random graphs. Tud. Akad. Mat. Kut. Intéz Közl. 5:1960;17-61.
12. Gradshteyn I. S., Ryzhik I. M. Table of Integrals, Series, and Products. 2000;Academic Press, San Diego.
13. Ibragimov I. A., Linnik Y. V. Independent and Stationary Random Variables. 1965;Nauka, Moscow.
14. Janson S., Knuth D. E., Luczak T., Pittel B. The birth of the giant component. Random Structures Algorithms. 4:1993;233-358.
15. Kolchin V. F. On the behaviour of a random graph near a critical point. Theory Probab. Appl. 31:1986;439-451.
16. T. Luczak, On the equivalence of two basic models of random graphs, in Random Graphs '87, Proceedings of the 3rd International Seminar on Random Graphs and Probabilistic Methods in Combinatorics, pp. 151-157, Wiley, New York, 1990.
17. Luczak T. Component behavior near the critical point of the random graph process. Random Structures Algorithms. 1:1990;287-310.
18. Luczak T., Pittel B. Components of random forests. Combinatorics, Probab. Comput. 1:1992;35-52.
19. Luczak T., Pittel B., Wierman J. C. The structure of a random graph at the point of the phase transition. Trans. Amer. Math. Soc. 341:1994;721-748.
20. Moon J. W. Counting Labelled Trees. Canadian Mathematical Congress. 1970;Clowes and Sons, London and Beccles.
21. Pittel B. Linear probing: the probable largest search time grows logarithmically with the number of records. J. Algorithms. 8:1987;236-249.
22. Pittel B. On tree census and the giant component in sparse random graphs. Random Structures Algorithms. 1:1990;311-342.
23. Rényi A. On connected graphs I. Publ. Math. Inst. Hungarian Acad. Sci. 4:1959;385-388.
24. J. Spencer, A query circulated in Summer of 2000.
25. Spencer J. Enumerating graphs and Brownian motion. Comm. Pure Appl. Math. 50:1997;291-294.
26. Stanley R. P. Enumerative Combinatorics II. 1999;Cambridge University Press, Cambridge.
27. Stepanov V. E. Phase transitions in random graphs. Theory Probab. Appl. 15:1970;187-203.
28. m(t). Theory Probab. Appl. 15:1970;55-67.
29. Stepanov V. E. On some features of the structure of a random graph near a critical point. Theory Probab. Appl. 32:1988;573-594.
30. Voblyi V. A. Wright and Stepanov-Wright coefficients. Math. Notes. 42:1987;969-974.
31. Wilf H. S. Generatingfunctionology. 1994;Academic Press, New York.
32. Wright E. M. The number of connected sparsely edged graphs. J. Graph Theory. 1:1977;317-330.
33. Wright E. M. The number of connected sparsely edged graphs. III: Asymptotic results. J. Graph Theory. 4:1980;393-407.