The asymptotic number of non-isomorphic rooted trees obtained by rooting a tree
From MaRDI portal
Publication:890484
Abstract: Let be the set of trees with vertices. Suppose that each tree in is equally likely. We show that the number of different rooted trees of a tree equals for almost every tree of , where is a constant. As an application, we show that the number of any given pattern in is also asymptotically normally distributed with mean and variance , where are some constants related to the given pattern. This solves an open question claimed in Kok's thesis.
Recommendations
Cites work
- scientific article; zbMATH DE number 986989 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- Analytic combinatorics
- Isomorphism and symmetries in random phylogenetic trees
- Nodes of large degree in random trees and forests
- Pattern distribution in various types of random trees
- Random graphs.
- The Distribution of Patterns in Random Trees
- The asymptotic value of the Randić index for trees
- The distribution of degrees in a large random tree
- The distribution of nodes of given degree in random trees
- The expected number of symmetries in locally restricted trees. II
- The number of trees
- Vertices of degree \(k\) in random unlabeled trees
Cited in
(5)- scientific article; zbMATH DE number 4187815 (Why is no real title available?)
- The number of rooted trees of given depth
- Counting embeddings of rooted trees into families of rooted trees
- scientific article; zbMATH DE number 6385357 (Why is no real title available?)
- Properties related to the function of the number of undirected non-isomorphic trees
This page was built for publication: The asymptotic number of non-isomorphic rooted trees obtained by rooting a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890484)