Limiting probabilities for vertices of a given rank in rooted trees
arXiv:1803.05033
Abstract
We consider two varieties of labeled rooted trees, and the probability that a vertex chosen from all vertices of all trees of a given size uniformly at random has a given rank. We prove that this probability converges to a limit as the tree size goes to infinity.
16 pages, 2 figures