University of Cambridge > Talks.cam > Combinatorics Seminar > Random Records and Cuttings in Split Trees

Random Records and Cuttings in Split Trees

Add to your list(s) Download to your calendar using vCal

  • UserCecilia Holmgren (Uppsala University)
  • ClockThursday 12 May 2011, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason.

I will discuss the asymptotic number of random records in an arbitrary split tree or equivalently, the number of random cuttings required to eliminate the tree. The split trees, introduced by Devroye, form a large class of random trees of logarithmic height. Some important examples are binary search trees, $m$-ary search trees, quadtrees, tries, digital search trees, medians of $(2k+1)$-trees and simplex trees.

I will explain how a classical limit theorem for convergence of sums of triangular arrays to infinitely divisible distributions can be used to determine the distribution of the number of records or cuts. After normalization the distributions are shown to be asymptotically weakly 1-stable.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity