Estimating the history of a random recursive tree

no code implementations • 14 Mar 2024 • Simon Briend, Christophe Giraud, Gábor Lugosi, Déborah Sulem

This paper studies the problem of estimating the order of arrival of the vertices in a random recursive tree.

On the quality of randomized approximations of Tukey's depth

no code implementations • 11 Sep 2023 • Simon Briend, Gábor Lugosi, Roberto Imbuzeiro Oliveira

Tukey's depth (or halfspace depth) is a widely used measure of centrality for multivariate data.

Broadcasting in random recursive dags

no code implementations • 2 Jun 2023 • Simon Briend, Luc Devroye, Gabor Lugosi

The parents' bits are flipped with probability $p$, and a majority vote is taken.

Archaeology of random recursive dags and Cooper-Frieze random networks

no code implementations • 29 Jul 2022 • Simon Briend, Francisco Calvillo, Gábor Lugosi

We study the problem of finding the root vertex in large growing networks.