Year: 2026
Type: preprint
Abstract: We consider two distance-based concepts in rooted trees and compare them to their leaf-restricted counterparts. The path length is the sum of all distances from the root to the vertices of the tree, while the external path length is the sum of all distances from the root to the leaves of the tree. Upon dividing by the number of vertices and leaves respectively, we obtain the average distance to the root. The Wiener index is the sum of all distances between pairs of vertices, and the terminal Wiener index is the sum of all distances between pairs of leaves. Dividing by the number of pairs of vertices and pairs of leaves respectively, we obtain the average distance between vertices and average distance between leaves. For two important classes of random trees, we show that the average distance of the root to a random leaf is almost the same as the average distance to a random vertex and that the average distance between vertices is almost the same as the average distance between leaves. For Bienaymé--Galton--Watson trees, each of these differences is bounded in probability. For three varieties of increasing trees (recursive trees, $d$-ary increasing trees, generalised plane-oriented recursive trees), on the other hand, the differences converge to constants in probability. This allows the transfer of convergence results for the path length to the external path length, and results for the Wiener index to be transferred to the terminal Wiener index.
Source: arXiv (Cornell University)
Authors: Lundblad, Jacob, Wagner, Stephan
Institutions: Uppsala University, Graz University of Technology
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Funder: Vetenskapsrådet
OpenAlex ID: W7226003305
