Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Pattern distribution ...
Conference paper

Pattern distribution in various types of random trees

Gerard Kok (1)
(1) Institut für Diskrete Mathematik und Geometrie [Wien]
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2004
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms
Proceedings
DOI
10.46298/dmtcs.3359
License
https://about.hal.science/hal-authorisation-v1
Indicators
584
Views
515
Downloads

Pattern distribution in various types of random trees

Gerard Kok (1)
(1) Institut für Diskrete Mathematik und Geometrie [Wien]
Abstract
Let $\mathcal{T}_n$ denote the set of unrooted unlabeled trees of size $n$ and let $\mathcal{M}$ be a particular (finite) tree. Assuming that every tree of $\mathcal{T}_n$ is equally likely, it is shown that the number of occurrences $X_n$ of $\mathcal{M}$ as an induced sub-tree satisfies $\mathbf{E} X_n \sim \mu n$ and $\mathbf{V}ar X_n \sim \sigma^2 n$ for some (computable) constants $\mu > 0$ and $\sigma \geq 0$. Furthermore, if $\sigma > 0$ then $(X_n - \mathbf{E} X_n) / \sqrt{\mathbf{V}ar X_n}$ converges to a limiting distribution with density $(A+Bt^2)e^{-Ct^2}$ 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 $T_n$ then the limiting distribution is always normal. Similar results can be proved for planar, labeled and simply generated trees.
Keywords
  • [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]
  • random trees
  • generating functions
  • limiting distributions
Cited by

Source: OpenCitations

  • The Distribution of Patterns in Random Trees

    Authors : FRÉDÉRIC CHYZAK, MICHAEL DRMOTA ORCID, THOMAS KLAUSNER, GERARD KOK

    Journal reference : Volume 17, 2007, pp. 21-59

    DOI : 10.1017/s0963548307008425
  • The asymptotic value of the Randić index for trees

    Advances in Applied Mathematics

    Authors : Xueliang Li, Yiyang Li ORCID

    Journal reference : Volume 47, 2010, pp. 365-378

    DOI : 10.1016/j.aam.2010.10.008
  • The asymptotic value of the zeroth-order Randić index and sum-connectivity index for trees

    Applied Mathematics and Computation

    Authors : Jing Li ORCID, Yiyang Li ORCID

    Journal reference : Volume 266, 2015, pp. 1027-1030

    DOI : 10.1016/j.amc.2015.06.028
Preview
Loading PDF preview...