[1] Aronshtam, L. and Linial, N. (2015) When does the top homology of a random simplicial complex vanish? Random Struct. Alg. 46 26–35.

[2] Aronshtam, L. and Linial, N. (2016) The threshold for *d*-collapsibility in random complexes. Random Struct. Alg. 48 260–269.

[3] Aronshtam, L., Linial, N., Łuczak, T. and Meshulam, R. (2013) Collapsibility and vanishing of top homology in random simplicial complexes. Discrete Comput. Geom. 49, no. 2, 317–334.

[4] Behrisch, M., Coja-Oghlan, A. and Kang, M. (2010) The order of the giant component of random hypergraphs. Random Struct. Alg. 36 149–184.

[5] Behrisch, M., Coja-Oghlan, A. and Kang, M. (2014) Local limit theorems for the giant component of random hypergraphs. Combin. Probab. Comput. 23 331–366.

[6] Bohman, T. (2009) The triangle-free process. Adv. Math. 221 1653–1677.

[7] Bollobás, B. (1984) The evolution of random graphs. Trans. Amer. Math. Soc. 286 257–274.

[8] Bollobás, B. (2001) Random Graphs, second edition, Cambridge University Press.

[9] Bollobás, B. and Riordan, O. (2012) Asymptotic normality of the size of the giant component in a random hypergraph. Random Struct. Alg. 41 441–450.

[10] Cooley, O., Kang, M. and Koch, K. The size of the giant component in random hypergraphs. Random Struct. Alg., DOI: 10.1002/rsa.20761.

[11] 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.

[12] Janson, S., Łuczak, T. and A. Ruciński, A. (2000) Random Graphs, Wiley.

[13] Karoński, M. and Łuczak, T. (2002) The phase transition in a random hypergraph. J. Comput. Appl. Math. 142 125–135.

[14] Krivelevich, M. and Sudakov, B. (2013) The phase transition in random graphs: A simple proof. Random Struct. Alg. 43 131–138.

[15] Linial, N. and Meshulam, R. (2006) Homological connectivity of random 2-complexes. Combinatorica 26 475–487.

[16] Lu, L. and Peng, X. High-order phase transition in random hypergraphs. arXiv:1409.1174

[17] Łuczak, T. (1990) Component behavior near the critical point of the random graph process. Random Struct. Alg. 1 287–310.

[18] Molloy, M. (2005) Cores in random hypergraphs and boolean formulas. Random Struct. Alg. 27 124–135.

[19] Nachmias, A. and Peres, Y. (2010) The critical random graph, with martingales. Israel J. Math. 176 29–41.

[20] Ravelomanana, and Rijamamy, (2006) Creation and growth of components in a random hypergraph process. In COCOON 2006: Computing and Combinatorics, Springer, pp. 350–359.

[21] Schmidt-Pruzan, J. and E. Shamir, E. (1985) Component structure in the evolution of random hypergraphs. Combinatorica 5 81–94.