The phase transition in the uniformly grown random graph has infinite order

Random Structures and Algorithms

Volumn 26, Issue 1-2, 2005, Pages 1-36

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

^a University of Memphis   (United States)

^b TRINITY COLLEGE   (United Kingdom)

^c UPPSALA UNIVERSITY   (Sweden)

^d UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 22144454306     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20041     Document Type: Conference Paper

References (24)

1. A.-L. Barabási and R. Albert, Emergence of scaling in random networks, Science 286 (1999), 509-512.
2. B. Bollobás, Random graphs, 2nd edition, Cambridge Studies in Advanced Mathematics, Vol. 73, Cambridge University Press, Cambridge, 2001.
3. B. Bollobás, The evolution of random graphs, Trans Amer Math Soc 286 (1984), 257-274.
4. B. Bollobás, C. Borgs, J. T. Chayes, J. H. Kim, and D. B. Wilson, The scaling window of the 2-SAT transition, Random Structures Algorithms 18 (2001), 201-256.
5. B. Bollobás and O. Riordan, The diameter of a scale-free random graph, Combinatorica 24 (2004), 5-34.
6. B. Bollobás and O. Riordan, Robustness and vulnerability of scale-free random graphs, Internet Math 1 (2003), 1-35.
7. B. Bollobás and O. Riordan, Slow emergence of the giant component in the growing m-out graph, to appear (preprint available from http://www.dpmms.cam.ac.uk/~omr10/).
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. S. N. Dorogovtsev, J. F. F. Mendes, and A. N. Samukhin, Anomalous percolation properties of growing networks, Phys Rev E 64 (2001), 066110.
10. R. Durrett, Rigorous result for the CHKNS random graph model, Proceedings, Discrete Random Walks 2003, Eds. C. Banderier and C. Krattenthaler, Discrete Math Theor Comput Sci AC (2003), 95-104, http://dmtcs.loria.fr/ proceedings/
11. R. Durrett and H. Kesten, The critical parameter for connectedness of some random graphs, in A tribute to Paul Erdo″s, Eds. A. Baker, B. Bollobás and A. Hajnal, 161-176. Cambridge University Press, Cambridge, 1990.
12. P. Erdos and A. Rényi, On the evolution of random graphs, Magyar Tud Akad Mat Kutató Int Közl 5 (1960), 17-61.
13. P. Erdos and A. Rényi, On the evolution of random graphs, Bull Inst Internat Statist 38 (1961), 343-347.
14. S. Janson, D. Knuth, T. Luczak, and B. Pittel, The birth of the giant component, Random Structures Algorithms 4 (1994), 231-358.
15. S. Kalikow and B. Weiss, When are random graphs connected?, Israel J Math 62 (1988), 257-268.
16. R. M. Karp, The transitive closure of a random digraph, Random Structures Algorithms 1 (1990), 73-93.
17. T. Luczak, Component behavior near the critical point of the random graph process, Random Structures Algorithms 1 (1990), 287-310.
18. M. E. J. Newman, The structure and function of complex networks, SIAM Rev 45 (2003), 167-256.
19. L. A. Shepp, Connectedness of certain random graphs. Israel J Math 67 (1989), 23-33.
20. B. Söderberg, General formalism for inhomogeneous random graphs, Phys Rev E 66 (2002), 066121.
21. B. Söderberg, Random graphs with hidden colour, Phys Rev E 68 (2003), 015102(R).
22. B. Söderberg, Properties of random graphs with hidden colour, Phys Rev E 68 (2003), 026107.
23. T. S. Turova, Dynamical random graphs with memory, Phys Rev E 65 (2002), 066102.
24. Y. Zhang, A power law for connectedness of some random graphs at the critical point, Random Structures Algorithms 2 (1991), 101-119.