Abstract
We consider bucket recursive trees of size n consisting of all buckets with variable capacities 1, 2, ..., b and with a specific stochastic growth rule. This model can be considered as a generalization of random recursive trees like bucket recursive trees introduced by Mahmoud and Smythe where all buckets have the same capacities. In this work, we provide a combinatorial analysis of these trees where the generating function of the total weights satisfies an autonomous first order differential equation. We study the depth of the largest label (i.e., the number of edges from the root node to the node containing label n) and give a closed formula for the probability distribution. Also we prove a limit law for this quantity which is a direct application of quasi power theorem and compute its mean and variance. Our results for b = 1 reduce to the previous results for random recursive trees.
Similar content being viewed by others
References
Drmota, M.: Random Trees, An Interplay Between Combinatorics and Probability, Springer, Wien-New York, 2009
Flajolet, P., Sedgewick, R.: Analytic Combinatorics, Cambridge University Press, Cambridge, 2008
Kuba, M., Panholzer, A.: Combinatorial approach to the analysis of bucket recursive trees. Theoret. Comput. Sci., 411(34–36), 3253–3273 (2010)
Mahmoud, H., Smythe, R.: Probabilistic analysis of bucket recursive trees. Theoret. Comput. Sci., 144, 221–249 (1995)
Panholzer, A., Prodinger, H.: Analysis of some statistics for increasing tree families. Discrete Math. Theor. Comput. Sci., 6, 437–460 (2004)
Panholzer, A., Prodinger, H.: The level of nodes in increasing trees revisited. Random Structures Algorithms, 31, 203–226 (2007)
Author information
Authors and Affiliations
Corresponding author
Electronic supplementary material
Rights and permissions
About this article
Cite this article
Kazemi, R. Depth in bucket recursive trees with variable capacities of buckets. Acta. Math. Sin.-English Ser. 30, 305–310 (2014). https://doi.org/10.1007/s10114-013-2115-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10114-013-2115-2
Keywords
- Bucket-increasing tree
- bucket-recursive tree
- exponential generating function
- complete and incomplete nodes
- depth