arXiv · 1502.07893
Leaf-to-leaf distances in Catalan trees
Abstract
We study the average leaf-to-leaf path lengths on ordered Catalan tree graphs with $n$ nodes and show that these are equivalent to the average length of paths starting from the root node. We give an explicit analytic formula for the average leaf-to-leaf path length as a function of separation of the leaves and study its asymptotic properties. At the heart of our method is a strategy based on an abstract graph representation of generating functions.
Explore related subjects
Keep this discovery
Andrew M. Goldsborough, Jonathan M. Fellows, Matthew Bates, S. Alex Rautu, George Rowlands, Rudolf A. Römer. 2015-02-27. Leaf-to-leaf distances in Catalan trees. https://doi.org/10.18642/jpamaa_7100121956
Cite the original work for its findings. Save a collection to share your selection of sources.