4 papers
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…
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…
Learning latent tree models with small query complexity
Luc Devroye, Gabor Lugosi, Piotr Zwiernik
We consider the problem of structure recovery in a graphical model of a tree where some variables are latent. Specifically, we focus on the Gaussian case, which can be reformulated…