On the distribution of the number of vertices in layers of random trees

Lajos Takács

International Journal of Stochastic Analysis, 1991, vol. 4, 1-12

Abstract:

Denote by S n the set of all distinct rooted trees with n labeled vertices. A tree is chosen at random in the set S n , assuming that all the possible n n − 1 choices are equally probable. Define τ n ( m ) as the number of vertices in layer m , that is, the number of vertices at a distance m from the root of the tree. The distance of a vertex from the root is the number of edges in the path from the vertex to the root. This paper is concerned with the distribution and the moments of τ n ( m ) and their asymptotic behavior in the case where m = [ 2 α n ] , 0 < α < ∞ and n → ∞ . In addition, more random trees, branching processes, the Bernoulli excursion and the Brownian excursion are also considered.

Date: 1991
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJSA/4/392725.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJSA/4/392725.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnijsa:392725

DOI: 10.1155/S104895339100014X

Access Statistics for this article

More articles in International Journal of Stochastic Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().