Related papers: Convexity in Tree Spaces
Phylogenetics is now fundamental in life sciences, providing insights into the earliest branches of life and the origins and spread of epidemics. However, finding suitable phylogenies from the vast space of possible trees remains…
In this work, we introduce a Tropical Axial Attention neural reasoning architecture that replaces vanilla softmax dot-product attention with max-plus operators, inducing a piecewise-linear structure aligned with dynamic programming…
Given a tree $T$, its path polytope is the convex hull of the edge indicator vectors for the paths between any two distinct leaves in $T$. These polytopes arise naturally in polyhedral geometry and applications, such as phylogenetics,…
Treemaps are a popular technique to visualize hierarchical data. The input is a weighted tree $\tree$ where the weight of each node is the sum of the weights of its children. A treemap for $\tree$ is a hierarchical partition of a rectangle…
In this paper we investigate the geometry of a discrete Bayesian network whose graph is a tree all of whose variables are binary and the only observed variables are those labeling its leaves. We provide the full geometric description of…
Ultrametric matrices have a rich structure that is not apparent from their definition. Notably, the subclass of strictly ultrametric matrices are covariance matrices of certain weighted rooted binary trees. In applications, these matrices…
Weighted Finite State Transducers (WFSTs) are versatile data structures that can model a great number of problems, ranging from Automatic Speech Recognition to DNA sequencing. Traditional computer science algorithms are employed when…
Ultrametric trees are trees whose leaves lie at the same distance from the root. They are used to model the genealogy of a population of particles co-existing at the same point in time. We show how the boundary of an ultrametric tree, like…
A natural metric on the space of all almost hermitian structures on a given manifold is investigated.
We investigate the interrelations between the metric properties, order properties and combinatorial properties of the set of balls in totally bounded ultrametric space. In particular, the Gurvich-Vyalyi representation of finite, ultrametric…
In this paper we consider two aspects of the inverse problem of how to construct merge trees realizing a given barcode. Much of our investigation exploits a recently discovered connection between the symmetric group and barcodes in general…
Tree convex sets refer to a collection of sets such that each set in the collection is a subtree of a tree whose nodes are the elements of these sets. They extend the concept of row convex sets each of which is an interval over a total…
We introduce a notion of dimension of max-min convex sets, following the approach of tropical convexity. We introduce a max-min analogue of the tropical rank of a matrix and show that it is equal to the dimension of the associated polytope.…
We study topological properties of random metric spaces which arise by Lambda-coalescents. These are stochastic processes, which start with an infinite number of lines and evolve through multiple mergers in an exchangeable setting. We show…
We show that an infinite weighted tree admits a bi-Lipschitz embedding into Hilbert space if and only if it does not contain arbitrarily large complete binary trees with uniformly bounded distortion. We also introduce a new metric invariant…
We introduce and study a variant of the Wasserstein distance on the space of probability measures, specially designed to deal with measures whose support has a dendritic, or treelike structure with a particular direction of orientation. Our…
Starting from the classical notion of an oriented congruence (i.e. a foliation by oriented curves) in $R^3$, we abstract the notion of an oriented congruence structure. This is a 3-dimensional CR manifold $(M,H, J)$ with a preferred…
We study a parametric version of the Fermat-Weber problem with respect to an asymmetric distance function, which occurs naturally in tropical geometry. Our results yield a method for constructing phylogenetic supertrees.
We construct a logarithmic version of the Hilbert scheme, and more generally the Quot scheme, of a simple normal crossings pair. The logarithmic Quot space admits a natural tropicalisation called the space of tropical supports, which is a…
In this paper we study tropicalization of Grassmannian and linear varieties. In particular, we study the tropical linear spaces cor- responding to the phylogenetic trees. We prove that corresponding to each subtree of the phylogenetic tree…