English

The degree profile of P\'olya trees

Combinatorics 2011-04-22 v1

Abstract

We investigate the profile of random P\'olya trees of size nn when only nodes of degree dd 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 degree d1d_1 and d2d_2 in the levels of the tree.

Keywords

Cite

@article{arxiv.1104.4271,
  title  = {The degree profile of P\'olya trees},
  author = {Bernhard Gittenberger and Veronika Kraus},
  journal= {arXiv preprint arXiv:1104.4271},
  year   = {2011}
}

Comments

31 pages, 3 figures