Probabilistic analysis of the asymmetric digital search trees

Document Type: Research Paper


1 Department of Statistics, Imam Khomeini International University, Iran

2 Department of Statistics, Shahid Beheshti University, Tehran, Iran


In this paper, by applying three functional operators the previous results on the (Poisson) variance of the external profile in digital search trees will be improved. We study the profile built over $n$ binary strings generated by a memoryless source with unequal probabilities of symbols and use a combinatorial approach for studying the Poissonized variance, since the probability distribution of the profile is unknown.