Protected Vertices in Motzkin trees
Abstract
In this paper we find recurrence relations for the asymptotic probability a vertex is k protected in all Motzkin trees. We use a similar technique to calculate the probabilities for balanced vertices of rank k. From this we calculate upper and lower bounds for the probability a vertex is balanced and upper and lower bounds for the expected rank of balanced vertices.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.