On the Fluctuations of the Giant Component

Combinatorics Probability and Computing

Volumn 9, Issue 4, 2000, Pages 287-304

  Barraez, D ^a   Boucheron, S ^b   Fernandez De La Vega, W ^b  

^a FACULTAD DE CIENCIAS   (Venezuela)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034371726     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548300004302     Document Type: Article

References (13)

1. Ajtai, M., Komlós, J. and Szemerédi, E. (1981) The longest path in a random graph. Combinatorica 1 1-12.
2. Aldous, D. (1997) Brownian excursions, critical random graphs and the multiplicative coalescent. Ann. Probab. 25 812-854.
3. Alon, N. and Spencer, J. (1992) The Probabilistic Method, Wiley.
4. Bollobás, B. (1985) Random Graphs, Academic Press.
5. Dudley, R. (1989) Real Analysis and Probability, Wadsworth and Brooks.
6. Durrett, R. (1991) Probability: Theory and Examples, Wadsworth and Brooks.
7. Erdos, P. and Rényi, A. (1960) On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci. 5 17-61.
8. Fernandez de la Vega, W. (1986) Induced trees in sparse random graphs. Graphs and Combinatorics 2 227-231.
9. Hall, P. and Heyde, C. C. (1980) Martingale Limit Theory and its Application, Academic Press.
10. Karp, R. (1990) The transitive closure of a random digraph. Random Struct. Algorithms 1 73-93.
11. O'Connell, N. (1998) Some large deviations results for sparse random graphs. Probability Theory and Related Fields 110 277-285.
12. Pittel, B. (1990) On tree census and the giant component in sparse random graphs. Random Struct. Algorithms 1 311-342.
13. m(t). Theory Probab. Appl. XV 55-66.