35 citations · 123 across the 21 of their papers we have counts for
27 papers
Convergence of trees with a given degree sequence and of their associated laminations
Gabriel Berzunza Ojeda, Cecilia Holmgren, Paul Thévenin
In this paper, we study uniform rooted plane trees with given degree sequence. We show, under some natural hypotheses on the degree sequence, that these trees converge toward the s…
Broadcasting induced colourings of random recursive trees and preferential attachment trees
Colin Desmarais, Cecilia Holmgren, Stephan Wagner
In this work we consider random two-colourings of random linear preferential attachment trees, which includes random recursive trees, random plane-oriented recursive trees, random…
Invariance principle for fragmentation processes derived from conditioned stable Galton-Watson trees
Gabriel Berzunza Ojeda, Cecilia Holmgren
Aldous, Evans and Pitman (1998) studied the behavior of the fragmentation process derived from deleting the edges of a uniform random tree on labelled vertices. In particular,…
The asymptotic distribution of cluster sizes for supercritical percolation on random split trees
Gabriel Berzunza, Cecilia Holmgren
We consider the model of random trees introduced by Devroye (1999), the so-called random split trees. The model encompasses many important randomized algorithms and data structures…
Normal limit laws for vertex degrees in randomly grown hooking networks and bipolar networks
Colin Desmarais, Cecilia Holmgren
We consider two types of random networks grown in blocks. Hooking networks are grown from a set of graphs as blocks, each with a labelled vertex called a hook. At each step in the…
A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees
Michael Fuchs, Cecilia Holmgren, Dieter Mitsche +1
We identify the mean growth of the independence number of random binary search trees and random recursive trees and show normal fluctuations around their means. Similarly we also s…