3 papers
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.PR2025
The critical percolation window in growing random graphs
Joost Jorritsma, Pascal Maillard, Peter Mörters
We describe the critical window for percolation in the universality class of sparse growing random graphs. In our models, vertices arrive sequentially and connect independently to…
math.PR2025
An elementary proof of the bunkbed conjecture for forests
Serte Donderwinkel, Joost Jorritsma, Guillem Perarnau
Although false for general graphs, this note gives an elementary proof of the bunkbed conjecture for any acyclic graph. The argument is short and self-contained, and may be of educ…