L-Infinity optimization in tropical geometry and phylogenetics
Abstract
We investigate uniqueness issues that arise in -optimization to linear spaces and Bergman fans of matroids. For linear spaces, we give a polyhedral decomposition of based on the dimension of the set of -nearest neighbors. This implies that the -nearest neighbor in a linear space is unique if and only if the underlying matroid is uniform. For Bergman fans of matroids, we show that the set of -nearest points is a tropical polytope and give an algorithm to compute its tropical vertices. A key ingredient here is a notion of topology that generalizes tree topology. These results have practical implications for distance-based phylogenetic reconstruction using the -metric. We analyze the possible dimensions of the set of -nearest equidistant tree metrics to an arbitrary dissimilarity map and the number of tree topologies represented in this set. For both 3 and 4-leaf trees, we decompose the space of dissimilarity maps relative to the tree topologies represented.
Cite
@article{arxiv.1606.03702,
title = {L-Infinity optimization in tropical geometry and phylogenetics},
author = {Daniel Irving Bernstein and Colby Long},
journal= {arXiv preprint arXiv:1606.03702},
year = {2017}
}
Comments
The contributions of this paper have been split across the following papers: arXiv:1702.05127 and arXiv:1702.05141. Exposition and clarity has been improved in both, especially the in the latter