Identifiability of large phylogenetic mixture models
From MaRDI portal
Publication:417341
DOI10.1007/S11538-011-9672-2zbMATH Open1238.92034arXiv1011.4134OpenAlexW2962845623WikidataQ44851652 ScholiaQ44851652MaRDI QIDQ417341FDOQ417341
Seth Sullivant, John A. Rhodes
Publication date: 14 May 2012
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
Abstract: Phylogenetic mixture models are statistical models of character evolution allowing for heterogeneity. Each of the classes in some unknown partition of the characters may evolve by different processes, or even along different trees. The fundamental question of whether parameters of such a model are identifiable is difficult to address, due to the complexity of the parameterization. We analyze mixture models on large trees, with many mixture components, showing that both numerical and tree parameters are indeed identifiable in these models when all trees are the same. We also explore the extent to which our algebraic techniques can be employed to extend the result to mixtures on different trees.
Full work available at URL: https://arxiv.org/abs/1011.4134
Cites Work
- More factors than subjects, tests and treatments: An indeterminacy theorem for canonical decomposition and individual differences scaling
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Identifiability of parameters in latent structure models with many observed variables
- Mixed-up trees: the structure of phylogenetic mixtures
- Parameter identifiability in a class of random graph mixture models
- Full reconstruction of Markov models on evolutionary trees: identifiability and consistency.
- Phylogenetic invariants for the general Markov model of sequence mutation
- Phylogenetic ideals and varieties for the general Markov model
- Identifying evolutionary trees and substitution parameters for the general Markov model with invariable sites
- Rank and optimal computation of generic tensors
- Identifiability of a Markovian model of molecular evolution with gamma-distributed rates
- A concise proof of Kruskal's theorem on tensor decomposition
- Tree Construction using Singular Value Decomposition
- Title not available (Why is that?)
Cited In (16)
- Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes
- Mixed-up trees: the structure of phylogenetic mixtures
- Phylogenetic trees
- Phylogenetic mixtures: concentration of measure in the large-tree limit
- The rise of statistical phylogenetics
- Identifiability of 3-class Jukes-Cantor mixtures
- Classes of explicit phylogenetic networks and their biological and mathematical significance
- Identifiability of tree-child phylogenetic networks under a probabilistic recombination-mutation model of evolution
- Invariants for level-1 phylogenetic networks under the Cavendar-Farris-Neyman model
- Distinguishing Phylogenetic Networks
- An algorithm for the non-identifiability of rank-3 tensors
- Identifiability and inference of phylogenetic birth-death models
- Parsimony and the rank of a flattening matrix
- Identifiability and inference of non-parametric rates-across-sites models on large-scale phylo\-genies
- Decomposition Algorithms for Tensors and Polynomials
- Tropical geometric variation of tree shapes
This page was built for publication: Identifiability of large phylogenetic mixture models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417341)
