The average size of giant components between the double-jump

Abstract: We study the sizes of connected components according to their excesses during a random graph process built with

n

vertices. The considered model is the continuous one defined in Janson 2000. An

e l l

-component is a connected component with

e l l

edges more than vertices.

e l l

is also called the extit{excess} of such component. As our main result, we show that when

e l l

and

n o v e r e l l

are both large, the expected number of vertices that ever belong to an

e l l

-component is about

12^{1 / 3} {e l l}^{1 / 3} n^{2 / 3}

. We also obtain limit theorems for the number of creations of

e l l

-components.

Recommendations

Cited In (9)

This page was built for publication: The average size of giant components between the double-jump