On the distribution of leaves in rooted subtrees of recursive trees (Q1175968): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 23:31, 4 March 2024

scientific article
Language Label Description Also known as
English
On the distribution of leaves in rooted subtrees of recursive trees
scientific article

    Statements

    On the distribution of leaves in rooted subtrees of recursive trees (English)
    0 references
    0 references
    0 references
    25 June 1992
    0 references
    A random recursive tree \(T_ n\) of order \(n\) is a tree, rooted at the vertex labelled 1, which evolves from the recursive tree \(T_{n-1}\) of order \(n-1\) by choosing a vertex of \(T_{n-1}\) at random and joining the vertex labelled \(n\) to it, all \(n-1\) vertices of \(T_{n-1}\) being equally likely. The authors study the structure of \(T_ n^{(k)}\), the subtree of \(T_ n\) rooted at the vertex labelled \(k\), under the assumption that \(k\) is fixed and \(n\to\infty\). Employing generalized Pólya urn models they determine exact and limiting distributions for the size, the number of leaves (vertices of degree 1) and the number of internal vertices of \(T_ n^{(k)}\).
    0 references
    rooted subtree
    0 references
    recursive tree
    0 references
    generalized Pólya urn models
    0 references

    Identifiers