The structure of a random graph at the point of the phase transition

Authors:
Tomasz Łuczak, Boris Pittel and John C. Wierman

Journal:
Trans. Amer. Math. Soc. **341** (1994), 721-748

MSC:
Primary 05C80; Secondary 60C05

DOI:
https://doi.org/10.1090/S0002-9947-1994-1138950-5

MathSciNet review:
1138950

Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Consider the random graph models and with and . For define an -component of a random graph as a component which has exactly more edges than vertices. Call an -component with a complex component. For both models, we show that when is constant, the expected number of complex components is bounded, almost surely (a.s.) each of these components (if any exist) has size of order , and the maximum value of is bounded in probability. We prove that a.s. the largest suspended tree in each complex component has size of order , and deletion of all suspended trees results in a "smoothed" graph of size of order , with the maximum vertex degree . The total number of branching vertices, i.e., of degree , is bounded in probability. Thus, each complex component is almost surely topologically equivalent to a -regular multigraph of a uniformly bounded size. Lengths of the shortest cycle and of the shortest path between two branching vertices of a smoothed graph are each of order . We find a relatively simple integral formula for the limit distribution of the numbers of complex components, which implies, in particular, that all values of the "complexity spectrum" have positive limiting probabilities. We also answer questions raised by Erdös and Rényi back in 1960. It is proven that there exists , the limiting planarity probability, with , , . In particular, is almost surely nonplanar iff .

**[1979]**D. Angluin and L. G. Valiant,*Fast probabilistic algorithms for Hamiltonian circuits and matchings*, J. Comput. System Sci.**18**(1979), no. 2, 155–193. MR**532174**, https://doi.org/10.1016/0022-0000(79)90045-X**[1990]**Edward A. Bender, E. Rodney Canfield, and Brendan D. McKay,*The asymptotic number of labeled connected graphs with a given number of vertices and edges*, Random Structures Algorithms**1**(1990), no. 2, 127–169. MR**1138421**, https://doi.org/10.1002/rsa.3240010202**[1984a]**Béla Bollobás,*The evolution of random graphs*, Trans. Amer. Math. Soc.**286**(1984), no. 1, 257–274. MR**756039**, https://doi.org/10.1090/S0002-9947-1984-0756039-5**[1984b]**-,*The evolution of sparse random graphs*, Graph Theory and Combinatorics (Proc. Cambridge Combinatorial Conf. in Honour of Paul Erdös), Academic Press, San Diego, CA, pp. 35-37.**[1985]**Béla Bollobás,*Random graphs*, Academic Press, Inc. [Harcourt Brace Jovanovich, Publishers], London, 1985. MR**809996****[1988]**V. E. Britikov,*Asymptotics of the number of forests made up of nonrooted trees*, Mat. Zametki**43**(1988), no. 5, 672–684, 703 (Russian); English transl., Math. Notes**43**(1988), no. 5-6, 387–394. MR**954351**, https://doi.org/10.1007/BF01158847**[1960]**P. Erdős and A. Rényi,*On the evolution of random graphs*, Magyar Tud. Akad. Mat. Kutató Int. Közl.**5**(1960), 17–61 (English, with Russian summary). MR**0125031****[1989]**Philippe Flajolet, Donald E. Knuth, and Boris Pittel,*The first cycles in an evolving graph*, Discrete Math.**75**(1989), no. 1-3, 167–215. Graph theory and combinatorics (Cambridge, 1988). MR**1001395**, https://doi.org/10.1016/0012-365X(89)90087-3**[1980]**Geoffrey Grimmett,*Random graphs*, Selected topics in graph theory, 2, Academic Press, London, 1983, pp. 201–235. MR**797253****[1990]**Svante Janson,*Poisson approximation for large deviations*, Random Structures Algorithms**1**(1990), no. 2, 221–229. MR**1138428**, https://doi.org/10.1002/rsa.3240010209**[1982]**Michał Karoński,*A review of random graphs*, J. Graph Theory**6**(1982), no. 4, 349–389. MR**679594**, https://doi.org/10.1002/jgt.3190060402**[1988]**D. E. Knuth, Private communication.**[1986]**V. F. Kolchin,*The behavior of a random graph near a critical point*, Teor. Veroyatnost. i Primenen.**31**(1986), no. 3, 503–515 (Russian). MR**866870****[1989]**T. Łuczak and J. C. Wierman,*The chromatic number of random graphs at the double-jump threshold*, Combinatorica**9**(1989), no. 1, 39–49. MR**1010298**, https://doi.org/10.1007/BF02122682**[1990]**Tomasz Łuczak,*Component behavior near the critical point of the random graph process*, Random Structures Algorithms**1**(1990), no. 3, 287–310. MR**1099794**, https://doi.org/10.1002/rsa.3240010305**[1970]**J. W. Moon,*Counting labelled trees*, From lectures delivered to the Twelfth Biennial Seminar of the Canadian Mathematical Congress (Vancouver, vol. 1969, Canadian Mathematical Congress, Montreal, Que., 1970. MR**0274333****[1985]**Edgar M. Palmer,*Graphical evolution*, Wiley-Interscience Series in Discrete Mathematics, John Wiley & Sons, Ltd., Chichester, 1985. An introduction to the theory of random graphs; A Wiley-Interscience Publication. MR**795795****[1977]**Yu. L. Pavlov,*The asymptotic distribution of maximum tree size in a random forest*, Theory Probab. Appl.**22**, 509-520.**[1979]**-,*A case of limit distribution of the maximal volume of a tree in a random forest*, Math. Notes**25**, 387-392.**[1982]**B. Pittel′,*On the probable behaviour of some algorithms for finding the stability number of a graph*, Math. Proc. Cambridge Philos. Soc.**92**(1982), no. 3, 511–526. MR**677474**, https://doi.org/10.1017/S0305004100060205**[1970a]**V. E. Stepanov,*The probability of the connectedness of a random graph \cal𝐺_{𝑚}(𝑡)*, Teor. Verojatnost. i Primenen**15**(1970), 58–68 (Russian, with English summary). MR**0270406**

V. E. Stepanov,*Phase transitions in random graphs*, Teor. Verojatnost. i Primenen.**15**(1970), 200–216 (Russian, with English summary). MR**0270407****[1970b]**-,*On the probability of connectedness of a random graph*, Theory Probab. Appl.**15**, 55-67.**[1988]**-,*On some features of the structure of a random graph near a critical point*, Theory Probab. Appl.**32**, 573-594.**[1987]**V. A. Voblyĭ,*Wright and Stepanov-Wright coefficients*, Mat. Zametki**42**(1987), no. 6, 854–862, 911 (Russian). MR**934817****[1977]**E. M. Wright,*The number of connected sparsely edged graphs*, J. Graph Theory**1**(1977), no. 4, 317–330. MR**0463026**, https://doi.org/10.1002/jgt.3190010407**[1980]**E. M. Wright,*The number of connected sparsely edged graphs. III. Asymptotic results*, J. Graph Theory**4**(1980), no. 4, 393–407. MR**595607**, https://doi.org/10.1002/jgt.3190040409

Retrieve articles in *Transactions of the American Mathematical Society*
with MSC:
05C80,
60C05

Retrieve articles in all journals with MSC: 05C80, 60C05

Additional Information

DOI:
https://doi.org/10.1090/S0002-9947-1994-1138950-5

Keywords:
Random graph,
planar graph,
threshold function,
limit distribution

Article copyright:
© Copyright 1994
American Mathematical Society