Limit laws for functions of fringe trees for binary search trees and random recursive trees

By Cecilia Holmgren, Svante Janson. 2015

56 citations recorded by the source corpus.

We prove general limit theorems for sums of functions of subtrees of (random) binary search trees and random recursive trees. The proofs use a new version of a representation by Devroye, and Stein' ...

Subfields: Mathematical Physics, Statistics and Probability

View Paper: https://www.semanticscholar.org/paper/574c48fae6ad22ba36505a08276d3f1fd44d3d16

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Mathematical Physics

1. Cecilia Holmgren
2. Svante Janson
3. Robin Pemantle
4. Philippe Flajolet
5. R. Stephenson
6. Johan Wästlund
7. David Callan
8. Remco van der Hofstad

In Statistics and Probability

1. Cecilia Holmgren
2. Svante Janson
3. Robin Pemantle
4. Philippe Flajolet
5. Johan Wästlund
6. R. Stephenson
7. Eric Conrad
8. Sigurdur Orn Stef'ansson

Citations in the corpus

• Fringe trees, Crump-Mode-Jagers branching processes and $m$-ary search trees (2016, background): “(See also Devroye and Janson [41] and Holmgren and Janson [66] for some recent related applications of fringe trees.”