Weak recovery in the non-uniform HSBM is possible above the sum of per-layer SNRs equaling 1, achieved by an optimally weighted non-backtracking spectral algorithm.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Spectral norm test and leading-eigenvector method achieve detection and exact recovery of planted cliques from hypergraph adjacency matrices at the sqrt(n) scale.
citing papers explorer
-
Achieving the Kesten-Stigum bound in the non-uniform hypergraph stochastic block model
Weak recovery in the non-uniform HSBM is possible above the sum of per-layer SNRs equaling 1, achieved by an optimally weighted non-backtracking spectral algorithm.
-
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.