BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Random Records and Cuttings in Split Trees - Cecilia Holmgren (Upp
 sala University)
DTSTART:20110512T133000Z
DTEND:20110512T143000Z
UID:TALK31244@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:I will discuss the asymptotic number of random records in an a
 rbitrary split tree or equivalently\, the number of random cuttings requir
 ed to eliminate the tree.\nThe split trees\, introduced by Devroye\, form 
 a large  class of random trees of logarithmic height. Some important examp
 les are  binary search trees\, $m$-ary search trees\, quadtrees\, tries\, 
 digital search trees\, medians of $(2k+1)$-trees and simplex trees.\n\nI w
 ill explain how a classical limit theorem for convergence of sums of trian
 gular arrays to infinitely divisible distributions can be used to determin
 e the distribution of the number of records or cuts. After\nnormalization 
 the distributions are shown to be asymptotically weakly 1-stable.\n
LOCATION:MR12
END:VEVENT
END:VCALENDAR