Spectral and SDP algorithms using signed triangle count matrices recover planted triangle-dense subgraphs, with computational threshold at least sqrt(n) for low-degree methods versus information-theoretic threshold at most logarithmic in n.
Graph matrices: Norm bounds and applications.arXiv preprint arXiv:1604.03423,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Spectral recovery of a planted triangle-dense subgraph
Spectral and SDP algorithms using signed triangle count matrices recover planted triangle-dense subgraphs, with computational threshold at least sqrt(n) for low-degree methods versus information-theoretic threshold at most logarithmic in n.