1 citations · 1 across the 5 of their papers we have counts for
6 papers
Large fringe trees for random trees with given vertex degrees
Gabriel Berzunza Ojeda, Cecilia Holmgren, Svante Janson
This paper extends the study of fringe trees in random plane trees with a given degree statistic. While previous work established the asymptotic normality of the count of fringe tr…
Fringe subtrees of split trees and fractional split trees
Cecilia Holmgren, Jasper Ischebeck, Svante Janson
We consider additive functionals with small toll functions on split trees and a generalization of split trees, which we call fractional split trees, where the split vector…
A tightness criterion for fragmentations
Gabriel Berzunza Ojeda, Cecilia Holmgren, Svante Janson
This note presents a simple criterion for the tightness of stochastic fragmentation processes. Our work is motivated by an application to a fragmentation process derived from delet…
Probabilistic analysis of optimal multi-pivot QuickSort
Cecilia Holmgren, Jasper Ischebeck, Daniel Krenn +2
We consider a multi-pivot QuickSort algorithm using pivot elements to partition a nonsorted list into sublists in order to proceed recursively on these subli…
Fringe trees for random trees with given vertex degrees
Gabriel Berzunza Ojeda, Cecilia Holmgren, Svante Janson
We prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove cor…
Approximation of Subgraph Counts in the Uniform Attachment Model
Johan Björklund, Cecilia Holmgren, Svante Janson +1
We use Stein's method to obtain distributional approximations of subgraph counts in the uniform attachment model or random directed acyclic graph; we provide also estimates of rate…