35 citations · 123 across the 21 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
math.PR2011★ 35 cited
Cutting down trees with a Markov chainsaw
Louigi Addario-Berry, Nicolas Broutin, Cecilia Holmgren
We provide simplified proofs for the asymptotic distribution of the number of cuts required to cut down a Galton-Watson tree with critical, finite-variance offspring distribution,…
math.CO2011
Counterexamples to a Monotonicity Conjecture for the Threshold Pebbling Number
Johan Björklund, Cecilia Holmgren
Graph pebbling considers the problem of transforming configurations of discrete pebbles to certain target configurations on the vertices of a graph, using the so-called pebbling mo…
math.PR2011★ 11 cited
The total path length of split trees
Nicolas Broutin, Cecilia Holmgren
We consider the model of random trees introduced by Devroye [SIAM J. Comput. 28 (1999) 409-432]. The model encompasses many important randomized algorithms and data structures. The…