3 citations · 6 across the 21 of their papers we have counts for
15 papers · 1 filter
Convergence and compactness of discrete aggregation trees
Serte Donderwinkel, Jeroen van Haastert
We study a class of random aggregation trees that generalizes the discrete stick-breaking construction of the uniform labelled tree (Aldous, 1991). To sample the tree of size ,…
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 …
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…
Evolution of recursive trees with limited memory
Omer Angel, Shankar Bhamidi, Serte Donderwinkel +2
Motivated by questions in social networks, distributed computing and probabilistic combinatorics, the last few years have seen increasing interest in network evolution models where…
Revisiting scaling limits for critical inhomogeneous random graphs with finite third moments
Louigi Addario-Berry, Sasha Bell, Prabhanka Deka +4
We consider the rank-1 inhomogeneous random graph in the Brownian regime in the critical window. Aldous studied the weights of the components, and showed that this ordered sequence…
Discrete snakes with globally centered displacements
Louigi Addario-Berry, Serte Donderwinkel, Christina Goldschmidt +1
We prove a scaling limit for globally centered discrete snakes on size-conditioned critical Bienaymé trees. More specifically, under a global finite variance condition, we prove co…
Temporal connectivity of Random Geometric Graphs
Anna Brandenberger, Serte Donderwinkel, Céline Kerriou +2
A temporal random geometric graph is a random geometric graph in which all edges are endowed with a uniformly random time-stamp, representing the time of interaction between vertic…
Tight universal bounds on the height times the width of random trees
Serte Donderwinkel, Robin Khanfir
We obtain assumption-free, non-asymptotic, uniform bounds on the product of the height and the width of uniformly random trees with a given degree sequence, conditioned Bienaymé tr…
Random friend trees
Louigi Addario Berry, Simon Briend, Luc Devroye +3
We study a random recursive tree model featuring complete redirection called the random friend tree and introduced by Saramäki and Kaski. Vertices are attached in a sequential mann…
Sinaĭ excursions: An analogue of Sparre Andersen's formula for the area process of a random walk
Serte Donderwinkel, Brett Kolesnik
Sinaĭ initiated the study of random walks with persistently positive area processes, motivated by shock waves in solutions to the inviscid Burgers' equation. We find the precise as…
Tournaments and random walks
Serte Donderwinkel, Brett Kolesnik
We study the relationship between tournaments and random walks. This connection was first observed by Erdős and Moser. Winston and Kleitman came close to showing that $S_n=Θ(4^n/n^…
Critical trees are neither too short nor too fat
Louigi Addario-Berry, Serte Donderwinkel, Igor Kortchemski
We establish lower tail bounds for the height, and upper tail bounds for the width, of critical size-conditioned Bienaymé trees. Our bounds are optimal at this level of generality.…
Random trees have height
Louigi Addario-Berry, Serte Donderwinkel
We obtain new non-asymptotic tail bounds for the height of uniformly random trees with a given degree sequence, simply generated trees and conditioned Bienaymé trees (the family tr…
Convergence of the height process of supercritical Galton-Watson forests with an application to the configuration model in the critical window
Serte Donderwinkel
We show joint convergence of the Lukasiewicz path and height process for slightly supercritical Galton-Watson forests. This shows that the height processes for supercritical contin…
Universality for the directed configuration model: metric space convergence of the strongly connected components at criticality
Serte Donderwinkel, Zheneng Xie
We consider the strongly connected components (SCCs) of a uniform directed graph on vertices with i.i.d. in- and out-degree pairs distributed as , with $\mathbb E[D^…