The disentangling number for phylogenetic mixtures
Seth Sullivant

TL;DR
This paper establishes a logarithmic upper bound for the disentangling number in phylogenetic mixture models, aiding in the analysis of complex evolutionary data through a novel interpretation of tree multisets as high-dimensional tables.
Contribution
It introduces a new logarithmic bound for the disentangling number, enhancing understanding of phylogenetic mixture models with a multiset-to-table interpretation.
Findings
Logarithmic upper bound for the disentangling number
Application to phylogenetic mixture models
Novel interpretation of tree multisets as contingency tables
Abstract
We provide a logarithmic upper bound for the disentangling number on unordered lists of leaf labeled trees. This results is useful for analyzing phylogenetic mixture models. The proof depends on interpreting multisets of trees as high dimensional contingency tables.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
