A point process describing the component sizes in the critical window of the random graph evolution
Preprint
Abstract
We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n,p) in the critical window p=n^{-1}+lambda n^{-4/3}. 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 epsilon is almost constant.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Counting connected graphs inside-outJournal of Combinatorial Theory, Series B, 2005
- The Wiener Index of simply generated random treesRandom Structures & Algorithms, 2003
- Cycles and Unicyclic Components in Random GraphsCombinatorics, Probability and Computing, 2003
- Gaussian Hilbert Spaces1997
- Enumerating graphs and Brownian motionCommunications on Pure and Applied Mathematics, 1997
- The birth of the giant componentRandom Structures & Algorithms, 1993
- Multicyclic components in a random graph processRandom Structures & Algorithms, 1993
- On tree census and the giant component in sparse random graphsRandom Structures & Algorithms, 1990
- The brownian excursion area: a numerical analysisComputers & Mathematics with Applications, 1984
- The number of connected sparsely edged graphsJournal of Graph Theory, 1977