Article ID Journal Published Year Pages File Type
6424532 Journal of Combinatorial Theory, Series A 2012 30 Pages PDF
Abstract

We investigate the profile of random Pólya trees of size n when only nodes of degree d are counted in each level. It is shown that, as in the case where all nodes contribute to the profile, the suitably normalized profile process converges weakly to a Brownian excursion local time. Moreover, we investigate the joint distribution of the number of nodes of degrees d1 and d2 on the same level of the tree.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, ,