Metraipolis › archive › dc_5ac82e100fc6

Improved polynomial-time algorithms for detecting and recovering planted $Θ(\sqrt{n})$-cliques — arXiv:2609.24780

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.24780
License (as archived)
CC0-1.0
Archived
2026-10-09T22:40:54.283Z
SHA-256 of the archived text
d21022c924257680d51e5257fbbf797c3dddf9e43f5937734ae6c98fab9a066e
Stable URL of this page
https://metraipolis.com/documento/dc_5ac82e100fc6

How to cite

Improved polynomial-time algorithms for detecting and recovering planted $Θ(\sqrt{n})$-cliques — arXiv:2609.24780 — arXiv (en), https://arxiv.org/abs/2609.24780 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5ac82e100fc6 (Metraipolis archive dc_5ac82e100fc6, sha256 d21022c924257680d51e5257fbbf797c3dddf9e43f5937734ae6c98fab9a066e)
BibTeX
@misc{dc5ac82e100fc6,
  title = {Improved polynomial-time algorithms for detecting and recovering planted $Θ(sqrtn)$-cliques — arXiv:2609.24780},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.24780},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5ac82e100fc6; sha256 d21022c924257680d51e5257fbbf797c3dddf9e43f5937734ae6c98fab9a066e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.24780. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In the planted clique problem, one observes either an Erdős--Rényi graph on $n$ vertices or such a graph with a clique added to $k = k(n)$ vertices, and seeks to detect or recover the clique. It is widely believed that $k = \Theta(\sqrt{n})$ is the smallest clique size for which polynomial-time algorithms exist for these tasks. We develop new algorithms in this regime using color-coding to estimate signed subgraph counts, further accelerated with fast matrix multiplication. We first show that, for each $t \geq 1$, for $c(t)$ a constant associated to the order of growth of the number of connected graphs of treewidth at most $t$, cliques of size $k = \lambda\sqrt{n}$ planted in a random location with $\lambda > 1 / \sqrt{c(t)}$ can be detected and recovered in time $n^{t + 1 + o(1)}$. For instance, since $c(1) = e$, this recovers by counting signed trees the performance of the $\widetilde{O}(n^2)$-time message-passing algorithm of Deshpande--Montanari (2015) that succeeds when $\lambda > 1 / \sqrt{e} \approx 0.6066$. For $t \geq 3$, the exact value of $c(t)$ is not known, but lower bounds on it give a hierarchy of slower polynomial-time algorithms that succeed for smaller $\lambda$. We further show that the above algorithm for $t = 2$ can be implemented in time $n^{\omega + o(1)}$ for $\omega$ the constant of square matrix multiplication and succeeds when $\lambda > 0.3320$; under the folklore conjecture that $\omega = 2$, this runs in the nearly-linear time of the algorithm of Deshpande--Montanari while finding smaller cliques. Second, we show that the above algorithm for $t = 1$ can be combined with the boosting scheme of Alon--Krivelevich--Sudakov (1998) using rectangular matrix multiplication, giving improved runtimes for smaller $\lambda$. Taken together, our results achieve the best known tradeoff between runtime and signal strength $\lambda$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Statistics Theory (math.ST).
Pagina del lavoro: https://arxiv.org/abs/2609.24780 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T22:24:05.643Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).