Equidistant Circular Split Networks
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914950335692800 |
|---|---|
| author | Kagy, Bryson Sullivant, Seth |
| author_facet | Kagy, Bryson Sullivant, Seth |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_11032 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Equidistant Circular Split Networks Kagy, Bryson Sullivant, Seth Combinatorics Populations and Evolution 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. |
| title | Equidistant Circular Split Networks |
| topic | Combinatorics Populations and Evolution |
| url | https://arxiv.org/abs/2402.11032 |