Continuous and discontinuous phase transitions in hypergraph processes

Random Structures and Algorithms

Volumn 24, Issue 4, 2004, Pages 397-419

  Darling, R W R ^a   Levin, David A ^b   Norris, James R ^c  

^a NATIONAL SECURITY AGENCY   (United States)

^b UNIVERSITY OF UTAH   (United States)

^c UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 11144343333     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20013     Document Type: Article

References (12)

1. D. Aldous, Probability approximations via the Poisson clumping heuristic, Springer-Verlag, New York, 1989.
2. P. Billingsley, Convergence of probability measures, 2nd edition, Wiley, New York, 1999.
3. B. Bollobás, Random graphs, 2nd edition, Cambridge University Press, Cambridge, 2001.
4. C. Cooper, The size of the cores of random graphs with a given degree sequence, 2002, preprint.
5. R. W. R. Darling and J. R. Norris, Structure of large random hypergraphs, Ann Appl Probab arXiv:math.PR/0109020 (2004), to appear.
6. L. Devroye, "Branching processes and their applications in the analysis of tree structures and tree algorithms," Probabilistic methods for algorithmic discrete mathematics, Eds. M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed. Springer-Verlag, New York, 1998, pp. 249-314.
7. M. Dwass, The total progeny in a branching process, J Appl Probab 6 (1969), 682-686.
8. N. Fountoulakis, On the structure of the core of sparse random graphs, 2002, preprint.
9. C. A. Goldschmidt and J. R. Norris, Essential edges of Poisson random hypergraphs, Random Structures Algorithms (2004), to appear.
10. O. Kallenberg, Foundations of modern probability, 2nd edition, Springer-Verlag, New York, 2002.
11. J. Jacod and A. N. Shiryaev, Limit theorems for stochastic processes. Springer-Verlag, New York, 1987.
12. B. Pittel, J. Spencer, and N. Wormald, Sudden emergence of a giant k-core in a random graph, J Combin Theory Ser B 67 (1996), 111-151.