A Crawling Metric on the Space of Subtrees of a Tree
We propose a crawling metric on the space of subtrees of a tree. The symmetric difference cannot tell whether two disjoint subtrees are close or far; we halve it and add the gap between them. The result is a metric, one half is the smallest factor, and the tree embeds canonically. The metric equals the least cost of crawling between subtrees by growing and shrinking without jumping. With simultaneous growth and shrinkage, subtrees of fixed length form a geodesic space.
math.OC↗