Threshold and hitting time for high-order connectivity in random hypergraphs

Oliver Cooley, Mihyun Kang, Christoph Koch

We consider the following definition of connectivity in $k$-uniform hypergraphs: Two $j$-sets are $j$-connected if there is a walk of edges between them such that two consecutive e…