2 citations · 4 across the 7 of their papers we have counts for
Showing math.PRShow all
3 papers · 1 filter
math.PR2025
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…
math.PR2024★ 2 cited
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…
math.PR2023
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…