Skip to main content
Log in

A generalized distribution model for random recursive trees

  • Published:
Acta Informatica Aims and scope Submit manuscript

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, ….

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: 14 February 1995/2 January 1996

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002360050080

Keywords

Navigation