3 citations · 6 across the 21 of their papers we have counts for
7 papers · 1 filter
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…
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 of score sequences and the Erdős-Ginzburg-Ziv numbers from a…
Refined Horton-Strahler numbers I: a discrete bijection
Louigi Addario-Berry, Marie Albenque, Serte Donderwinkel +1
The Horton-Strahler number of a rooted tree is the height of the tallest complete binary tree that can be homeomorphically embedded in . The number of full binary trees with…
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 many unordered sequences that occur as degree sequences of g…
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^…