A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution
From MaRDI portal
Publication:5437236
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.
Recommendations
- Component behavior near the critical point of the random graph process
- The component sizes of a critical random graph with given degree sequence
- Component sizes of the random graph outside the scaling window
- On the largest component of the random graph at a nearcritical stage
- Size of the largest component in a critical graph
Cited in
(8)- On the critical probability in percolation
- Critical epidemics, random graphs, and Brownian motion with a parabolic drift
- Critical random forests
- On the length of a random minimum spanning tree
- The continuum limit of critical random graphs
- Critical random graphs and the structure of a minimum spanning tree
- Component sizes of the random graph outside the scaling window
- Susceptibility in subcritical random graphs
This page was built for publication: A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5437236)