The Annals of Applied Probability

Asymptotic normality of the k-core in random graphs

Svante Janson and Malwina J. Luczak

Full-text: Open access

Abstract

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).

Article information

Source
Ann. Appl. Probab., Volume 18, Number 3 (2008), 1085-1137.

Dates
First available in Project Euclid: 26 May 2008

Permanent link to this document
https://projecteuclid.org/euclid.aoap/1211819795

Digital Object Identifier
doi:10.1214/07-AAP478

Mathematical Reviews number (MathSciNet)
MR2418239

Zentralblatt MATH identifier
1157.05047

Subjects
Primary: 05C80: Random graphs [See also 60B20]

Keywords
Cores random graphs balls and bins central limit theorem

Citation

Janson, Svante; Luczak, Malwina J. Asymptotic normality of the k -core in random graphs. Ann. Appl. Probab. 18 (2008), no. 3, 1085--1137. doi:10.1214/07-AAP478. https://projecteuclid.org/euclid.aoap/1211819795


Export citation

References

  • [1] Barbour, A. D., Karoński, M. and Ruciński, A. (1989). A central limit theorem for decomposable random variables with applications to random graphs. J. Combin. Th. Ser. B 47 125–145.
  • [2] Billingsley, P. (1968). Convergence of Probability Measures. Wiley, New York.
  • [3] Bollobás, B. (1984). The evolution of sparse graphs. Graph Theory and Combinatorics (Cambridge, 1983) 35–57. Academic Press, London.
  • [4] Bollobás, B. (2001). Random Graphs, 2nd ed. Cambridge Univ. Press.
  • [5] Cain, J. and Wormald, N. (2006). Encore on cores. Electronic J. Combinatorics 13 R81.
  • [6] Cooper, C. (2004). The cores of random hypergraphs with a given degree sequence. Random Structures Algorithms 25 353–375.
  • [7] Darling, R. and Norris, J. R. Cores and cycles in random hypergraphs. In preparation.
  • [8] Fernholz, D. and Ramachandran, V. (2003). The giant k-core of a random graph with a specified degree sequence. Manuscript. Available at http://www.cs.utexas.edu/~vlr/pubs.html.
  • [9] Fernholz, D. and Ramachandran, V. (2004). Cores and connectivity in sparse random graphs. Technical Report TR-04-13, Dept. Computer Sciences, Univ. Texas at Austin.
  • [10] Gut, A. (2005). Probability: A Graduate Course. Springer, New York.
  • [11] Jacod, J. and Shiryaev, A. N. (1987). Limit Theorems for Stochastic Processes. Springer, Berlin.
  • [12] Janson, S. (1990). A functional limit theorem for random graphs with applications to subgraph count statistics. Random Structures Algorithms 1 15–37.
  • [13] Janson, S. (1994). Orthogonal Decompositions and Functional Limit Theorems for Random Graph Statistics. Amer. Math. Soc., Providence, RI.
  • [14] Janson, S. (2004). Functional limit theorems for multitype branching processes and generalized Pólya urns. Stochastic Process. Appl. 110 177–245.
  • [15] Janson, S. (2007). Monotonicity, asymptotic normality and vertex degrees in random graphs. Bernoulli 13 952–965.
  • [16] Janson, S. The probability that a random multigraph is simple. Available at http://arxiv.org/math.CO/0609802.
  • [17] Janson, S. and Luczak, M. (2007). A simple solution to the k-core problem. Random Structures Algorithms 30 50–62.
  • [18] Janson, S., Łuczak, T. and Ruciński, A. (2000). Random Graphs. Wiley, New York.
  • [19] Kallenberg, O. (2002). Foundations of Modern Probability, 2nd ed. Springer, New York.
  • [20] Kim, J. H. (2006). Poisson cloning model for random graphs. In International Congress of Mathematicians III 873–897. Eur. Math. Soc., Zürich.
  • [21] Łuczak, T. (1991). Size and connectivity of the k-core of a random graph. Discr. Math. 91 61–68.
  • [22] McKay, B. D. (1985). Asymptotics for symmetric 0–1 matrices with prescribed row sums. Ars Combin. 19 15–25.
  • [23] Molloy, M. (2005). Cores in random hypergraphs and Boolean formulas. Random Structures Algorithms 27 124–135.
  • [24] Molloy, M. and Reed, B. (1995). A critical point for random graphs with a given degree sequence. Random Structures Algorithms 6 161–179.
  • [25] Molloy, M. and Reed, B. (1998). The size of the giant component of a random graph with a given degree sequence. Combin. Probab. Comput. 7 295–305.
  • [26] Pittel, B. (1990). On tree census and the giant component in sparse random graphs. Random Structures Algorithms 1 311–342.
  • [27] Pittel, B., Spencer, J. and Wormald, N. (1996). Sudden emergence of a giant k-core in a random graph. J. Combin. Theor. 67 111–151.