1 citations · 1 across the 7 of their papers we have counts for
3 papers · 1 filter
Estimating the history of a random recursive tree
Simon Briend, Christophe Giraud, Gábor Lugosi +1
This paper studies the problem of estimating the order of arrival of the vertices in a random recursive tree. Specifically, we study two fundamental models: the uniform attachment…
On the quality of randomized approximations of Tukey's depth
Simon Briend, Gábor Lugosi, Roberto Imbuzeiro Oliveira
Tukey's depth (or halfspace depth) is a widely used measure of centrality for multivariate data. However, exact computation of Tukey's depth is known to be a hard problem in high d…
Broadcasting in random recursive dags
Simon Briend, Luc Devroye, Gabor Lugosi
A uniform -{\sc dag} generalizes the uniform random recursive tree by picking parents uniformly at random from the existing nodes. It starts with ''roots''. Each of the…