Ch. 2. Models of random graphs and their applications

Handbook of Statistics

Volumn 21, Issue , 2003, Pages 51-91

  Cannings, C ^a   Penman, D B ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346245793     PISSN: 01697161     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0169-7161(03)21004-X     Document Type: Review

References (128)

1. Aldous D. A random tree model associated with random graphs. Random Structures Algorithms 1 (1990) 383-402
2. Aldous D. Tree-valued Markov chains and Poisson-Galton-Watson distributions. In: Aldous D., and Propp J. (Eds). Microsurveys in Discrete Probability. DIMACS Ser. Discrete Math. Theoret. Comp. Sci. Vol. 41 (1998)
3. (A revised edition appeared in 2000.). Alon N., and Spencer J.H. The Probabilistic Method. With an appendix by Paul Erdo{double acute}s. 2nd ed. (1992), Wiley, London
4. Alon N., Krivelevich M., and Sudakov B. Finding a large hidden clique in a random graph. Random Structures Algorithms 13 (1998) 457-466
5. Amit A., Linial N., Matoušek J., and Rozenman E. Random lifts of graphs. Proceedings of the 12th annual ACM-SIAM Symposium on Discrete Algorithms (2001), SIAM, New York 883-894
6. Amit A., Linial N., and Matoušek J. Random lifts of graphs; Independence and chromatic number. Random Structures Algorithms 20 (2002) 1-22
7. Amit A., and Linial N. Random graph coverings I. General theory and graph connectivity. Combinatorica 22 (2002) 1-18
8. Andersson H., and Britton T. Stochastic Epidemic Models and Their Statistical Analysis. Springer Lecture Notes in Statist. Vol. 151 (2000)
9. d. Adv. Appl. Probab. 29 (1997) 567-581
10. d. Adv. Appl. Probab. 29 (1997) 582-594
11. Balińska K., Godehardt E., and Quintas L.V. When is the f-graph process the Erdo{double acute}s-Rényi graph process?. Sci. Ser. A. Math. (N.S.) (1991) 15-19
12. Barbour A.D., Holst L., and Janson S. Poisson Approximation. Oxford Mathematical Monographs Vol. 2 (1990), Clarendon Press, Philadelphia
13. Barbour A.D., and Mollison D. Random graphs and epidemics. In: Lefevre, and Gabriel (Eds). Lecture Notes in Biomathematics Vol. 89 (1987), Springer, Oxford
14. Barbour A.D., and Reinert G. Small worlds. Random Structures Algorithms 19 (2001) 54-74
15. Biggins J.D., and Grey D.R. A note on the growth of random trees. Statist. Probab. Lett. 32 (1997) 339-342
16. To appear. Biggins J.D., and Penman D.B. Large deviations in random randomly coloured graphs (2003)
17. To appear. Biggins J.D., and Penman D.B. FKG-like inequalities in random randomly coloured graphs (2003)
18. (A second revised edition was published by Cambridge University Press as Vol. 73 of the Cambridge Studies in Advanced Mathematics in 2001.). Bollobás B. Random Graphs (1985), Academic Press, London
19. Bollobás B. Combinatorics (1986), Cambridge University Press, London
20. Bollobás B. Modern Graph Theory. Graduate Texts in Mathematics Vol. 184 (1998), Springer-Verlag, New York
21. Bollobás B., and Frieze A. On matchings and Hamilton cycles in random graphs. Ann. Discrete Math. 28 (1985) 23-46
22. Bollobás B., Grimmett G.R., and Janson S. The random-cluster model on the complete graph. Probab. Theory Related Fields 104 (1996) 283-317
23. Bollobás B., Kohayakawa Y., and Łuczak T. Connectivity properties of random subgraphs of the cube. Random Structures Algorithms 6 (1995) 221-230
24. Bollobás B., Kohayakawa Y., and Łuczak T. On the diameter and radius of random subgraphs of the cube. Random Structures Algorithms 5 (1994) 627-648
25. Research Paper 18 20 pp. (electronic). Bollobás B., and Riordan O. Constrained graph processes. Electron. J. Combin. 7 (2000)
26. Bollobás B., and Riordan O. Mathematical results on scale-free graphs. In: Bornholdt S., and Schuster H. (Eds). Handbook of Graphs and Networks (2002), Wiley-VCH, New York
27. Bollobás B., and Thomason A.G. Threshold functions. Combinatorica 7 (1987) 35-38
28. Bollobás B., and Thomason A.G. The structure of hereditary properties and colourings of random graphs. Combinatorica 20 (2000) 173-202
29. Bourgain J., and Kalai G. Threshold intervals under group symmetries. In: Berkeley C.A. (Ed). Convex Geometric Analysis. MSRI Publications Vol. 34 (1999), Cambridge University Press, Berlin 59-63
30. Cameron P.J. The random graph. The Mathematics of Paul Erdo{double acute}s. Algorithms Combinatorics Vol. 14 (1996) 333-351
31. Cameron P.J. First-order logic. In: Wilson R.J., and Beincke L. (Eds). Graph Connections: Relationships Between Graph Theory and Other Parts of Mathematics (1999), Oxford University Press
32. Cannings C. Evolutionarily Stable Strategies. Encycl. Maths. Supplement Vol. 1 (1997), Kluwer Academic Publishers, Dordrecht
33. Carr R., Goh W., and Schmutz E. The maximum degree in a random tree and related problems. Random Structures Algorithms 5 (1994) 13-24
34. Cohen J.E. Random graphs in ecology. Topics in Contemporary Probability and its Applications (1995), Probab. Stochastics Ser. CRC, Dordrecht 233-260
35. Version at. Cooper C., and Frieze A. On a model of random web graphs. Proceedings of ESA2001 (2002). http://www.math.cmu.edu/~aflp/papers.html
36. Cooper C., Frieze A., and Reed B. Random regular graphs of non-constant degree: connectivity and Hamiltonicity. Combin. Probab. Comput. 11 (2002) 249-261
37. Cooper C., Frieze A., Reed B., and Riordan O. Random regular graphs of non-constant degree; independence and chromatic number. Combin. Probab. Comput. 11 (2002) 323-341
38. Denise A., Vasconcellos M., and Welsh D. The random planar graph. Congr. Numer. 113 (1996) 61-79
39. Diaz J., Petit J., Penrose M.D., and Serna M. Convergence theorems for some layout measures on random lattice and random geometric graphs. Combin. Probab. Comput. 9 (2000) 489-511
40. Diestel R. Graph Theory. Graduate Texts in Math. Vol. 173 (1997), Springer, Boca Raton, FL
41. Drmota M., and Gittenberger B. The distribution of nodes of given degree in random trees. J. Graph Theory 31 (1999) 227-253
42. Erdo{double acute}s P., Suen S., and Winkler P. On the size of a random maximal graph. Random Structures Algorithms 6 (1995) 309-318
43. Fill J.A., Scheinerman E.R., and Singer-Cohen K.B. On random intersection graphs when m = ω(n). Random Structures Algorithms 16 (2000) 156-176
44. (Rome, 2000). Fernandez de la Vega W. The independence number of random interval graphs. Algorithms and Complexity. Lecture Notes in Comput. Sci. Vol. 1767 (2000), Springer, Berlin 59-62
45. (Brussels, 1987). Flajolet P. Random tree models in the analysis of algorithms. Performance '87 (1988), North-Holland, Berlin 171-187
46. Fremlin D.H., and Talagrand M. Subgraphs of random graphs. Trans. Amer. Math. Soc. 291 (1985) 551-582
47. (with an appendis by J. Bourgain). Friedgut E. Sharp thresholds and the k-SAT problem. J. Amer. Math. Soc. 12 (1999) 1017-1054
48. Frieze A., and McDiarmid C. Algorithmic theory of random graphs. Random Structures Algorithms 10 (1997) 5-42
49. Frieze A., and Reed B. Probabilistic analysis of algorithms. Probabilistic Methods for Algorithmic Discrete Mathematics. Algorithms Combinatorics Vol. 16 (1998), Springer, Amsterdam 36-92
50. Garey M.R., and Johnson D.S. Computers and Intractability, A Guide to the Theory of NP-completeness. A Series of Books in the Mathematical Sciences (1979), W. H. Freeman, Berlin
51. (Poznan, 1987). Godehardt E. Connectivity of random graphs of small order and statistical testing. Random Graphs '87 (1990), Wiley, San Francisco, CA 61-72
52. Godehardt E. Graphs as Structural Models. The Application of Graphs and Multigraphs in Cluster Analysis. 2nd ed. Advances in System Analysis Vol. 4 (1990), Friedr. Vieweg und Sohn, Chichester
53. (Petrozavodsk, 1996). Godehardt E., and Harris B. Asymptotic properties of random interval graphs and their use in cluster analysis. Probabilistic Methods in Discrete Mathematics (1997), VSP, Braunschweig 19-30
54. Godehardt E., and Jaworski J. On the connectivity of a random interval graph. Random Structures Algorithms 9 (1996) 137-161
55. Grimmett G.R. The stochastic random-cluster process and the uniqueness of random-cluster measures. Ann. Probab. 23 (1995) 1461-1510
56. Grimmett G.R. Percolation. Grundlehren Math. Wiss. 2nd ed. B. 321 (1999), Springer-Verlag, Utrecht
57. (Russian). Ivehenko G.I. Unequally probable random graphs. Trudy. Mosk. Inst. Electr. Mas. 44 (1975) 34-66
58. Janson S., Łuczak T., and Ruciński A. Random Graphs (2000), Wiley, Berlin
59. Janson S., Knuth D.E., Łuczak T., and Pittel B. The birth of the giant component. Random Structures Algorithms 4 (1994) 233-258
60. Jonasson J. The random triangle model. J. Appl. Probab. 36 (1999) 852-867
61. Jonasson J., and Häggström O. Phase transition in the random triangle model. J. Appl. Probab. 36 (1999) 1101-1115
62. Juhász F. The asymptotic behaviour of Fiedler's algebraic connectivity. Discrete Math. 96 (1991) 59-63
63. Chapter in. Karoński M. Random graphs. In: Graham R., Grotschel M., and Lovasz L. (Eds). Handbook of Combinatorics (1995), North-Holland, New York 351-380
64. Karoński M., and Łuczak T. Random hypergraphs. Combinatorics. Paul Erdo{double acute}s is Eighty Vol. 2 (1996) 283-293
65. Keszthely. Bolyai Soc. Math. Stud. Vol. 2 (1993), Janos Bolyai Math. Soc., Budapest
66. Karoński M., Scheinerman E., and Singer-Cohen K.B. On random intersection graphs: the subgraph problem. Combin. Probab. Comput. 8 (1999) 131-159
67. Karoński M., and Szymkowiak M. On a solution of a randomized three tracks version of the Gate Matrix Layout Problem. Discrete Math. 236 (2001) 179-189
68. Kauffman S. The Origins of Order (1993), Oxford University Press, Budapest
69. Kim J.H., and Wormald N.C. Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs. J. Combin. Theory Ser. B 81 (2001) 20-44
70. Kolchin V.F. Random Graphs. Encyclopedia of Mathematics and its Applications Vol. 53 (1999), Cambridge University Press, Cambridge
71. (Russian). Kovalenko I.N. On the structure of random directed graphs. Theory Probab. Math. Statist. 6 (1975) 83-92
72. (MathInfo'2002). Krivelevich M. Coloring random graphs - an algorithmic perspective. In: Chauvin B., et al. (Ed). Proceedings of the 2nd Colloquium on Mathematics and Computer Science (2002), Birkhäuser, Cambridge 175-195
73. Krivelevich M., and Sudakov B. The chromatic numbers of random hypergraphs. Random Structures Algorithms 21 (1998) 381-403
74. Krivelevich M., Sudakov B., Vu V.H., and Wormald N. Random regular graphs of high degree. Random Structures Algorithms 18 (2002) 346-363
75. Łuczak T. Phase transition phenomena in random discrete structures. Discrete Math. 136 (1994) 225-242
76. (Poznan, 1987). Maehara H. On the intersection graph of random ares on the circle. Random Graphs '87 (1990), Wiley, Basel 159-173
77. McColm G.L. First order zero-one laws for random graphs on the circle. Random Structures Algorithms 14 (1999) 239-266
78. Submitted: version at. McColm G. Threshold functions for random graphs on a line segment (2003). http://www.math.usf.edu/~mccolm/research/Research.html
79. McDiarmid C. On the method of bounded differences. Surveys in Combinatorics. London Math. Soc. Lecture Note Series Vol. 141 (1989) 148-188
80. Chapter in. McDiarmid C. Concentration. In: Habib M., McDiarmid C., Ramirez J., and Reed B. (Eds). Probabilistic Methods for Discrete Mathematics (1998), Springer-Verlag, Chichester
81. McDiarmid C. On the chromatic number of random graphs. Random Structures Algorithms 1 (1990) 435-442
82. Available at. McKay B.D. Tables of combinatorial data (2001). http://cs.anu.edu/people/bdm/data
83. Meir A., and Moon J.W. The expected node-independence number of random trees. Indag. Math. 35 (1973) 335-341
84. Molloy M., and Reed B. A critical point for random graphs with a given degree sequence. Random Structures Algorithms 6 (1995) 161-179
85. Molloy M., and Reed B. The size of the giant component of a random graph with a given degree sequence. Combin. Probab. Comput. 7 (1998) 295-305
86. Moon J.W. On the maximum degree in a random tree. Michigan Math. J. 15 (1968) 429-432
87. Moon J.W. On the bipartition numbers of random trees. Eleventh British Combinatorial Conference. (London, 1987). Ars Combin. Vol. 25 (1988) 3-10
88. Najock D., and Heyde C.C. On the number of terminal vertices in certain random trees with an application to stemma construction in philology. J. Appl. Probab. 19 (1982) 675-680
89. O'Connell N. Some large deviation results for sparse random graphs. Probab. Theory Related Fields 110 (1998) 277-285
90. Osthus D., and Taraz A. Random maximal H-free graphs. Random Structures Algorithms 18 (2001) 61-82
91. To appear. Osthus D., Prömel H.-J., and Taraz A. On random planar graphs, the number of planar graphs and their triangulations. J. Combin. Theory Ser. B (2002)
92. Palmer E.M. Graphical Evolution. An Introduction to the Theory of Random Graphs (1985), Wiley, Chichester
93. Penman D.B. Random graphs with correlation structure. Ph.D. thesis (1998), University of Sheffield, Chichester
94. To appear. Penman D.B. Trees and cycles in random randomly coloured graphs (2003)
95. p,q model of random graphs (2003)
96. Penrose M.D. The longest edge of the random minimal spanning tree. Ann. Appl. Probab. 7 (1997) 340-361
97. Penrose M.D. Extremes for the minimal spanning tree on normally distributed points. Adv. Appl. Probab. 30 (1998) 628-639
98. Penrose M.D. Random minimal spanning tree and percolation on the N-cube. Random Structures Algorithms 12 (1998) 63-82
99. Penrose M.D. On k-connectivity for a geometric random graph. Random Structures Algorithms 15 (1999) 145-164
100. Penrose M.D. Vertex ordering and partitioning problems for random spatial graphs. Ann. Appl. Probab. 10 (2000) 517-538
101. To appear. Penrose M.D. Random Geometric Graphs (2003), Oxford University Press
102. Penrose M.D., and Henze N. On the multivariate runs test. Ann. Statist. 27 (1999) 290-298
103. Pippinger N. Random interval graphs. Random Structures Algorithms 12 (1998) 361-380
104. Pittel B., Woyczynski W.A., and Mann J.A. Random tree-type partitions as a model for acyclic polymerization: Holtsmark 3/2-stable distribution of the supercritical gel. Ann. Probab. 18 (1990) 319-341
105. Available at. Prisner E. Electronic notes on intersection graphs (2001). http://www.math.unihamburg.de/spag/gd/mitarbeiter/prisner/prisner.html
106. Prömel H.-J., Schickinger T., and Steger A. On the structure of clique-free graphs. Random Structures Algorithms 19 (2001) 37-53
107. Reidys C.M. Random induced subgraphs of generalized n-cubes. Adv. Appl. Math. 19 (1997) 360-377
108. Reidys C.M. Random subgraphs of Cayley graphs over p-groups. Europ. J. Combin. 21 (2000) 1057-1066
109. Available at. Royle G.F. Electronic tables of graphs of small order (2001). http://www.cs.uwa.edu.au/~gordon/remote/data.html
110. (Poznan, 1989). Ruciński A. Proving normality in combinatorics. Random Graphs Vol. 2 (1992), Wiley, New York 215-231
111. Ruciński A., and Wormald N.C. Random graph processes with degree restrictions. Combin. Probab. Comput. 1 (1992) 169-180
112. Ruciński A., and Wormald N.C. Random graph processes with maximum degree 2. Ann. Appl. Probab. 7 (1997) 183-200
113. Ruciński A., and Wormald N. Connectedness of graphs generated by a random d-process. J. Austral. Math. Soc. 72 (2002) 67-86
114. Scheinerman E.R. Random interval graphs. Combinatorica 8 (1988) 357-371
115. Scheinerman E.R. An evolution of interval graphs. Discrete Math. 82 (1990) 287-302
116. Schmidt-Pruzan J., and Shamir E. Component structure in the evolution of random hypergraphs. Combinatorica 5 (1985) 81-94
117. Shepp L.A. Connectedness of certain random graphs. Israel J. Math. 67 (1989) 23-33
118. Stark D. Compound Poisson approximation for subgraph counts in random graphs. Random Structures Algorithms 18 (2001) 39-60
119. Steele J.M. Probabilistic and worst-case analysis of classical problems of combinatorial optimisation in Euclidean space. Math. Oper. Res. 15 (1990) 749-770
120. Preprint. Szymkowiak M. Tree obstructions for the k-Gate Matrix Layout Problem (2002), Technical University of Poznan, New York
121. Thomason A.G. A graph property not satisfying a "zero-one law". Europ. J. Combin. 9 (1988) 517-521
122. (Bayreuth, 1991). Tinhofer G. Verfahrensmuster zur Erzeugung von Zufallsgraphen. Konstruktive Anwendungen von Algebra und Kombinatorik (Examples of procedures for the generation of random graphs). Bayreuth. Math. Schr. Vol. 43 (1993) 127-169
123. Vickers G.T., and Cannings C. Patterns of ESSs I, II. J. Theoret. Biol. 132 (1988) 387-408
124. Vickers G.T., and Cannings C. Patterns of ESSs I, II. J. Theoret. Biol. 132 (1988) 409-420
125. Watts D.J. Small Worlds: The Dynamics of Networks between Order and Randomness (1999), Princeton University Press, Princeton, NJ
126. Welsh D.J.A. The random cluster process. Discrete Math. 136 (1994) 373-390
127. Wormald N.C. Differential equations for random processes and random graphs. Ann. Appl. Probab. 5 (1995) 1217-1235
128. Wormald N.C. Models of random regular graphs. In: Lamb J.D., and Preece D.A. (Eds). Surveys in Combinatorics. London Math. Soc. Lecture Note Series Vol. 267 (1999), Cambridge University Press, Princeton, NJ 239-298