563 citations · 1.2k across the 52 of their papers we have counts for
72 papers
Uniform temporal trees
Caelan Atamanchuk, Luc Devroye, Gabor Lugosi
Motivated by the study of random temporal networks, we introduce a class of random trees that we coin \emph{uniform temporal trees}. A uniform temporal tree is obtained by assignin…
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…
Property testing in graphical models: testing small separation numbers
Luc Devroye, Gábor Lugosi, Piotr Zwiernik
In many statistical applications, the dimension is too large to handle for standard high-dimensional machine learning procedures. This is particularly true for graphical models, wh…
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…
On the size of temporal cliques in subcritical random temporal graphs
Caelan Atamanchuk, Luc Devroye, Gabor Lugosi
A \emph{random temporal graph} is an Erdős-Rényi random graph , together with a random ordering of its edges. A path in the graph is called \emph{increasing} if the edges o…
A note on estimating the dimension from a random geometric graph
Caelan Atamanchuk, Luc Devroye, Gabor Lugosi
Let be a random geometric graph with vertex set based on i.i.d.\ random vectors drawn from an unknown density on . An edge is pre…