2 citations · 4 across the 7 of their papers we have counts for
7 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…
Tree height and the asymptotic mean of the Colijn-Plazzotta rank of unlabeled binary rooted trees
Luc Devroye, Michael R. Doboli, Noah A. Rosenberg +1
The Colijn--Plazzotta ranking is a bijective encoding of the unlabeled binary rooted trees with positive integers. We show that the rank of a tree is closely related to…
An asymptotically optimal algorithm for generating bin cardinalities
Luc Devroye, Dimitrios Los
In the balls-into-bins setting, balls are thrown uniformly at random into bins. The naïve way to generate the final load vector takes time. However, it is well-known…
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…
An Algorithm to Recover Shredded Random Matrices
Caelan Atamanchuk, Luc Devroye, Massimo Vicenzo
Given some binary matrix , suppose we are presented with the collection of its rows and columns in independent arbitrary orderings. From this information, are we able to recover…
Two-way Linear Probing Revisited
Ketan Dalal, Luc Devroye, Ebrahim Malalla
We introduce linear probing hashing schemes that construct a hash table of size , with constant load factor , on which the worst-case unsuccessful search time is asymptotical…