arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1002.3896math.PR
收藏

随机二叉查找树的几乎必然渐近性

Almost sure asymptotics for the random binary search tree

Matthew I. Roberts

摘要:

本文考虑一个具有n个结点的(随机置换模型)二叉查找树,给出了树的高度H_n和饱和度h_n在重对数尺度上的渐近性为n \to \infty,几乎必然地和依概率地.然后我们考虑了在时刻n,在H_n层上的粒子数F_n,证明了F_n几乎必然是无界的.

英文摘要:

We consider a (random permutation model) binary search tree with n nodes and give asymptotics on the loglog scale for the height H_n and saturation level h_n of the tree as n\to\infty, both almost surely and in probability. We then consider the number F_n of particles at level H_n at time n, and show that F_n is unbounded almost surely.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑