Pattern distribution in various types of random trees
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...
Kaydedildi:
| Yazar: | |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Discrete Mathematics & Theoretical Computer Science
2005-01-01
|
| Seri Bilgileri: | Discrete Mathematics & Theoretical Computer Science |
| Konular: | |
| Online Erişim: | https://dmtcs.episciences.org/3359/pdf |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|