Subtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson Approximations (Q3529509): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A functional limit theorem for the profile of search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mean and variance of the numbers of \(r\)-pronged nodes and \(r\)-caterpillars in Yule-generated genealogical trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal clade size and external branch length under the neutral coalescent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Profiles of random trees: Plane-oriented recursive trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second phase changes in random \(m\)-ary search trees and generalized quicksort: Convergence rates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Berry-{E}sseen bounds for the number of maxima in planar regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Profiles of random trees: Limit theorems for random recursive trees and binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic fringe distributions for general families of random trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Profiles of random trees: correlation and width of random recursive trees and binary search trees / rank
 
Normal rank

Latest revision as of 18:08, 28 June 2024

scientific article
Language Label Description Also known as
English
Subtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson Approximations
scientific article

    Statements

    Subtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson Approximations (English)
    0 references
    0 references
    13 October 2008
    0 references
    number of subtrees
    0 references
    random recursive trees
    0 references
    random binary search tree
    0 references
    limit law
    0 references
    Berry-Esseen bounds
    0 references
    Poisson approximation
    0 references

    Identifiers