Non-Fringe Subtrees in Conditioned Galton-Watson Trees
We study $S(\mathcal{T}_{n})$, the number of subtrees in a conditioned Galton—Watson tree of size $n$. With two very different methods, we show that $\log(S(\mathcal{T}_{n}))$ has a Central Limit Law and that the moments of $S(\mathcal{T}_{n})$ are of exponential scale.
Saved in:
| Published in | The Electronic journal of combinatorics Vol. 25; no. 3 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
07.09.2018
|
| Online Access | Get full text |
Cover
Loading…
| Summary: | We study $S(\mathcal{T}_{n})$, the number of subtrees in a conditioned Galton—Watson tree of size $n$. With two very different methods, we show that $\log(S(\mathcal{T}_{n}))$ has a Central Limit Law and that the moments of $S(\mathcal{T}_{n})$ are of exponential scale. |
|---|---|
| ISSN: | 1077-8926 1097-1440 1077-8926 |
| DOI: | 10.37236/7708 |