8 citations · 22 across the 3 of their papers we have counts for
3 papers
math.CO2012★ 7 cited
The time of bootstrap percolation for dense initial sets
Béla Bollobás, Cecilia Holmgren, Paul Smith +1
In r-neighbour bootstrap percolation on the vertex set of a graph G, vertices are initially infected independently with some probability p. At each time step, the infected set expa…
math.PR2010★ 7 cited
Novel Characteristics of Split Trees by use of Renewal Theory
Cecilia Holmgren
We investigate characteristics of random split trees introduced by Devroye; split trees include for example binary search trees, -ary search trees, quadtrees, median of …
math.PR2010★ 8 cited
A Weakly 1-Stable Limiting Distribution for the Number of Random Records and Cuttings in Split Trees
Cecilia Holmgren
We study the number of random records in an arbitrary split tree (or equivalently, the number of random cuttings required to eliminate the tree). We show that a classical limit the…