The k-core and branching processes

Combinatorics Probability and Computing

Volumn 17, Issue 1, 2008, Pages 111-136

  Riordan, Oliver ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC ANALYSIS; MATHEMATICAL MODELS; PARAMETER ESTIMATION;

BRANCHING PROCESSES; SUBGRAPH;

GRAPH THEORY;

EID: 37249052213     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548307008589     Document Type: Article

References (23)

1. Aiello, W., Chung, F. and Lu, L. (2001) A random graph model for power law graphs. Experiment. Math. 10 53-66.
2. Barabási, A.-L. and Albert, R. (1999) Emergence of scaling in random networks. Science 286 509-512.
3. Bollobás, B. (1984) The evolution of sparse graphs. In Graph Theory and Combinatorics: Cambridge 1983, Academic Press, London, pp. 35-57.
4. Bollobás, B., Janson, S. and Riordan, O. (2005) The phase transition in a uniformly grown random graph has infinite order. Random Struct. Alg. 26 1-36.
5. Bollobás, B., Janson, S. and Riordan, O. (2007) The phase transition in inhomogeneous random graphs. Random Struct. Alg. 31 3-122.
6. Cain, J. and Wormald, N. (2006) Encores on cores. Electron. J. Combin. 13 R81.
7. Callaway, D. S., Hopcroft, J. E., Kleinberg, J. M., Newman, M. E. J. and Strogatz, S. H. (2001) Are randomly grown graphs really random? Phys. Rev. E 64 041902.
8. Chvátal, V. (1991) Almost all graphs with 1.44n edges are 3-colorable. Random Struct. Alg. 2 11-28.
9. Cooper, C. (2004) The cores of random hypergraphs with a given degree sequence. Random Struct. Alg. 25 353-375.
10. Darling, R. W. R. and Norris, J. R. (2005) Differential equation approximations for Markov chains. Manuscript.
11. Dorogovtsev, S. N., Mendes, J. F. F. and Samukhin, A. N. (2001) Anomalous percolation properties of growing networks. Phys. Rev. E 64 066110.
12. Durrett, R. (2003) Rigorous result for the CHKNS random graph model. In Proc. Discrete Random Walks 2003 (C. Banderier and C. Krattenthaler, eds), Discrete Mathematics and Theoretical Computer Science AC 95-104. http://dmtcs.loria.fr/proceedings/
13. Fernholz, D. and Ramachandran, V. (2003) The giant k-core of a random graph with a specified degree sequence. Manuscript.
14. Harris, T. E. (1960) A lower bound for the critical probability in a certain percolation process. Proc. Cam. Philos. Soc. 56 13-20.
15. Janson, S. and Luczak, M. J. (2007) A simple solution to the k-core problem. Random Struct. Alg. 30 50-62.
16. Kalikow, S. and Weiss, B. (1988) When are random graphs connected? Israel J. Math. 62 257-268.
17. Kallenberg, O. (2002) Foundations of Modern Probability, 2nd edn, Springer, New York.
18. Kleitman, D. J. (1966) Families of non-disjoint subsets, J. Combin. Theory 1 153-155.
19. Molloy, M. (2005) Cores in random hypergraphs and Boolean formulas. Random Struct. Alg. 27 124-135.
20. Molloy, M. and Reed, B. (1995) A critical point for random graphs with a given degree sequence. Random Struct. Alg. 6 161-179.
21. Pittel, B., Spencer, J. and Wormald, N. (1996) Sudden emergence of a giant k-core in a random graph. J. Combin. Theory Ser. B 67 111-151.
22. Riordan, O. (2005) The small giant component in scale-free random, graphs. Combin. Probab. Comput. 14 897-938.
23. Söderberg, B. (2002) General formalism for inhomogeneous random graphs. Phys. Rev. E 66 066121.