8 citations · 8 across the 2 of their papers we have counts for
2 papers
math.PR2025
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…
cs.LG2020★ 8 cited
Higher-Order Spectral Clustering for Geometric Graphs
Konstantin Avrachenkov, Andrei Bobu, Maximilien Dreveton
The present paper is devoted to clustering geometric graphs. While the standard spectral clustering is often not effective for geometric graphs, we present an effective generalizat…