Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
   
Mobile Device Pairing
Green Open Access
Transactions of the American Mathematical Society
Transactions of the American Mathematical Society
ISSN 1088-6850(online) ISSN 0002-9947(print)

 

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
MathSciNet review: 1138950
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Consider the random graph models $ G(n,\char93 \;{\text{edges}} = M)$ and $ G(n,\operatorname{Prob}({\text{edge}}) = p)$ with $ M = M(n) = (1 + \lambda {n^{ - 1/3}})n/2$ and $ p = p(n) = (1 + \lambda {n^{ - 1/3}})/n$. For $ l \geq - 1$ define an $ l$-component of a random graph as a component which has exactly $ l$ more edges than vertices. Call an $ l$-component with $ l \geq 1$ a complex component. For both models, we show that when $ \lambda $ 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 $ {n^{2/3}}$, and the maximum value of $ l$ is bounded in probability. We prove that a.s. the largest suspended tree in each complex component has size of order $ {n^{2/3}}$, and deletion of all suspended trees results in a "smoothed" graph of size of order $ {n^{1/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 $ {n^{1/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(\lambda )$, the limiting planarity probability, with $ 0 < p(\lambda ) < 1$, $ p( - \infty ) = 1$, $ p(\infty ) = 0$. In particular, $ G(n,M)\quad (G(n,p),{\text{resp}}.)$ is almost surely nonplanar iff $ (M - n/2){n^{ - 2/3}} \to \infty \;((np - 1){n^{ - 1/3}}) \to \infty ,{\text{resp}}.)$.


References [Enhancements On Off] (What's this?)


Similar Articles

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: http://dx.doi.org/10.1090/S0002-9947-1994-1138950-5
PII: S 0002-9947(1994)1138950-5
Keywords: Random graph, planar graph, threshold function, limit distribution
Article copyright: © Copyright 1994 American Mathematical Society