Spectral norm test and leading-eigenvector method achieve detection and exact recovery of planted cliques from hypergraph adjacency matrices at the sqrt(n) scale.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.ST 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Planted clique detection and recovery from the hypergraph adjacency matrix
Spectral norm test and leading-eigenvector method achieve detection and exact recovery of planted cliques from hypergraph adjacency matrices at the sqrt(n) scale.