A simple solution to the k-core problem

Random Structures and Algorithms

Volumn 30, Issue 1-2, 2007, Pages 50-62

  Janson, Svante ^a   Luczak, Malwina J ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b LONDON SCHOOL OF ECONOMICS   (United Kingdom)

Author keywords

Balls and bins; Cores; Death process; Empirical distributions; Law of large numbers; Random graphs

Indexed keywords

EID: 33846659833     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20147     Document Type: Conference Paper

References (19)

1. B. Bollobás, Random Graphs, 2nd ed., Cambridge Univ. Press, Cambridge, 2001.
2. J. Cain and N. Wormald, Encore on cores, Electron J Combinator 13 (2006), R81.
3. C. Cooper, The cores of random hypergraphs with a given degree sequence, Random Struct Algor 25 (2004), 353-375.
4. R. Darling and J. R. Norris, Cores and cycles in random graphs, in preparation, 2005.
5. R. L. Devaney, An Introduction to Chaotic Dynamical Systems, 2nd ed., Westview Press, Boulder, CO, 2003.
6. P. Erdös and A. Rényi, On the evolution of random graphs, Magyar Tud Akad Mat Kutató Int Közl 5 (1960), 17-61.
7. D. Fernholz and V. Ramachandran, The giant k-core of a random graph with a specified degree sequence, manuscript, 2003. http://www.cs.utexas.edu/~vlr/ pubs.html.
8. D. Fernholz and V. Ramachandran, Cores and connectivity in sparse random graphs, Technical Report TR-04-13, The University of Texas at Austin, Department of Computer Sciences, 2004.
9. S.Janson, The probability that arandommultigraphis simple, http://arxiv.org/math.CO/0609802.
10. S. Janson, D. E. Knuth, T. Luczak, and B. Pittel, The birth of the giant component, Random Struct Algor 3 (1993), 233-358.
11. S. Janson, T. Luczak, and A. Ruciński, Random Graphs, Wiley, New York, 2000.
12. O. Kallenberg, Foundations of Modern Probability, 2nd ed., Springer, New York, 2002.
13. J. H. Kim, The Poisson cloning model for random graphs, Preprint 2006. http://research.microsoft.com/theory/jehkim/.
14. M. J. Luczak, A differential equation approximation for the k-core process, manuscript, 2005.
15. T. Luczak, Size and connectivity of the k-core of a random graph, Discrete Math 91 (1991), 61-68.
16. B.D. McKay, Asymptotics for symmetric 0-1 matrices with prescribed row sums, Ars Combin 19 A (1985), 15-25.
17. M. Molloy, Cores in random hypergraphs and Boolean formulas, Random Struct Algor 27 (2005), 124-135.
18. M. Molloy and B. Reed, A critical point for random graphs with a given degree sequence, Random Struct Algor 6 (1995), 161-179.
19. B. Pittel, J. Spencer, and N. Wormald, Sudden emergence of a giant k-core in a random graph, J Combinator Theor 67 (1996), 111-151.