r-uniform Erdős-Rényi hypergraphs exhibit a spectral gap at m ≫ n^{r/2}, proved via an explicit selector process decomposition that also yields sparse tensor norm bounds and a tensor analogue of Seginer's theorem.
Symposium on Theory of Computing (STOC) , pages =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Norm Bounds for Sparse Random Tensors and Spectral Gap of Random Hypergraphs
r-uniform Erdős-Rényi hypergraphs exhibit a spectral gap at m ≫ n^{r/2}, proved via an explicit selector process decomposition that also yields sparse tensor norm bounds and a tensor analogue of Seginer's theorem.