Scholarlink

<p>In this paper, we introduce a previously not studied type of Euclidean tree called LED (Leaves of Equal Depth) tree. LED trees can be used, for example, in computational phylogeny, since they are a natural representative of the time evolution of a set of species in a feature space. This work is focused on LED trees that are length minimizers for a given set of leaves and a given isomorphism type. The underlying minimization problem can be seen as a variant of the classical Euclidean Steiner tree problem. Even though it has a convex objective function, it is rather non-trivial, since it has a non-convex feasible set. The main contribution of this paper is that we prove the uniqueness of a stationary point of the length function on the feasible set. Moreover, we prove several geometrical characteristics of the length minimizers that are analogous to the properties of Steiner minimal trees. We also explore some geometrical and topological properties of the feasible set. At the end, to demonstrate the applicability of our theoretical results, we show an example of an application in historical linguistics.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Length-Minimizing LED Trees

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年1月23日

查看全文
  • Mariana Sarkociová Remešíková,
  • Peter Sarkoci,
  • Mária Trnovská

摘要

In this paper, we introduce a previously not studied type of Euclidean tree called LED (Leaves of Equal Depth) tree. LED trees can be used, for example, in computational phylogeny, since they are a natural representative of the time evolution of a set of species in a feature space. This work is focused on LED trees that are length minimizers for a given set of leaves and a given isomorphism type. The underlying minimization problem can be seen as a variant of the classical Euclidean Steiner tree problem. Even though it has a convex objective function, it is rather non-trivial, since it has a non-convex feasible set. The main contribution of this paper is that we prove the uniqueness of a stationary point of the length function on the feasible set. Moreover, we prove several geometrical characteristics of the length minimizers that are analogous to the properties of Steiner minimal trees. We also explore some geometrical and topological properties of the feasible set. At the end, to demonstrate the applicability of our theoretical results, we show an example of an application in historical linguistics.