Planted clique recovery in random geometric graphs

Konstantin Avrachenkov, Andrei Bobu, Nelly Litvak +1

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 th…