4 papers · 1 filter
Finding Adam in noisy trees
Luc Devroye, Gábor Lugosi, Neeladri Maitra
We consider the problem of finding the root vertex of a random uniform attachment tree, when the union of the unlabeled tree and an Erdős-Rényi random graph is ob…
A study of centrality measures in random recursive trees
Richard Coll Josifov, Luc Devroye, Gabor Lugosi
We investigate the behaviour of five classical centrality measures--Jordan, rumor, betweenness, degree, and closeness centralities--in the setting of uniform random recursive trees…
Subtractive random forests with two choices
Francisco Calvillo, Luc Devroye, Gábor Lugosi
Recommendation systems are pivotal in aiding users amid vast online content. Broutin, Devroye, Lugosi, and Oliveira proposed Subtractive Random Forests (\textsc{surf}), a model tha…
Random friend trees
Louigi Addario Berry, Simon Briend, Luc Devroye +3
We study a random recursive tree model featuring complete redirection called the random friend tree and introduced by Saramäki and Kaski. Vertices are attached in a sequential mann…