A point process describing the component sizes in the critical window of the random graph evolution

We study a point process describing the asymptotic behaviour of sizes of the largest components of the random graph G(n, p) in the critical window, that is, for p = n(-1) + lambda n(-4/3), where;. is a fixed real number. In particular, we show that this point process has a surprising rigidity. Fluctuations in the large values will be balanced by opposite fluctuations in the small values such that the sum of the values larger than a small E: (a scaled version of the number of vertices in components of size greater than epsilon n(2/3)) is almost constant.