Common-neighbor algorithms achieve exact recovery of planted cliques in random geometric graphs with high probability in specific regimes and outperform vertex-degree methods, including detection of edges in connected graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Planted clique recovery in random geometric graphs
Common-neighbor algorithms achieve exact recovery of planted cliques in random geometric graphs with high probability in specific regimes and outperform vertex-degree methods, including detection of edges in connected graphs.