Abstract.
A random tree T n of order n is constructed by choosing in a random tree T n-1 of order n−1 a vertex at random and connecting it to a new vertex labeled n. In the usual constraint we assume that the n−1 vertices of T n-1 are equally likely to be chosen. We introduce and research a more general case in which a distribution of choosing vertices is defined by a sequence α1, α2, ….
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 14 February 1995/2 January 1996
Rights and permissions
About this article
Cite this article
Shapiro, A. A generalized distribution model for random recursive trees. Acta Informatica 34, 211–216 (1997). https://doi.org/10.1007/s002360050080
Issue Date:
DOI: https://doi.org/10.1007/s002360050080