4 citations · 4 across the 3 of their papers we have counts for
4 papers
On the largest common subtree of uniform attachment trees
Johannes Bäumler, Céline Kerriou, Bas Lodewijks +4
We study the largest common subtree of two independent unlabeled uniform attachment trees (also known as random recursive trees). Our main result shows that, when the two trees hav…
Crossing probabilities in geometric inhomogeneous random graphs
Emmanuel Jacob, Céline Kerriou, Amitai Linker +1
In a geometric inhomogeneous random graph vertices are given by the points of a Poisson process and are equipped with independent weights following a heavy tailed distribution. Any…
Condensation in scale-free geometric graphs with excess edges
Remco van der Hofstad, Pim van der Hoorn, Céline Kerriou +2
We identify the upper large deviation probability for the number of edges in scale-free geometric random graph models as the space volume goes to infinity. Our result covers the mo…
The fewest-big-jumps principle and an application to random graphs
Céline Kerriou, Peter Mörters
We prove a large deviation principle for the sum of n independent heavy-tailed random variables, which are subject to a moving cut-off boundary at location n. Conditional on the su…