The space requirement of m - ary search trees : distributional asymptotics for m ≥ 27
نویسندگان
چکیده
We study the space requirement of m-ary search trees under the random permutation model when m ≥ 27 is fixed. Chauvin and Pouyanne have shown recently that Xn, the space requirement of an m-ary search tree on n keys, equals μ(n + 1) + 2Re [Λn2 ] + nn Reλ2 , where μ and λ2 are certain constants, Λ is a complex-valued random variable, and n → 0 a.s. and in L as n → ∞. Using the contraction method, we identify the distribution of Λ.
منابع مشابه
Transfer theorems and asymptotic distributional results for m-ary search trees
We derive asymptotics of moments and identify limiting distributions, under the random permutation model onm-ary search trees, for functionals that satisfy recurrence relations of a simple additive form. Many important functionals including the space requirement, internal path length, and the so-called shape functional fall under this framework. The approach is based on establishing transfer th...
متن کامل1 9 Ja n 20 12 Support and density of the limit m - ary search trees distribution
Abstract. The space requirements of an m-ary search tree satisfies a well-known phase transition: when m ≤ 26, the second order asymptotics is Gaussian. When m ≥ 27, it is not Gaussian any longer and a limit W of a complex-valued martingale arises. We show that the distribution of W has a square integrable density on the complex plane, that its support is the whole complex plane, and that it ha...
متن کاملSupport and density of the limit m - ary search trees distribution
The space requirements of an m-ary search tree satisfy a well-known phase transition: when m ≤ 26, the second order asymptotics is Gaussian. When m ≥ 27, it is not Gaussian any longer and a limit W of a complex-valued martingale arises. We show that the distribution of W has a square integrable density on the complex plane, that its support is the whole complex plane, and that it has finite exp...
متن کاملAdditive functionals on multiway search trees
We derive asymptotics of moments and limiting distributions, under the random permutation model on m-ary search trees on n keys, of functionals that satisfy recurrence relations of a simple additive form. Many important functionals including the space requirement, internal path length, and the socalled shape functional fall under this framework. The limiting behavior of these functionals exhibi...
متن کاملLimit distributions for multitype branching processes of m-ary search trees
Let m ≥ 3 be an integer. The so-called m-ary search tree is a discrete time Markov chain which is very popular in theoretical computer science, modelling famous algorithms used in searching and sorting. This random process satisfies a well-known phase transition: when m ≤ 26, the asymptotic behavior of the process is Gaussian, but for m ≥ 27 it is no longer Gaussian and a limit W of a complex-v...
متن کامل