Equidistant Circular Split Networks
Combinatorics
2024-09-18 v2 Populations and Evolution
Abstract
Phylogenetic networks are generalizations of trees that allow for the modeling of non-tree like evolutionary processes. Split networks give a useful way to construct networks with intuitive distance structures induced from the associated split graph. We explore the polyhedral geometry of distance matrices built from circular split systems which have the added property of being equidistant. We give a characterization of the facet defining inequalities and the extreme rays of the cone of distances that arises from an equidistant network associated to any circular split network. We also explain a connection to the Chan-Robbins-Yuen polytope from geometric combinatorics.
Cite
@article{arxiv.2402.11032,
title = {Equidistant Circular Split Networks},
author = {Bryson Kagy and Seth Sullivant},
journal= {arXiv preprint arXiv:2402.11032},
year = {2024}
}