The process of fluctuations of the giant component of an Erdős-Rényi graph
We consider the usual increasing process (ER(n,t∕n))0≤t≤n of Erdős-Rényi random graphs, with n vertices and mean degree t. It is well-known that when t>1, the graph ER(n,t∕n) admits a giant component whose number of vertices satisfies a central limit theorem for a fixed t when n goes to infinity. The purpose of this work is to provide a functional central limit theorem for the number of vertices of the giant component as t varies and to identify the covariance of the limiting Gaussian process.
Authors
- Gabriel Faraud
- Nathanaël Enriquez (ORCID: https://orcid.org/0000-0002-6881-1999)
- Sophie Lemaire
Institutions
- Centre National de la Recherche Scientifique (FR)
- Université Paris-Saclay (FR)
- Université Paris Nanterre (FR)
Publication Details
- Journal
- Electronic Journal of Probability
- Published
- 2025-01-01
- DOI
- https://doi.org/10.1214/25-ejp1388
- Citations
- 1
- Primary Topic
- advanced mathematical theories
- Type
- article
- Field-Weighted Citation Impact
- 3.69