19 citations · 34 across the 9 of their papers we have counts for
5 papers · 1 filter
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…
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…
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…
Geometric random intersection graphs with general connection probabilities
Maria Deijfen, Riccardo Michielan
Let and be the point sets of two independent homogeneous Poisson processes on . A graph with vertex set $\mathca…
Cliques in geometric inhomogeneous random graph
Riccardo Michielan, Clara Stegehuis
Many real-world networks were found to be highly clustered, and contain a large amount of small cliques. We here investigate the number of cliques of any size k contained in a geom…