Identifiability of large phylogenetic mixture models
From MaRDI portal
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.
Recommendations
- Phylogenetic mixtures: concentration of measure in the large-tree limit
- Mixed-up trees: the structure of phylogenetic mixtures
- Identifiability of 3-class Jukes-Cantor mixtures
- Identifiability of a Markovian model of molecular evolution with gamma-distributed rates
- Identifiability in phylogenetics using algebraic matroids
Cites work
- A concise proof of Kruskal's theorem on tensor decomposition
- Full reconstruction of Markov models on evolutionary trees: identifiability and consistency.
- Identifiability of a Markovian model of molecular evolution with gamma-distributed rates
- Identifiability of parameters in latent structure models with many observed variables
- Identifying evolutionary trees and substitution parameters for the general Markov model with invariable sites
- Mixed-up trees: the structure of phylogenetic mixtures
- Mixture models in phylogenetic inference
- More factors than subjects, tests and treatments: An indeterminacy theorem for canonical decomposition and individual differences scaling
- Parameter identifiability in a class of random graph mixture models
- Phylogenetic ideals and varieties for the general Markov model
- Phylogenetic invariants for the general Markov model of sequence mutation
- Rank and optimal computation of generic tensors
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Tree Construction using Singular Value Decomposition
Cited in
(24)- Dimensions of group-based phylogenetic mixtures
- Distinguishing phylogenetic networks
- Classes of explicit phylogenetic networks and their biological and mathematical significance
- Invariants for level-1 phylogenetic networks under the Cavendar-Farris-Neyman model
- Decomposition Algorithms for Tensors and Polynomials
- Parsimony and the rank of a flattening matrix
- Identifiability and inference of non-parametric rates-across-sites models on large-scale phylo\-genies
- Mixed-up trees: the structure of phylogenetic mixtures
- Identifiability and inference of phylogenetic birth-death models
- Estimating trees from filtered data: identifiability of models for morphological phylogenetics
- An algorithm for the non-identifiability of rank-3 tensors
- Phylogenetic trees
- Identifiability of a Markovian model of molecular evolution with gamma-distributed rates
- Tropical geometric variation of tree shapes
- Phylogenetic mixtures: concentration of measure in the large-tree limit
- Parameter identifiability in a class of random graph mixture models
- The disentangling number for phylogenetic mixtures
- Phylogenetic mixtures and linear invariants for equal input models
- Mixture models in phylogenetic inference
- Identifiability of tree-child phylogenetic networks under a probabilistic recombination-mutation model of evolution
- Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes
- The rise of statistical phylogenetics
- Identifiability of 3-class Jukes-Cantor mixtures
- Identifiability in phylogenetics using algebraic matroids
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)
