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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
ACCEPT 2representative citing papers
A spectral algorithm with minimax-optimal guarantees is proposed for directly estimating bilinear forms in Tucker2 tensor panels with staggered-adoption missingness.
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.
-
Direct and efficient estimation of bilinear forms in staggered tensor panels
A spectral algorithm with minimax-optimal guarantees is proposed for directly estimating bilinear forms in Tucker2 tensor panels with staggered-adoption missingness.