Planted clique recovery in random geometric graphs
Journal of Complex Networks · 29.06.2026 · 14 (4)
DOI: 10.1093/comnet/cnag025 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Complex Networks, online erschienen am 06.07.2026. Verfasst von Konstantin Avrachenkov und 3 weiteren Autor:innen. Die Arbeit nennt 20 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: PNRR MUR, Ministero Università e Ricerca.
Abstract (Originalsprache)
We investigate the problem of identifying planted cliques in random geometric graphs, focusing on two distinct algorithmic approaches: the first based on vertex degrees (VD) and the other on common neighbours (CN). We analyse the performance of these methods under varying regimes of key parameters, namely the average degree of the graph and the size of the planted clique. We demonstrate that exact recovery is achieved with high probability as the graph size increases, in a specific set of parameters. Notably, our results reveal that the CN-algorithm significantly outperforms the VD-algorithm. In particular, in the connectivity regime, tiny planted cliques (even edges) are correctly identified by the CN-algorithm, yielding a significant impact on anomaly detection. Finally, our results are confirmed by a series of numerical experiments, showing that the devised algorithms are effective in practice.
Förderung
- PNRR MUR
- Ministero Università e Ricerca
Zitieren
APA
Avrachenkov, K., Bobu, A., Litvak, N., & Michielan, R. (2026). Planted clique recovery in random geometric graphs. Journal of Complex Networks, 14(4). https://doi.org/10.1093/comnet/cnag025
Vancouver
Avrachenkov K, Bobu A, Litvak N, Michielan R. Planted clique recovery in random geometric graphs. Journal of Complex Networks. 2026;14(4). doi:10.1093/comnet/cnag025
BibTeX
@article{Avrachenkov2026,
author = {Avrachenkov, Konstantin and Bobu, Andrei and Litvak, Nelly and Michielan, Riccardo},
title = {Planted clique recovery in random geometric graphs},
journal = {Journal of Complex Networks},
year = {2026},
volume = {14},
number = {4},
doi = {10.1093/comnet/cnag025}
}
EUVIMED