Asymptotic normality of the k-core in random graphs

Annals of Applied Probability

Volumn 18, Issue 3, 2008, Pages 1085-1137

  Janson, Svante ^a   Luczak, Malwina J ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b LONDON SCHOOL OF ECONOMICS   (United Kingdom)

Author keywords

Balls and bins; Central limit theorem; Cores; Random graphs

Indexed keywords

EID: 52949151543     PISSN: 10505164     EISSN: 10505164     Source Type: Journal    
DOI: 10.1214/07-AAP478     Document Type: Article

References (27)

1. BARBOUR, A. D., KAROŃSKT, M. and RUCIŃSKT, A. (1989). A central limit theorem for decomposable random variables with applications to random graphs. J. Combin. Th. Ser. B 47 125-145. MR1047781
2. BILLINGSLEY, P. (1968). Convergence of Probability Measures. Wiley, New York. MR0233396
3. BOLLOBÁS, B. (1984). The evolution of sparse graphs. Graph Theory and Combinatorics (Cambridge, 1983) 35-57. Academic Press, London. MR0777163
4. BOLLOBÁS, B. (2001). Random Graphs, 2nd ed. Cambridge Univ. Press. MR1864966
5. CAIN, J. and WORMALD, N. (2006). Encore on cores. Electronic J. Combinatorics 13 R81. MR2255423
6. COOPER, C. (2004). The cores of random hypergraphs with a given degree sequence. Random Structures Algorithms 25 353-375. MR2099209
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. MR2125120
11. JACOD, J. and SHIRYAEV, A. N. (1987). Limit Theorems for Stochastic Processes. Springer, Berlin. MR0959133
12. JANSON, S. (1990). A functional limit theorem for random graphs with applications to subgraph count statistics. Random Structures Algorithms 1 15-37. MR1068489
13. JANSON, S. (1994). Orthogonal Decompositions and Functional Limit Theorems for Random Graph Statistics. Amer. Math. Soc., Providence, RI. MR1219708
14. JANSON, S. (2004). Functional limit theorems for multitype branching processes and generalized Pólya urns. Stochastic Process. Appl. 110 177-245. MR2040966
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. MR2283221
18. JANSON, S., LUCZAK, T. and RUCIŃSKI, A. (2000). Random Graphs. Wiley, New York. MR1782847
19. KALLENBERG, O. (2002). Foundations of Modern Probability, 2nd ed. Springer, New York. MR1876169
20. KIM, J. H. (2006). Poisson cloning model for random graphs. In International Congress of Mathematicians III 873-897. Eur. Math. Soc., Zürich. MR2275710
21. LUCZAK, T. (1991). Size and connectivity of the k-core of a random graph. Discr. Math. 91 61-68 MR1120887
22. MCKAY, B. D. (1985). Asymptotics for symmetric 0-1 matrices with prescribed row sums. Ars Combin. 19 15-25. MR0790916
23. MOLLOY, M. (2005). Cores in random hypergraphs and Boolean formulas. Random Structures Algorithms 27 124-135. MR2150018
24. MOLLOY, M. and REED, B. (1995). A critical point for random graphs with a given degree sequence. Random Structures Algorithms 6 161-179. MR1370952
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. MR1664335
26. PITTEL, B. (1990). On tree census and the giant component in sparse random graphs. Random Structures Algorithms 1 311-342. MR1099795
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. MR1385386