Limiting probabilities for vertices of a given rank in rooted trees
Combinatorics
2018-03-15 v1
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.
Keywords
Cite
@article{arxiv.1803.05033,
title = {Limiting probabilities for vertices of a given rank in rooted trees},
author = {Miklos Bona and Istvan Mezo},
journal= {arXiv preprint arXiv:1803.05033},
year = {2018}
}
Comments
16 pages, 2 figures