![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
University of Cambridge > Talks.cam > Combinatorics Seminar > Random Records and Cuttings in Split Trees
Random Records and Cuttings in Split TreesAdd to your list(s) Download to your calendar using vCal
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. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsPhilomathia Forum 2017 Institute of Astronomy Extra Talks Arrol Adam Lectures - 'Responses to the First World War'Other talksHornby Model Railways Current-Induced Stresses in Ceramic Lithium-Ion Conductors Amphibian Evolution through Deep Time: Fossils, Genes and Regeneration Chemical genetic approaches to accelerate antimalarial target discovery Radiocarbon as a carbon cycle tracer in the 21st century Beating your final boss battle, or presenting with confidence and style (tough mode) |