41 citations · 43 across the 6 of their papers we have counts for
Showing 2006 · math.PRShow all
2 papers · 2 filters
math.PR2006★ 2 cited
The size of random fragmentation trees
S. Janson, R. Neininger
We study a random fragmentation process and its associated random tree. The process has earlier been studied by Dean and Majumdar (J. Phys. A: Math. Gen., vol. 35, L501--L507), who…
math.PR2006★ 41 cited
A functional limit theorem for the profile of search trees
Michael Drmota, Svante Janson, Ralph Neininger
We study the profile of random search trees including binary search trees and -ary search trees. Our main result is a functional limit theorem of the normalized profil…