The small giant component in scale-free random graphs

Combinatorics Probability and Computing

Volumn 14, Issue 5-6, 2005, Pages 897-938

  Riordan, Oliver ^a,b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b TRINITY COLLEGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; MATHEMATICAL MODELS; PHASE TRANSITIONS; RANDOM PROCESSES;

BRANCHING PROCESS; GROWTH RATE; LOWER BOUNDS; RANDOM GRAPH MODELS;

GRAPH THEORY;

EID: 26844481982     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S096354830500708X     Document Type: Article

References (24)

1. Abramowitz, M. and Stegun, I. A., eds (1965) The Handbook of Mathematical Functions, Dover, New York. (Ninth printing, 1970.)
2. Albert, R. and Barabási, A.-L. (2002) Statistical mechanics of complex networks. Rev. Mod. Phys. 74 47-97.
3. Albert, R., Jeong, H. and Barabási, A.-L. (2000) Error and attack tolerance of complex networks. Nature 406 378-382.
4. Barabási, A.-L. and Albert, R. (1999) Emergence of scaling in random networks. Science 286 509-512.
5. Bollobás, B. (2001) Random Graphs, second edn, Vol. 73 of Cambridge Studies in Advanced Mathematics, Cambridge University Press, Cambridge.
6. Bollobás, B., Janson, S. and Riordan, O. (2005) The phase transition in the uniformly grown random graph has infinite order. Random Struct. Alg. 26 1-36.
7. Bollobás, B. and Riordan, O. (2002) Mathematical results on scale-free random graphs. In Handbook of Graphs and Networks (S. Bornholdt and H. G. Schuster, eds), Wiley-VCH, Weinheim, pp. 1-34.
8. Bollobás, B. and Riordan, O. (2003) Robustness and vulnerability of scale-free random graphs. Internet Mathematics 1 1-35.
9. Bollobás, B. and Riordan, O. (2004) The diameter of a scale-free random graph. Combinatorica 24 5-34.
10. Bollobás, B. and Riordan, O. (2005) Slow emergence of the giant component in the growing m-out graph. Random Struct. Alg. 27 1-24.
11. Bollobás, B., Riordan, O., Spencer, J. and Tusnády, G. (2001) The degree sequence of a scale-free random graph process. Random Struct. Alg. 18 279-290.
12. 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.
13. Callaway, D. S., Newman, M. E. J., Strogatz, S. H. and Watts, D. J. (2000) Network robustness and fragility: percolation on random graphs. Phys. Rev. Lett. 85 5468-5471.
14. Cohen, R., Erez, K., ben-Avraham, D. and Havlin, S. (2000) Resilience of the Internet to random breakdowns. Phys. Rev. Lett. 85 4626-4628.
15. Dorogovtsev, S. N. and Mendes, J. F. F. (2002) Evolution of networks. Adv. Phys. 51 1079.
16. Dorogovtsev, S. N., Mendes, J. F. F. and Samukhin, A. N. (2001) Anomalous percolation properties of growing networks. Phys. Rev. E 64 066110.
17. 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/
18. Durrett, R. and Kesten, H. (1990) The critical parameter for connectedness of some random graphs. In A Tribute to Paul Erdos (A. Baker, B. Bollobás and A. Hajnal, eds), Cambridge University Press, Cambridge, pp. 161-176.
19. Kalikow, S. and Weiss, B. (1988) When are random graphs connected? Israel J. Math. 62 257-268.
20. Norris, J. private communication.
21. Shepp, L. A. (1989) Connectedness of certain random graphs. Israel J. Math. 67 23-33.
22. Söderberg, B. (2002) General formalism for inhomogeneous random graphs. Phys. Rev. E 66 066121.
23. Söderberg, B. (2003) Random graphs with hidden colour. Phys. Rev. E 68 015102(R).
24. Söderberg, B. (2003) Properties of random graphs with hidden colour. Phys. Rev. E 68 026107.