A random graph process, G1(n), is a sequence of graphs on n vertices which begins with the edgeless graph, and where at each step a single edge is added according to a uniform distribution on the missing edges. It is well known that in such a process a giant component (of linear size) typically emerges after (1+o(1))n=2 edges (a phenomenon known as "the double jump"), i.e., at time t = 1 when using a timescale of n/2 edges in each step.
All Science Journal Classification (ASJC) codes
- Giant component
- Random graphs
- Wormald's differential equation method