A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution
DOI10.1017/S0963548306008327zbMATH Open1136.05069arXivmath/0505529OpenAlexW2154654198MaRDI QIDQ5437236FDOQ5437236
Authors: Svante Janson, Joel Spencer
Publication date: 18 January 2008
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0505529
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
Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Random graphs (graph-theoretic aspects) (05C80) Random measures (60G57) Connectivity (05C40)
Cited In (8)
- On the length of a random minimum spanning tree
- On the critical probability in percolation
- Component sizes of the random graph outside the scaling window
- Critical epidemics, random graphs, and Brownian motion with a parabolic drift
- Susceptibility in subcritical random graphs
- Critical random forests
- The continuum limit of critical random graphs
- Critical random graphs and the structure of a minimum spanning tree
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)