Library Header Image
LSE Research Online LSE Library Services

Symptotic normality of the k-core in random graphs

Janson, Svante and Luczak, Malwina J. (2008) Symptotic normality of the k-core in random graphs. Annals of Applied Probability, 18 (3). pp. 1085-1137. ISSN 1050-5164

Full text not available from this repository.
Identification Number: 10.1214/07-AAP478


We study the k-core of a random (multi)graph on n vertices with a given degree sequence. In our previous paper [Random Structures Algorithms 30 (2007) 50–62] we used properties of empirical distributions of independent random variables to give a simple proof of the fact that the size of the giant k-core obeys a law of large numbers as n→∞. Here we develop the method further and show that the fluctuations around the deterministic limit converge to a Gaussian law above and near the threshold, and to a non-normal law at the threshold. Further, we determine precisely the location of the phase transition window for the emergence of a giant k-core. Hence, we deduce corresponding results for the k-core in G(n, p) and G(n, m).

Item Type: Article
Official URL:
Additional Information: © 2008 Institute of Mathematical Statistics
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 23 Jan 2009 15:52
Last Modified: 16 May 2024 00:42

Actions (login required)

View Item View Item