Journal of Combinatorial Theory Series A
Nodes of large degree in random trees and forests
Random Structures & Algorithms
The distribution of patterns in random trees
Combinatorics, Probability and Computing
Joint distribution of the number of vertices with given different outdegrees in Galton-Watson forest
Mathematics and Computers in Simulation
The shape of unlabeled rooted random trees
European Journal of Combinatorics
The degree profile of random Pólya trees
Journal of Combinatorial Theory Series A
Hi-index | 0.01 |
Let Tn denote the set of unrootedunlabeled trees of size n and let k ≥ 1 be given.By assuming that every tree of Tn isequally likely, it is shown that the limiting distribution of thenumber of nodes of degree k is normal with mean value~μkn and variance~σ[stack2k] n withpositive constants μk andσk. Besides, the asymptotic behavior ofμk and σk for k➝ ∞ as well as the corresponding multivariatedistributions are derived. Furthermore, similar results can beproved for plane trees, for labeled trees, and for forests. ©1999 John Wiley & Sons, Inc. J Graph Theory 31: 227253,1999