2 citations · 2 across the 6 of their papers we have counts for
6 papers
The largest common subtree of two random trees
Omer Angel, Caelan Atamanchuk, Anna Brandenberger +2
We study the size and structure of the largest common subtree (LCS) between two independent Bienaymé trees conditioned to have size . When the trees are critical with finite …
Kingman's coalescent on a random graph
Louigi Addario-Berry, Caelan Atamanchuk, Maxwell Kaye
We introduce a generalization of Kingman's coalescent on that we call the Kingman coalescent on a graph . Specifically, we generalize a forest valued representat…
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…
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…