6 papers
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…
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…
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…
Optimization under rare events: scaling laws for linear chance-constrained programs
Jose Blanchet, Joost Jorritsma, Bert Zwart
We consider a class of chance-constrained programs in which profit needs to be maximized while enforcing that a given adverse event remains rare. Using techniques from large deviat…
Large deviations of the giant in supercritical kernel-based spatial random graphs
Joost Jorritsma, Júlia Komjáthy, Dieter Mitsche
We study cluster sizes in supercritical -dimensional inhomogeneous percolation models with long-range edges -- such as long-range percolation -- and/or heavy-tailed degree distr…
Cluster-size decay in supercritical kernel-based spatial random graphs
Joost Jorritsma, Júlia Komjáthy, Dieter Mitsche
We consider a large class of spatially-embedded random graphs that includes among others long-range percolation, continuum scale-free percolation and the age-dependent random conne…