13 papers
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…
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…
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 $2…
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…