The phase transition in the configuration model

Combinatorics Probability and Computing

Volumn 21, Issue 1-2, 2012, Pages 265-299

  Riordan, Oliver ^a,b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b University of Memphis   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONFIGURATION MODEL; DEGREE SEQUENCE; NATURAL EXTENSION; PERCOLATION PHASE TRANSITION; RANDOM GRAPHS; SUBGRAPHS;

GRAPH THEORY; SOLVENTS;

PHASE TRANSITIONS;

EID: 84859320352     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548311000666     Document Type: Article

References (28)

1. Aldous, D. (1997) Brownian excursions, critical random graphs and the multiplicative coalescent. Ann. Probab. 25 812-854.
2. Bender, E. A. and Canfield, R. E. (1978) The asymptotic number of labeled graphs with given degree sequences. J. Combin. Theory Ser. A 24 296-307.
3. Bollobás, B. (1980) A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. European J. Combin. 1 311-316.
4. Bollobás, B. (1984) The evolution of random graphs. Trans. Amer. Math. Soc. 286 257-274.
5. Bollobás, B. and Riordan, O. (2009) Random graphs and branching processes. In Handbook of Large-Scale Random Networks (B. Bollobá s, R. Kozma and D. Miklós eds), Vol. 18 of Bolyai Soc. Math. Studies, pp. 15-115.
6. Bollobás, B. and Riordan, O. (2012) Asymptotic normality of the size of the giant component via a random walk. J. Combin. Theory Ser. B 102 53-61.
7. Brown, B. M. (1971) Martingale central limit theorems. Ann. Math. Statist. 42 59-66.
8. Cramér, H. (1938) Sur un nouveau théorème-limite de la théorie des probabilités. Actualités Scientifiques et Industrielles 736 5-23.
9. Ding, J., Kim, J. H., Lubetzky, E. and Peres, Y. (2010) Diameters in supercritical random graphs via first-passage percolation. Combin. Probab. Comput. 19 729-751.
10. Doob, J. L. (1953) Stochastic Processes, Wiley/Chapman and Hall.
11. Fountoulakis, N. (2007) Percolation on sparse random graphs with given degree sequence. Internet Mathematics 4 329-356.
12. Goerdt, A. (2001) The giant component threshold for random regular graphs with edge faults. Theoret. Comput. Sci. 259 307-321. (Pubitemid 32674031)
13. Janson, S. (2009) On percolation in random graphs with given vertex degrees. Electron. J. Probab. 14 87-118.
14. Janson, S. and Luczak, M. J. (2009) A new approach to the giant component problem. Random Struct. Alg. 34 197-216.
15. Kang, M. and Seierstad, T. G. (2008) The critical phase for random graphs with a given degree sequence. Combin. Probab. Comput. 17 67-86. (Pubitemid 350273128)
16. Karp, R. M. (1990) The transitive closure of a random digraph. Random Struct. Alg. 1 73-93.
17. Luczak, T. (1990) Component behavior near the critical point of the random graph process. Random Struct. Alg. 1 287-310.
18. Martin-Löf, A. (1986) Symmetric sampling procedures, general epidemic processes and their threshold limit theorems. J. Appl. Probab. 23 265-282.
19. McDonald, D. R. (1979) On local limit theorem for integer valued random variables. Teor. Veroyatnost. i Primenen. 24 607-614.
20. See also Theory Probab. Appl. 24 (1980), 613-619.
21. Molloy, M. and Reed, B. (1995) A critical point for random graphs with a given degree sequence, Random Struct. Alg. 6 161-179.
22. 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. (Pubitemid 128480814)
23. Nachmias, A. and Peres, Y. (2007) Component sizes of the random graph outside the scaling window. ALEA Lat. Amer. J. Probab. Math. Stat. 3 133-142.
24. Nachmias, A. and Peres, Y. (2010) Critical percolation on random regular graphs. Random Struct. Alg. 36 111-148.
25. Petrov, V. V. (1975) Sums of Independent Random Variables, translated from the Russian by A. A. Brown, Vol. 82 of Ergebnisse der Mathematik und ihrer Grenzgebiete, Springer.
26. Pittel, B. (2008) Edge percolation on a random regular graph of low degree. Ann. Probab. 36 1359-1389.
27. Pittel, B. and Wormald, C. (2005) Counting connected graphs inside-out. J. Combin. Theory Ser. B 93 127-172. (Pubitemid 40176102)
28. Spitzer, F. (1956) A combinatorial lemma and its application to probability theory. Trans. Amer. Math. Soc. 82 323-339.