Some large deviation results for sparse random graphs

Probability Theory and Related Fields

Volumn 110, Issue 3, 1998, Pages 277-285

  O'Connell, Neil ^a  

^a HEWLETT PACKARD LABORATORIES   (United Kingdom)

Author keywords

Connectivity; Giant component; Isolated vertices

Indexed keywords

EID: 0032023977     PISSN: 01788051     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004400050149     Document Type: Article

References (6)

1. Bollobás, B.: Random Graphs. Academic Press 1985
2. Bollobás, B.: The evolution of sparse random graphs. In: Bollobás, B. (ed.) Graph Theory and Combinatorics, Academic Press 1984
3. Janson, S., Knuth, D., Luczak, T., Pittel, B.: The birth of the giant component. Rand. Struct. Alg. 4, 233-358 (1993)
4. O'Connell, N.: From laws of large numbers to large deviation principles. Markov Proc. Rel. Fields (to appear)
5. Spencer, J.: Nine Lectures on Random Graphs. Ecole d' Eté de Probabilite's de Saint-Flour XXI-1991 (P.L. Hennequin, ed.) Lecture Notes in Mathematics 1541, Springer-Verlag, pp 293-347.
6. Wright, E.M.: The number of connected sparsely edged graphs. J. Graph Theor. 1, 317-330 (1977)