Limit laws for local counters in random binary search trees
From MaRDI portal
Recommendations
- Limiting theorems for the nodes in binary search trees
- Limit Laws for Sums of Functions of Subtrees of Random Binary Search Trees
- Limit laws for functions of fringe trees for binary search trees and random recursive trees
- On the subtrees of random binary search trees
- Universal Limit Laws for Depths in Random Trees
Cites work
- A note on the height of binary search trees
- Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data Structures
- Branching processes in the analysis of the heights of trees
- Central limit theorems under weak dependence
- Dependent central limit theorems and invariance principles
- Distribution of nodes of a tree by degree
- scientific article; zbMATH DE number 3723610 (Why is no real title available?)
- scientific article; zbMATH DE number 3762080 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- Martingale Central Limit Theorems
- More Combinatorial Properties of Certain Trees
- On growing random binary trees
- On the Most Probable Shape of a Search Tree Grown from a Random Permutation
- On the number of terminal vertices in certain random trees with an application to stemma construction in philology
- The analysis of a fringe heuristic for binary search trees
- The central limit theorem for dependent random variables
- The Expected Distribution of Degrees in Random Binary Search Trees
- The expected linearity of a simple equivalence algorithm
- Two central limit problems for dependent random variables
Cited in
(44)- The joint distribution of the three types of nodes in uniform binary trees
- On the number of descendants and ascendants in random search trees
- Consecutive patterns in permutations
- A general limit theorem for recursive algorithms and combinatorial structures
- Normal convergence problem? Two moments and a recurrence may be the clues
- On weighted depths in random binary search trees
- Spanning tree size in random binary search trees.
- Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
- A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees
- A scaling limit for the cover time of the binary tree
- Maximal clades in random binary search trees
- Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees
- Search trees: metric aspects and strong limit theorems
- Limiting theorems for the nodes in binary search trees
- On statistical tests of phylogenetic tree imbalance: The Sackin and other indices revisited
- Limit laws for functions of fringe trees for binary search trees and random recursive trees
- Finding the seed of uniform attachment trees
- Investigating several fundamental properties of random lobster trees and random spider trees
- On degenerate sums of m-dependent variables
- On rotations in fringe-balanced binary trees
- On the richness of the collection of subtrees in random binary search trees
- Necklace Processes Via Pólya Urns
- On the shape of the fringe of various types of random trees
- k-protected vertices in binary search trees
- Universal Limit Laws for Depths in Random Trees
- Limit Laws for Sums of Functions of Subtrees of Random Binary Search Trees
- On the subtree size profile of binary search trees
- Refined asymptotics for the number of leaves of random point quadtrees
- Mean and variance of balanced Pólya urns
- DEGREE-BASED GINI INDEX FOR GRAPHS
- On a random search tree: asymptotic enumeration of vertices by distance from leaves
- A study of large fringe and non-fringe subtrees in conditional Galton-Watson trees
- SOME PROPERTIES OF BINARY SERIES-PARALLEL GRAPHS
- Degree profile of m-ary search trees: a vehicle for data structure compression
- Central limit theorems for additive tree parameters with small toll functions
- Minimal clade size and external branch length under the neutral coalescent
- Fringe trees for random trees with given vertex degrees
- The degree Gini index of several classes of random trees and their poissonized counterparts -- evidence for duality
- Random sprouts as internet models, and Pólya processes
- Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees
- Asymptotic distribution of two-protected nodes in random binary search trees
- Uncovering a graph
- On the silhouette of binary search trees
- A functional limit theorem for the profile of \(b\)-ary trees
This page was built for publication: Limit laws for local counters in random binary search trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3352193)
