Slow emergence of the giant component in the growing m-out graph

Random Structures and Algorithms

Volumn 27, Issue 1, 2005, Pages 1-24

  Bollobás, Béla ^a,b   Riordan, Oliver ^b,c  

^a University of Memphis   (United States)

^b TRINITY COLLEGE   (United Kingdom)

^c UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 24144489044     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20060     Document Type: Review

References (16)

1. R. Albert and A.-L. Barabási, Statistical mechanics of complex networks, Rev Mod Phys 74 (2002), 47-97.
2. A.-L. Barabási and R. Albert, Emergence of scaling in random networks, Science 286 (1999), 509-512.
3. B. Bollobás, Random Graphs, second edition, Cambridge Studies in Advanced Mathematics, Vol. 73, Cambridge University Press, Cambridge, 2001.
4. B. Bollobás, S. Janson, and O. Riordan, The phase transition in the uniformly grown random graph has infinite order, Random Structures Algorithms, 26 (2005), 1-36.
5. B. Bollobás, and O. Riordan, "Mathematical results on scale-free random graphs," Handbook of Graphs and Networks, Eds., Bornholdt and H. G. Schuster, 1-34. Wiley-VCH, Weinheim, 2002.
6. B. Bollobás and O. Riordan, The diameter of a scale-free random graph, Combinatorica 24 (2004), 5-34.
7. B. Bollobás and O. Riordan, Robustness and vulnerability of scale-free random graphs, Internet Math 1 (2003), 1-35.
8. D. S. Callaway, J. E. Hopcroft, J. M. Kleinberg, M. E. J. Newman, and S. H. Strogatz, Are randomly grown graphs really random?, Phys Rev E 64 (2001), 041902.
9. C. Cooper and A. Frieze, Crawling on web graphs, Internet Math 1 (2003), 57-90.
10. C. Cooper and A. Frieze, A general model of web graphs, Random Structures Algorithms 22 (2003), 311-335.
11. S. N. Dorogovtsev and J.F.F. Mendes, Evolution of networks, Adv Phys 51 (2002), 1079-1187.
12. S. N. Dorogovtsev, J. F. F. Mendes, and A. N. Samukhin, Anomalous percolation properties of growing networks, Phys Rev E 64 (2001), 066110.
13. R. Durrett, Rigorous result for the CHKNS random graph model, Proc Discrete Random Walks 2003, Eds., C. Banderier and C. Krattenthaler, Discrete Mathematics and Theoretical Computer Science AC, 2003, pp. 95-104. http://dmtcs.loria.fr/proceedings/
14. R. Durret and H. Kesten, "The critical parameter for connectedness of some random graphs," A tribute to Paul Erdos, Eds., A. Baker, B. Bollobás. and A. Hajnal, 161-176. Cambridge University Press, Cambridge, 1990.
15. S. Kalikow and B. Weiss, When are random graphs connected?, Israel J Math 62 (1988), 257-268.
16. L. A. Shepp, Connectedness of certain random graphs, Israel J Math 67 (1989), 23-33.