Showing math.PRShow all
3 papers · 1 filter
math.PR2026
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…
math.PR2026
Large deviations for subgraphs in inhomogeneous random graphs
Riccardo Michielan, Clara Stegehuis, Bert Zwart
Inhomogeneous random graphs are fundamental models for real-world networks, where prescribed degrees are imposed as soft constraints. A common assumption in such models is that the…
math.PR2024
Optimal subgraphs in geometric scale-free random graphs
Riccardo Michielan, Clara Stegehuis, Matthias Walter
Geometric scale-free random graphs are popular models for networks that exhibit as heavy-tailed degree distributions, small-worldness and high clustering. In these models, vertices…