Vertices with fixed outdegrees in large Galton-Watson trees (Q782806): Difference between revisions

The article under review deals with Galton-Watson trees (GW trees) with critical offspring distribution (that is, expected number of offspring one) conditioned on their number of vertices. The main focus of attention is on the number of vertices of fixed degree. The first contribution, extending work from [\textit{J.-M. Labarbe} and \textit{J.-F. Marckert}, Electron. J. Probab. 12, 229--261 (2007; Zbl 1128.60035)] is to study the scaling limits of processes coding the evolution of the number of such vertices in two different explorations of the tree (lexicographical order and contour order) starting from the root. Necessary and sufficient conditions are given for these limiting distributions to be centred. The proof techniques are different from those in the earlier paper cited above, and include a formula (in Section 3 of the paper) giving the joint distribution of outdegrees in GW trees in terms of random walks. The second is to extend results from [\textit{S. Janson}, Random Struct. Algorithms 48, No. 1, 57--101 (2016; Zbl 1330.05039)] about the normality of the number of vertices with given outdegree. Again the formula from Section 3 of the paper plays a role.