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

Authors:

• Tomasz Łuczak,
• Boris Pittel,
• John C. Wierman

Abstract

Consider the random graph models and G(n, Prob(edge) = p) with and define an /-component of a random graph as a component which has exactly more edges than vertices. Call an /-component with 1 a complex component. For both models, we show that when A 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 n2/3, and deletion of all suspended trees results in a "smoothed" graph of size of order n1'3, with the maximum vertex degree 3. The total number of branching vertices, i.e., of degree 3, is bounded in probability. Thus, each complex component is almost surely topologically equivalent to a 3-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 n1/3. 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 p(k), the limiting planarity probability, with. In particular, G(n, M) (G(n, p), resp.) is almost surely nonplanar iff (resp.). © 1994 American Mathematical Society.