Serte Donderwinkel

activity

20212026

most citedUniversality for the directed configuration model: metric space convergence of the strongly connected components at criticality

3 citations · 6 across the 21 of their papers we have counts for

collaborators

22 papers

math.PR2026

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 $n$ ,…

cs.SI2026

On the Fragility of Majority Illusions

Maaike Venema-Los, Zoé Christoff, Serte Donderwinkel +1

A majority illusion in a social network occurs when the majority of neighbors of an agent has a certain opinion while the majority of agents in the network has another opinion. We…

math.CO2026

The number and structure of connected graphs with a fixed degree sequence

Sasha Bell, Serte Donderwinkel, Remco van der Hofstad

We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configur…

math.PR2025

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 $n$ . When the trees are critical with finite $2$ …

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…

math.PR2025

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…

math.PR2025

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…

math.PR2025

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…

math.PR2025

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…

math.PR2024

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…

math.CO2024

Tournament score sequences, Erdős-Ginzburg-Ziv numbers, and the Lévy-Khintchine method

Michal Bassan, Serte Donderwinkel, Brett Kolesnik

We give a short proof of a recent result of Claesson, Dukes, Franklín and Stefánsson, connecting the number $S_{n}$ of score sequences and the Erdős-Ginzburg-Ziv numbers $N_{n}$ from a…

math.CO2024

Refined Horton-Strahler numbers I: a discrete bijection

Louigi Addario-Berry, Marie Albenque, Serte Donderwinkel +1

The Horton-Strahler number of a rooted tree $T$ is the height of the tallest complete binary tree that can be homeomorphically embedded in $T$ . The number of full binary trees with…

math.CO2024

Graphical sequences and plane trees

Michal Bassan, Serte Donderwinkel, Brett Kolesnik

Balister, the second author, Groenland, Johnston and Scott recently showed that there are asymptotically $C 4^{n} / n^{3/4}$ many unordered sequences that occur as degree sequences of g…

math.PR2024

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…

math.PR2024

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…

math.PR2024

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^…

math.PR2023★ 1 cited

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.…

math.CO2023★ 1 cited

Counting graphic sequences via integrated random walks

Paul Balister, Serte Donderwinkel, Carla Groenland +2

Given an integer $n$ , let $G (n)$ be the number of integer sequences $n - 1 \geq d_{1} \geq d_{2} \geq \dots \geq d_{n} \geq 0$ that are the degree sequence of some graph. We show that $G(n)=(c+o(1))…

math.PR2022

Random trees have height $O (n)$

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…

math.CO2021★ 1 cited

The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses

Louigi Addario-Berry, Serte Donderwinkel, Mickaël Maazoun +1

We present a very simple bijective proof of Cayley's formula due to Foata and Fuchs (1970). This bijection turns out to be very useful when seen through a probabilistic lens; we ex…

math.PR2021

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…

math.PR2021★ 3 cited

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 $n$ vertices with i.i.d. in- and out-degree pairs distributed as $(D^{-}, D^{+})$ , with $\mathbb E[D^…

Convergence and compactness of discrete aggregation trees

On the Fragility of Majority Illusions

The number and structure of connected graphs with a fixed degree sequence

The largest common subtree of two random trees

An elementary proof of the bunkbed conjecture for forests

Evolution of recursive trees with limited memory

Revisiting scaling limits for critical inhomogeneous random graphs with finite third moments

Discrete snakes with globally centered displacements

Temporal connectivity of Random Geometric Graphs

Tight universal bounds on the height times the width of random trees

Tournament score sequences, Erdős-Ginzburg-Ziv numbers, and the Lévy-Khintchine method

Refined Horton-Strahler numbers I: a discrete bijection

Graphical sequences and plane trees

Random friend trees

Sinaĭ excursions: An analogue of Sparre Andersen's formula for the area process of a random walk

Tournaments and random walks

Critical trees are neither too short nor too fat

Counting graphic sequences via integrated random walks

Random trees have height O(n​)

The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses

Convergence of the height process of supercritical Galton-Watson forests with an application to the configuration model in the critical window

Universality for the directed configuration model: metric space convergence of the strongly connected components at criticality

Random trees have height $O (n)$