4 papers · 1 filter
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…
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…
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^…