Gerard Kok
-
Pattern distribution in various types of random trees
dmtcs:3359 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2005,
DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms
-
https://doi.org/10.46298/dmtcs.3359
Pattern distribution in various types of random treesConference paper
Authors: Gerard Kok 1
NULL
Gerard Kok
1 Institut für Diskrete Mathematik und Geometrie [Wien]
Let Tn denote the set of unrooted unlabeled trees of size n and let M be a particular (finite) tree. Assuming that every tree of Tn is equally likely, it is shown that the number of occurrences Xn of M as an induced sub-tree satisfies EXn∼μn and VarXn∼σ2n for some (computable) constants μ>0 and σ≥0. Furthermore, if σ>0 then (Xn−EXn)/√VarXn converges to a limiting distribution with density (A+Bt2)e−Ct2 for some constants A,B,C. However, in all cases in which we were able to calculate these constants, we obtained B=0 and thus a normal distribution. Further, if we consider planted or rooted trees instead of Tn then the limiting distribution is always normal. Similar results can be proved for planar, labeled and simply generated trees.
Jing Li;Yiyang Li, 2015, The asymptotic value of the zeroth-order Randić index and sum-connectivity index for trees, Applied Mathematics and Computation, 266, pp. 1027-1030, 10.1016/j.amc.2015.06.028.