On a random graph with immigrating vertices: Emergence of the giant component

Random Structures and Algorithms

Volumn 17, Issue 2, 2000, Pages 79-102

  Aldous, David J ^a   Pittel, Boris ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

Branching markov chain; Giant component; Martingale; Multiplicative coalescent; Random graph; Weak convergence correspondence to

Indexed keywords

EID: 0034401314     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/1098-2418(200009)17:2<79::AID-RSA1>3.0.CO;2-W     Document Type: Article

References (19)

1. D.J. Aldous, Brownian excursions, critical random graphs and the multiplicative coalescent, Ann Probab 25 (1997), 812-854.
2. D.J. Aldous, Emergence of the giant component in special Marcus-Lushnikov processes, Random Struct Algorithms 12 (1998), 179-196.
3. D.J. Aldous and V. Limic, The entrance boundary of the multiplicative coalescent, Electron J Probab 3 (1998), 1-59.
4. B. Bollobás, Random graphs, Academic Press, London, 1985.
5. M. Capobianco and O. Frank, Graph evolution by stochastic additions of points and lines, Discrete Math 46 (1983), 133-143.
6. P. Erdos and A. Rényi, On the evolution of random graphs, Publ Math Inst Hungar Acad Sci 5 (1960), 17-61.
7. S.N. Ethier and T.G. Kurtz, Markov processes: Characterization and convergence, Wiley, New York, 1986.
8. G.R. Grimmett, Percolation, Springer-Verlag, Berlin, 1989.
9. S. Janson, D.E. Knuth, T. Łuczak, and B. Pittel, The birth of the giant component, Random Struct Algorithms 4 (1993), 233-358.
10. O. Kallenberg, Foundations of modern probability, Springer-Verlag, Berlin/New York, 1997.
11. V.F. Kolchin, On the behavior of a random graph near a critical point, Theory Probab Appl 31 (1986), 439-451.
12. T. Łuczak, Phase transition phenomena in random discrete structures, Discrete Math 136 (1994), 225-242.
13. T. Łuczak, B. Pittel, and J.C. Wierman, The structure of a random graph at the point of the phase transition, Trans Am Math Soc 341 (1994), 721-748.
14. J.R. Norris, Smoluchowski's coagulation equation: Uniqueness, nonuniqueness and a hydrodynamic limit for the stochastic coalescent, Ann Appl Probab 9 (1999), 78-109.
15. B. Pittel, A random graph with a subcritical number of edges, Trans Am Math Soc 309 (1988), 51-75.
16. B. Pittel, On tree census and the giant component in sparse random graphs, Random Struct Algorithms 1 (1990), 311-342.
17. J.L. Spouge, Solutions and critical times for the monodisperse coagulation equation when a(i, j) = A + B(i + j) + Cij, J Phys A Math Gen 16 (1983), 767-773.
18. V.E. Stepanov, Combinatorial algebra and random graphs, Theory Probab Appl 14 (1969), 373-399.
19. V.E. Stepanov, On some features of the structure of a random graph near a critical point, Theory Probab Appl 32 (1988), 573-594.