pith. sign in

arxiv: 1104.4271 · v1 · pith:GR3MHK2Ynew · submitted 2011-04-21 · 🧮 math.CO

The degree profile of P\'olya trees

classification 🧮 math.CO
keywords profiledegreenodesinvestigateolyatreesbrowniancase
0
0 comments X
read the original abstract

We investigate the profile of random P\'olya 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 degree $d_1$ and $d_2$ in the levels of the tree.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.