Corpus ID: 18998566

m-ary search trees when m ≥ 27 : a strong asymptotics for the space requirements ( updated version , september 03 )

@inproceedings{ChauvinmaryST,
  title={m-ary search trees when m ≥ 27 : a strong asymptotics for the space requirements ( updated version , september 03 )},
  author={Brigitte Chauvin and N. Pouyanne}
}
It is known that the joint distribution of the number of nodes of each type of an m-ary search tree is asymptotically multivariate normal when m ≤ 26. When m ≥ 27, we show the following strong asymptotics of the random vector Xn = (X (1) n , . . . , X (m−1) n ), where X (i) n denotes the number of nodes containing i− 1 keys after having introduced n− 1 keys in the tree: there exist (nonrandom) vectors X, C and S and random variables ρ and φ such that 

Figures from this paper.

Transfer theorems and asymptotic distributional results for m-ary search trees
  • 26
  • PDF
Dependence and phase changes in random m-ary search trees
  • 4
  • PDF
Congruence properties of depths in some random trees
  • 9
  • PDF
The total path length of split trees
  • 19
  • PDF
Phase changes in random point quadtrees
  • 30
  • PDF

References

Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES
Analysis of the Space of Search Trees under the Random Insertion Algorithm
  • 69
Phase changes in random m-ary search trees and generalized quicksort
  • 87
  • PDF
The size of random bucket trees via urn models
  • 23
The Joint Distribution of Elastic Buckets in Multiway Search Trees
  • 37
  • Highly Influential
Martingales and large deviations for binary search trees
  • 28
A general limit theorem for recursive algorithms and combinatorial structures
  • 147
  • PDF
Probabilistic Analysis of Bucket Recursive Trees
  • 43
  • Highly Influential
  • PDF
On the convergence of multitype branching processes with varying environments
  • 30
Phase Transition in a Random Fragmentation Problem with Applications to Computer Science
  • 20
  • PDF