Structure of large random hypergraphs

Annals of Applied Probability

Volumn 15, Issue 1 A, 2005, Pages 125-152

  Darling, R W R ^a   Norris, J R ^b  

^a NATIONAL SECURITY AGENCY   (United States)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Cluster; Component; Hypergraph; Markov process; Random graph

Indexed keywords

EID: 14544286880     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/105051604000000567     Document Type: Article

References (16)

1. ACHLIOPTAS, D. (2001). Lower bounds for random 3-SAT via differential equations. Theoret. Comput. Sci. 265 159-185.
2. ACHLIOPTAS, D., KIROUSIS, L. M., KRANAKIS, E. and KRIZANC, D. (2001). Rigorous results for random (2 + p)-SAT. Theoret. Comput. Sci. 265 109-129.
3. BOLLOBÁS, B. (1985). Random Graphs. Academic Press, London.
4. COPPERSMITH, D., GAMARNIK, D., HAJIAGHAYI, M. and SORKIN, G. B. (2003). Random MAX SAT, random MAX CUT, and their phase transitions. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms 364-373. ACM Press, New York.
5. DARLING, R. W. R., LEVIN, D. A. and NORRIS, J. R. (2004). Continuous and discontinuous phase transitions in hypergraph processes. Random Structures Algorithms 24 379-419.
6. DUCHET, P. (1995). Hypergraphs. In Handbook of Combinatorics (R. L. Graham, M. Grötschel and L. Lovász, eds.) 1 381-432. North-Holland, Amsterdam.
7. ERDÖS, P. and RÉNYI, A. (1960). On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl 5 17-61.
8. ETHIER, S. N. and KURTZ, T. K. (1986). Markov Processes: Characterization and Convergence. Wiley, New York.
9. JACOD, J. and SHIRYAEV, A. N. (1987). Limit Theorems for Stochastic Processes. Springer, Berlin.
10. KALLENBERG, O. (1997). Foundations of Modern Probability. Springer, New York.
11. KAROŃSKI, M. and ŁUCZAK, T. (1996). Random hypergraphs. Bolyai Soc. Math. Stud. 2 283-293.
12. KORDECKI, W. (1985). On the connectedness of random hypergraphs. Comment. Math. Prace Mat. 25 265-283.
13. NORRIS, J. R. (2000). Cluster coagulation. Comm. Math. Phys. 209 407-435.
14. SCHMIDT-PRUZAN, J. and SHAMIR, E. (1985). Component structure in the evolution of random hypergraphs. Combinatorica 5 81-94.
15. WILSON, D. B. (2002). On the critical exponents of random k-SAT. Random Structures Algorithms 21 182-195.
16. WORMALD, N. C. (1995). Differential equations for random processes and random graphs. Ann. Appl. Probab. 5 1217-1235.