Processing math: 100%

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

  • 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 (XnEXn)/VarXn converges to a limiting distribution with density (A+Bt2)eCt2 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.


Volume: DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms
Section: Proceedings
Published on: January 1, 2005
Imported on: May 10, 2017
Keywords: random trees,generating functions,limiting distributions,[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG],[INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC]

3 Documents citing this article

Consultation statistics

This page has been seen 301 times.
This article's PDF has been downloaded 255 times.