Cooley, O., Kang, M. and Koch, C. (2016) “Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs”, The Electronic Journal of Combinatorics, 23(2), p. P2.48. doi: 10.37236/5064.