Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Threshold and hitting time for high-order connectivity in random
  hypergraphs   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 edges intersect in at least $j$ vertices. We
determine the threshold at which the random $k$-uniform hypergraph with edge
probability $p$ becomes $j$-connected with high probability. We also deduce a
hitting time result for the random hypergraph process -- the hypergraph becomes
$j$-connected at exactly the moment when the last isolated $j$-set disappears.
This generalises well-known results for graphs.

18
The categories of this paper are: econ
9
The categories of this paper are: nlin
6
The categories of this paper are: astro-ph
3
The categories of this paper are: physics
20
The categories of this paper are: acc-phys
13
The categories of this paper are: quant-ph
22
The categories of this paper are: chao-dyn
25
The categories of this paper are: patt-sol
31
The categories of this paper are: ao-sci
5
The categories of this paper are: gr-qc
12
The categories of this paper are: nucl-th
15
The categories of this paper are: nucl-ex
33
The categories of this paper are: plasm-ph
1
The categories of this paper are: cs
16
The categories of this paper are: stat
19
The categories of this paper are: eess