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.

18 pages, 5 figures

References in corpus (9)

• Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
• A class of quantum many-body states that can be efficiently simulated
• Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensions
• Tensor product methods and entanglement optimization for ab initio quantum chemistry
• Simulating Strongly Correlated Quantum Systems with Tree Tensor Networks
• Advances on Tensor Network Theory: Symmetries, Fermions, Entanglement, and Holography
• T3NS: three-legged tree tensor network states
• Spinal partitions and invariance under re-rooting of continuum random trees
• Entanglement renormalization for disordered systems