Limiting probabilities for vertices of a given rank in rooted trees
classification
🧮 math.CO
keywords
giventreesprobabilityrankrootedsizeverticeschosen
read the original 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.
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.