Showing math.PRShow all
3 papers · 1 filter
math.PR2026
History estimation in random recursive trees: Pointwise approach via iterated Jordan centralities
Johannes Bäumler, Simon Briend, Joost Jorritsma
We study the problem of estimating the arrival times of vertices in a uniform random recursive tree from its unlabeled structure. We adopt a pointwise perspective and analyze the d…
math.PR2026
Does freezing impede the growth of random recursive trees?
Anna Brandenberger, Simon Briend, Hannah Cairns +2
Uniform attachment with freezing is an extension of the classical model of random recursive trees, in which trees are recursively built by attaching new vertices to old ones. In th…
math.PR2024
Leaf Stripping on Uniform Attachment Trees
Louigi Addario-Berry, Anna Brandenberger, Simon Briend +2
In this note we analyze the performance of a simple root-finding algorithm in uniform attachment trees. The leaf-stripping algorithm recursively removes all leaves of the tree for…