26 citations · 60 across the 12 of their papers we have counts for
13 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 component in scale-free inhomogeneous random graphs
Joost Jorritsma, Bert Zwart
We study large deviations of the size of the largest connected component in a general class of inhomogeneous random graphs with iid weights, parametrized so that the degree distrib…
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…
Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima
Joost Jorritsma, Johannes Lengler, Dirk Sudholt
It is an ongoing debate whether and how comma selection in evolutionary algorithms helps to escape local optima. We propose a new benchmark function to investigate the benefits of…
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…
Cluster-size decay in supercritical long-range percolation
Joost Jorritsma, Júlia Komjáthy, Dieter Mitsche
We study the cluster-size distribution of supercritical long-range percolation on , where two vertices are connected by an edge with probability…
Not all interventions are equal for the height of the second peak
Tim Hulshof, Joost Jorritsma, Júlia Komjáthy
In this paper we conduct a simulation study of the spread of an epidemic like COVID-19 with temporary immunity on finite spatial and non-spatial network models. In particular, we a…
Distance evolutions in growing preferential attachment graphs
Joost Jorritsma, Júlia Komjáthy
We study the evolution of the graph distance and weighted distance between two fixed vertices in dynamically growing random graph models. More precisely, we consider preferential a…
Weighted distances in scale-free preferential attachment models
Joost Jorritsma, Júlia Komjáthy
We study three preferential attachment models where the parameters are such that the asymptotic degree distribution has infinite variance. Every edge is equipped with a non-negativ…
Structures in supercritical scale-free percolation
Markus Heydenreich, Tim Hulshof, Joost Jorritsma
Scale-free percolation is a percolation model on which can be used to model real-world networks. We prove bounds for the graph distance in the regime where vertices…