The phase transition in inhomogeneous random graphs

Random Structures and Algorithms

Volumn 31, Issue 1, 2007, Pages 3-122

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

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b University of Memphis   (United States)

^c UPPSALA UNIVERSITY   (Sweden)

^d CHURCHILL COLLEGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34547688893     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20168     Document Type: Review

References (97)

1. W. Aiello, F. Chung, and L. Lu, A random graph model for power law graphs, Experiment Math 10 (2001), 53-66.
2. 2 Ising and Potts models, J Statist Phys 50 (1988), 1-20.
3. R. Albert and A.-L. Barabási, Statistical mechanics of complex networks, Rev Mod Phys 74 (2002), 47-97.
4. R. Albert, H. Jeong, and A.-L. Barabási, Diameter of the world-wide web, Nature 401 (1999), 130-131.
5. R. Albert, H. Jeong, and A.-L. Barabási, Error and attack tolerance of complex networks, Nature 406 (2000), 378-382.
6. A. B. Aleksandrov, S. Janson, V. V. Peller, and R. Rochberg, "An interesting class of operators with unusual Schatten-von Neumann behavior," In Function Spaces, Interpolation Theory and Related Topics, Eds. M. Cwikel, M. Englis, A. Kufner, L.-E. Persson and G. Sparr, Proceedings of the International Conference in honour of Jaak Peetre on His 65th Birthday, Lund 2000, Walter de Gruyter, Berlin, 2002, pp. 61-150.
7. N. Alon, A note on network reliability, In Discrete Probability and Algorithms (Minneapolis, MN, 1993), IMA Vol. Math Appl, 72, Springer, New York, 1995, 11-14.
8. K. B. Athreya and P. E. Ney, Branching processes, Springer, Berlin, 1972.
9. A.-L. Barabási and R. Albert, Emergence of scaling in random networks, Science 286 (1999), 509-512.
10. A.-L. Barabási, R. Albert, and H. Jeong, Scale-free characteristics of random networks: The topology of the world-wide web, Physica A 281 (2000), 69-77.
11. A. D. Barbour, L. Holst, and S. Janson, Poisson approximation, Oxford University Press, Oxford, 1992.
12. N. Berger, C. Borgs, J. T. Chayes, and A. Saberi, On the spread of viruses on the Internet, Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, 2005, pp. 301-310.
13. P. Billingsley, Convergence of probability measures, Wiley, New York, 1968.
14. B. Bollobás, A probabilistic proof of an asymptotic formula for the number of labeled regular graphs, Eur J Combinatorics 1 (1980), 311-316.
15. B. Bollobás, The evolution of random graphs, Trans Amer Math Soc 286 (1984), 257-274.
16. B. Bollobás, Random graphs, 2nd ed., Cambridge University Press, Cambridge, 2001.
17. B. Bollobás, Linear Analysis, 2nd ed., Cambridge University Press, Cambridge, 1999.
18. B. Bollobás and W. Fernandez de la Vega, The diameter of random regular graphs, Combinatorica 2 (1982), 125-134.
19. B. Bollobás, S. Janson, and O. Riordan, The phase transition in a uniformly grown random graph has infinite order, Random Struct Alg 26 (2005), 1-36.
20. d, Random Struct Alg, to appear. Published online as DOI: 10.1002/rsa.20175
21. B. Bollobás and O. Riordan, "Mathematical results on scale-free random graphs", Handbook of graphs and networks, S. Bornholdt and H. G. Schuster (Editors), Wiley-VCH, Weinheim, 2003, pp. 1-34.
22. B. Bollobás and O. Riordan, Robustness and vulnerability of scale-free random graphs, Internet Mathematics 1 (2003), 1-35.
23. B. Bollobás and O. Riordan, The diameter of a scale-free random graph, Combinatorica 24 (2004), 5-34.
24. B. Bollobás and O. Riordan, Coupling scale-free and classical random graphs, Internet Mathematics 1 (2004), 215-225.
25. B. Bollobás and O. Riordan, Slow emergence of the giant component in the growing m-out graph, Random Struct Alg 27 (2005), 1-24.
26. B. Bollobás, O. Riordan, J. Spencer, and G. Tusnády, The degree sequence of a scale-free random graph process, Random Struct Alg 18 (2001), 279-290.
27. T. Britton, M. Deijfen, and A. Martin-Löf, Generating simple random graphs with prescribed degree distribution, J Statist Phys 124 (2006), 1377-1397.
28. T. Britton and A. Martin-Löf, private communication (2005).
29. P. G. Buckley and D. Osthus, Popularity based random graph models leading to a scale-free degree sequence, Discrete Math 282 (2004), 53-68.
30. 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.
31. D. S. Callaway, M. E. J. Newman, S. H. Strogatz, and D. J. Watts, Network robustness and fragility: percolation on random graphs, Phys Rev Lett 85 (2000), 5468-5471.
32. H. Cartan, Calcul Différentiel, Hermann, Paris, 1967.
33. F. Chung and L. Lu, The diameter of sparse random graphs, Adv Appl Math 26 (2001), 257-279.
34. F. Chung and L. Lu, Connected components in random graphs with given expected degree sequences, Ann Comb 6 (2002), 125-145.
35. F. Chung and L. Lu, The average distances in random graphs with given expected degrees, Proc Natl Acad Sci USA 99 (2002), 15879-15882, (electronic).
36. F. Chung and L. Lu, The average distance in a random graph with given expected degrees, Internet Math 1 (2003), 91-113.
37. F. Chung and L. Lu, The volume of the giant component of a random graph with given expected degrees, SIAM J Discrete Math 20 (2006), 395-411.
38. R. Cohen, K. Erez, D. ben-Avraham, and S. Havlin, Breakdown of the Internet under intentional attack, Phys Rev Lett 86 (2001), 3682-3685.
39. R. Cohen and S. Havlin, Ultra small world in scale-free networks, Phys Rev Lett 90 (2003), 058701.
40. C. Cooper and A. Frieze, A general model of web graphs, Random Struct Alg 22 (2003), 311-335.
41. L. Devroye, C. McDiarmid, and B. Reed, "Giant components for two expanding graph processes", Mathematics and computer science II (Versailles, 2002), B. Chauvin, P. Flajolet, D. Gardy, and A. Mokkadem (Editors), Birkhäuser, Basel, 2002, pp. 161-173.
42. S. N. Dorogovtsev and J. F. F. Mendes, Evolution of networks, Adv Phys 51 (2002), 1079-1187.
43. S. N. Dorogovtsev, J. F. F. Mendes, and A. N. Samukhin, Anomalous percolation properties of growing networks, Phys Rev E 64 (2001), 066110.
44. R. Durrett, Rigorous result for the CHKNS random graph model. In: Chr. Krattenthaler and C. Banderier (eds.): Proceedings, Discrete Random Walks (Paris, 2003), Discrete Mathematics and Theoretical Computer Science AC (2003), pp. 95-104. Available at: http:// dmtcs.loria.fr/proceedings/
45. R. Durrett and P. Jung, Two phase transitions for the contact process on small worlds, preprint available at http://arXiv.org/math.PR/0501481
46. R. Durrett and H. Kesten, The critical parameter for connectedness of some random graphs, A Tribute to Paul Erdos, A. Baker, B. Bollobás, and A. Hajnal (Editors), Cambridge University Press, Cambridge, 1990, pp. 161-176.
47. P. Erdos and A. Rényi, On the evolution of random graphs, Magyar Tud Akad Mat Kutató Int Közl 5 (1960), 17-61.
48. P. Erdos and A. Rényi, On the evolution of random graphs, Bull Inst Int Statist 38 (1961), 343-347.
49. H. van den Esker, R. van der Hofstad, G. Hooghiemstra, and D. Znamenski, Distances in random graphs with infinite mean degrees, Extremes 8 (2006), 111-141.
50. M. Faloutsos, P. Faloutsos, and C. Faloutsos, On power-law relationships of the internet topology, SIGCOMM 1999, Comput Commun Rev 29 (1999), 251.
51. D. Fernholz and V. Ramachandran, The diameter of sparse random graphs, Random Struct Alg, to appear.
52. E. N. Gilbert, Random graphs, Ann Math Statist 30 (1959), 1141-1144.
53. M. Hervé, Analyticity in infinite dimensional spaces, Walter de Gruyter, Berlin, 1989.
54. R. van der Hofstad, G. Hooghiemstra, and P. Van Mieghem, Distances in random graphs with finite variance degrees, Random Struct Alg 27 (2005), 76-123.
55. R. van der Hofstad, G. Hooghiemstra, and D. Znamenski, Random graphs with arbitrary i.i.d. degrees, preprint available at http://arXiv.org/math.PR/ 0502580
56. R. van der Hofstad, G. Hooghiemstra, and D. Znamenski, Distances in random graphs with finite mean and infinite variance degrees, preprint available at http://arXiv.org/math.PR/0502581
57. S. Janson, On a random graph related to quantum theory, Combin Probab Comput, to appear. Published online 23 Jan 2007.
58. S. Janson, D. Knuth, T. Łuczak, and B. Pittel, The birth of the giant component, with an introduction by the editors, Random Struct Alg 4 (1994), 231-358.
59. S. Janson, T. Łuczak, and A. Ruciński, Random graphs, Wiley, New York, 2000.
60. S. Kalikow and B. Weiss, When are random graphs connected? Israel J Math 62 (1988), 257-268.
61. O. Kallenberg, Foundations of modern probability, 2nd ed., Springer, New York, 2002.
62. R. M. Karp, The transitive closure of a random digraph, Random Struct Alg 1 (1990), 73-93.
63. D. G. Kendall, Deterministic and stochastic epidemics in closed populations, In Proceedings of the third Berkeley Symposium on Mathematical Statistics and Probability, 1954-1955, Vol. IV, University of California Press, Berkeley, 1956, pp. 149-165.
64. V. I. Khokhlov and V. F. Kolchin, On the number of cycles in a random non-equiprobable graph (Russian), Diskretnaya Matematika 2 (1990), 137-145. English transi, Discrete Math Appl 2 (1992), 109-118.
65. V. I. Khokhlov and V. F. Kolchin, On the structure of a random graph with nonuniform distribution, New Trends in Probability and Statistics, Vol. 1 (Bakuriani, 1990), VSP, Utrecht, 1991, pp. 445-456.
66. J. M. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, The web as a graph: Measurements, models, and methods, Lecture Notes in Computer Science 1627 (1999), 1-17. Proceedings of COCOON '99.
67. T. M. Liggett, Multiple transition points for the contact process on the binary tree, Ann Probability 24 (1996), 1675-1710.
68. T. M. Liggett, Stochastic interacting systems: Contact, voter and exclusion processes, Springer-Verlag, New York, 1999.
69. L. Lovász and B. Szegedy, Limits of dense graph sequences, Microsoft Technical Report TR-2004-79, Available at http://research.microsoft. com/users/ lovasz/limits.pdf
70. M. J. Luczak and C. McDiarmid, Bisecting sparse random graphs, Random Struct Alg 18 (2001), 31-38.
71. T. Łuczak, Component behavior near the critical point of the random graph process, Random Struct Alg 1 (1990), 287-310.
72. T. Łuczak, Sparse random graphs with a given degree sequence, Random graphs, Vol. 2 (Poznań, 1989), Wiley, New York, 1992, pp. 165-182.
73. T. Łuczak, Random trees and random graphs, Random Struct Alg 13 (1998), 485-500.
74. V. G. Maz'ya and I. E. Verbitsky, The Schrödinger operator on the energy space: Boundedness and compactness criteria, Acta Math 188 (2002), 263-302.
75. B. D. McKay, Asymptotics for symmetric 0-1 matrices with prescribed row sums, Ars Combin 19 (1985), A, 15-25.
76. C. Mode, Multitype branching Processes: Theory and applications, Elsevier, New York, 1971.
77. M. Molloy and B. Reed, A critical point for random graphs with a given degree sequence, Random Struct Alg 6 (1995), 161-179.
78. M. Molloy and B. Reed, The size of the giant component of a random graph with a given degree sequence, Combin Probab Comput 7 (1998), 295-305.
79. s percolation models: the existence of a transition for s ≤ 2, Comm Math Phys 104 (1986), 547-571.
80. M. E. J. Newman, Spread of epidemic disease on networks, Phys Rev E 66 (2002), 016128.
81. M. E. J. Newman, S. H. Strogatz, and D. J. Watts, Random graphs with arbitrary degree distribution and their applications, Phys Rev E 64 (2001), 026118.
82. I. Norros and H. Reittu, On a conditionally Poissonian graph process, Adv Appl Probab 38 (2006), 59-75.
83. R. Pemantle, The contact process on trees, Ann Probab 20 (1992), 2089-2116.
84. O. Riordan, The small giant component in scale-free random graphs, Combin Probab Comput 14 (2005), 897-938.
85. O. Riordan, The k:-core and branching processes, Combin Probab Comput, to appear. Preprint available at http://arXiv.org/math. CO/0511093
86. L. A. Shepp, Connectedness of certain random graphs, Israel J Math 67 (1989), 23-33.
87. B. Simon, Trace ideals and their applications, Cambridge University Press, Cambridge. (1979) LMS Lecture Notes Series, 35.
88. B. Söderberg, General formalism for inhomogeneous random graphs, Phys Rev E 66 (2002), 066121.
89. B. Söderberg, Random graphs with hidden color, Phys Rev E 68 (2003), 015102(R).
90. B. Söderberg, Properties of random graphs with hidden color, Phys Rev E 68 (2003), 026107.
91. B. Söderberg, Random graph models with hidden color, Acta Physica Polonica B 34 (2003), 5085-5102.
92. A. M. Stacey, The existence of an intermediate phase for the contact process on trees, Ann Probab 24 (1996), 1711-1726.
93. T. S. Turova, Dynamical random graphs with memory, Phys Rev E 65 (2002), 066102. Erratum: Phys Rev E 70 (2004), 059902(E).
94. T. S. Turova, Long paths and cycles in dynamical graphs, J Statist Phys 110 (2003), 385-417.
95. T. S. Turova, Continuity of the percolation threshold in randomly grown graphs (to appear).
96. T. S. Turova, Phase transitions in dynamical random graphs, J Stat Phys 123 (2006), 1007-1032.
97. A. Zygmund, Trigonometric series, 2nd ed., Cambridge University Press, Cambridge, 1959.