Essential edges in poisson random hypergraphs

Random Structures and Algorithms

Volumn 24, Issue 4, 2004, Pages 381-396

  Goldschmidt, Christina ^a,b   Norris, James ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b SORBONNE UNIVERSITÉ   (France)

Author keywords

2 core; Essential edges; Giant component; Poisson random hypergraphs

Indexed keywords

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

References (7)

1. B. Bollobás, Random graphs, Academic Press, New York, 1985.
2. R. W. R. Darling, D. A. Levin, and J. R. Norris, Continuous and discontinuous phase transitions in hypergraph processes. Random Structures Algorithms to appear (also preprint math.PR/0312451 on http://xxx.1an1.gov), 2003.
3. R. W. R. Darling and J. R. Norris, Structure of large random hypergraphs, Ann Appl Probab to appear (also preprint math.PR/0109020 on http://xxx.1an1.gov), 2002.
4. C. A. Goldschmidt, Large random hypergraphs, Ph.D. thesis, University of Cambridge, 2003. Available from http://www.statslab.cam.ac.uk/~cag27/.
5. T. E. Harris, The theory of branching processes, Springer-Verlag, New York, 1963.
6. S. Janson, T. Łuczak, and A. Ruciński, Random graphs, Wiley, New York, 2000.
7. B. Pittel, On tree census and the giant component in sparse random graphs, Random Structures Algorithms 1 (1990), 311-342.