Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Rapid Mixing of Hypergraph Independent Set   We prove that the the mixing time of the Glauber dynamics for sampling
independent sets on $n$-vertex $k$-uniform hypergraphs is $O(n\log n)$ when the
maximum degree $\Delta$ satisfies $\Delta \leq c 2^{k/2}$, improving on the
previous bound [BDK06] of $\Delta \leq k-2$. This result brings the algorithmic
bound to within a constant factor of the hardness bound of [BGG+16] which
showed that it is NP-hard to approximately count independent sets on
hypergraphs when $\Delta \geq 5 \cdot 2^{k/2}$.

21
The categories of this paper are: adap-org
19
The categories of this paper are: eess
18
The categories of this paper are: econ
5
The categories of this paper are: gr-qc
25
The categories of this paper are: patt-sol
14
The categories of this paper are: math-ph
24
The categories of this paper are: dg-ga
15
The categories of this paper are: nucl-ex
17
The categories of this paper are: q-fin
35
The categories of this paper are: mtrl-th
16
The categories of this paper are: stat
31
The categories of this paper are: ao-sci
8
The categories of this paper are: hep-ex
27
The categories of this paper are: comp-gas
0
The categories of this paper are: hep-ph
36
The categories of this paper are: cmp-lg