Leaf-to-leaf distances and their moments in finite and infinite m-ary tree graphs
arXiv:1406.4079 · doi:10.1103/PhysRevE.91.042133
Abstract
We study the leaf-to-leaf distances on full and complete m-ary graphs using a recursive approach. In our formulation, leaves are ordered along a line. We find explicit analytical formulae for the sum of all paths for arbitrary leaf-to-leaf distance r as well as the average path lengths and the moments thereof. We show that the resulting explicit expressions can be recast in terms of Hurwitz-Lerch transcendants. Results for periodic trees are also given. For incomplete random binary trees, we provide first results by numerical techniques; we find a rapid drop of leaf-to-leaf distances for large r.
arXiv comment10 pages, 7 figures
References in corpus (11)
- The density-matrix renormalization group in the age of matrix product states
- Criticality, the area law, and the computational power of PEPS
- Classical simulation of quantum many-body systems with a tree tensor network
- Algorithms for entanglement renormalization
- Tensor network states and geometry
- Simulation of two-dimensional quantum systems using a tree tensor network that exploits the entropic area law
- Quantum phase transitions in matrix product systems
- Double integrals and infinite products for some classical constants via analytic continuations of Lerch's transcendent
- Unconstrained Tree Tensor Network: An adaptive gauge picture for enhanced performance
- Critical properties of homogeneous binary trees
- Self-assembling tensor networks and holography in disordered spin chains