Leaf-to-leaf distances in Catalan trees
arXiv:1502.07893 · doi:10.18642/jpamaa_7100121956
Abstract
We study the average leaf-to-leaf path lengths on ordered Catalan tree graphs with 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.
arXiv comment18 pages, 5 figures
References in corpus (19)
- The Large N Limit of Superconformal Field Theories and Supergravity
- A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
- Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
- Entanglement renormalization
- Thermodynamic limit of the density matrix renormalization for the spin-1 Heisenberg chain
- A class of quantum many-body states that can be efficiently simulated
- Entanglement Renormalization and Holography
- Holographic duality with a view toward many-body physics
- Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensions
- Algorithms for entanglement renormalization
- Tensor product methods and entanglement optimization for ab initio quantum chemistry
- Tensor network states and geometry
- 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
- Self-assembling tensor networks and holography in disordered spin chains
- Entanglement renormalization for disordered systems
- Leaf-to-leaf distances and their moments in finite and infinite m-ary tree graphs