# Serte Donderwinkel

I am an assistant professor (with a tenure track) in probability theory at the University of Groningen. I am also affiliated with the interdisciplinary centre CogniGron of mathematicians, statisticians, computer scientists and material engineers that aim to improve learning-based cognitive computing with materials-centred systems.

Before that, I was a postdoctoral researcher at McGill University in the research group of Prof. Louigi Addario-Berry, where I was funded by a CRM-ISM Postdoctoral Fellowship. I completed my PhD at the University of Oxford under the supervision of Prof. Christina Goldschmidt, where I was also a Stipendiary Lecturer at St. Hugh's College.

My research is in discrete probability theory. The common denominator of my projects is that they involve creative sampling procedures that, combined with tools from (stochastic) analysis, allow me to study the large-scale structure of the random tree or graph. Whether I am obtaining a large deviations principle, solving a counting problem with the probabilistic method or proving a metric space scaling limit, I always devote most attention to finding a smart way of sampling that unlocks the result that I am after. This approach has allowed my coauthors and I to answer questions in both discrete probability and probabilistic combinatorics, asked by for example Svante Janson, Alex Scott, Colin McDiarmid, Gordon Royle and Paul Erdős.

s.a. lastname @ rug.nl

You can find me in office 446 in the Bernoulliborg

## Bachelor or master project?

I am happy to supervise bachelor or master students from Groningen or elsewhere that want to work on a question in discrete probability theory. Together, we can look for a topic that we are both interested in. Feel free to send an email or to drop by my office!

## Teaching

In term 2b I teach the new graduate course Combinatorial Mathematics B. I will cover various models for random trees and graphs and I will discuss the probabilistic tools needed to study them. In term 1b I will teach Graph Theory to the first-year students in the BSc in Mathematics.

## Research

Bassan, M., Donderwinkel, S. and Kolesnik, B., Tournament score sequences, Erdős-Ginzburg-Ziv numbers, and the Lévy-Khintchine method, 2024, arXiv:2407.01441

Bassan, M., Donderwinkel, S. and Kolesnik, B., Graphical sequences and plane trees, 2024, arXiv:2406.05110

Addario-Berry, L., Albenque, M, Donderwinkel, S. and Khanfir, R. Refined Horton-Strahler numbers I: a discrete bijection, 2024, arXiv:2406.03025

Addario-Berry, L., Briend, S., Devroye, L., Donderwinkel, S., Lugosi, G. and Kerriou, C. Random friend trees, 2024, arXiv:2403.20185

Donderwinkel, S. and Kolesnik, B. Asymptotics for Sinaĭ excursions, 2024, arXiv:2403.12941

Donderwinkel, S. and Kolesnik, B. Tournaments and random walks, 2024, arxiv:2403.12940

Addario-Berry, L., Donderwinkel, S. and Kortchemski, I. Critical trees are neither short nor fat, 2023, arXiv:2311:06163

Balister, P., Donderwinkel, S., Groenland, C., Johnston, T., and Scott, A. Counting graphic sequences via integrated random walks, 2023, arXiv:2301.07022

Addario-Berry, L., and Donderwinkel, S., Random trees have height O(√n), 2022, arXiv:2201.11773, to appear in the Annals of Probability

Addario-Berry, L., Blanc-Renaudie, A., Donderwinkel, S., Maazoun, M., and Martin, J. The Foata–Fuchs proof of Cayley’s formula, and its probabilistic uses, Electron. Commun. Probab. 28: 1-13 (2023), DOI: 10.1214/23-ECP523

Donderwinkel, S., and Xie, Z. Universality for the directed configuration model: metric space convergence of the strongly connected components at criticality, 2021, arXiv:2105.11434

Donderwinkel, S. Height process convergence of supercritical Galton-Watson forests, with an application to the configuration model in the critical window, 2021, arXiv:2105.12109, to appear in Advances in Applied Probability

## Upcoming events

TU Delft Probability Seminar, 23 September 2024, Delft, The Netherlands, seminar speaker

Mark Kac Seminar, 4 October 2024, Utrecht, The Netherlands, seminar speaker

Carleton University Algorithms Seminar, 11 October 2024, Ottawa, Canada, seminar speaker

BIRS-CMI workshop on mathematical foundations of network models and their applications, 9-20 December 2024, Bangalore, India, organiser

Conférence de GdR Branchement, 27-31 January 2025, Orsay, France, mini-course lecturer

SLMath Program on Probability and Statistics of Discrete Structures, 21 January-16 May 2025, Berkeley, United States, Research Member

CWI Themed Semester on phase transitions in probability, combinatorics and algorithms, Spring 2026, Amsterdam, The Netherlands, organiser

## Theses

The structure of large random graphs, PhD Thesis, August 2022, supervised by Christina Goldschmidt

The ant in the labyrinth, written in April 2018 as part of Part iii of the Mathematics Tripos at the University of Cambridge, supervised by Perla Sousi, primarily based on a paper by Noam Berger, Nina Gantert and Yuval Peres

Stein's method applied to preferential attachment graphs, written in June 2016 as part of BSc in Mathematics at the University of Groningen, supervised by Daniel Rodrigues-Valesin and Aernout van Enter, primarily based on a paper by Nathan Ross