Metric trees of generalized roundness one
Elena Caffarelli, Ian Doust, Anthony Weston

TL;DR
This paper characterizes classes of countable metric trees with generalized roundness exactly one, including spherically symmetric trees with infinite branching and other non-symmetric trees with specific spreading or comb-like structures.
Contribution
It identifies large classes of countable metric trees with generalized roundness one, extending previous results beyond finite trees and symmetric cases.
Findings
Countable spherically symmetric trees with infinite branching have generalized roundness one.
Certain non-symmetric trees with sufficient spreading also have generalized roundness one.
Provides bounds and conditions based on degree sequences and tree structure.
Abstract
Every finite metric tree has generalized roundness strictly greater than one. On the other hand, some countable metric trees have generalized roundness precisely one. The purpose of this paper is to identify some large classes of countable metric trees that have generalized roundness precisely one. At the outset we consider spherically symmetric trees endowed with the usual combinatorial metric (SSTs). Using a simple geometric argument we show how to determine decent upper bounds on the generalized roundness of finite SSTs that depend only on the downward degree sequence of the tree in question. By considering limits it follows that if the downward degree sequence of a SST satisfies , then has generalized roundness one. Included among the trees that satisfy this condition are all complete -ary…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
