Necessary and sufficient conditions for consistent root reconstruction in Markov models on trees
From MaRDI portal
Publication:1663866
DOI10.1214/18-EJP165zbMath1410.60074arXiv1707.05702MaRDI QIDQ1663866
Sebastien Roch, Wai-Tong (Louis) Fan
Publication date: 24 August 2018
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.05702
reconstruction problemconcentration inequalitiesconsistent estimationinformation-theoretic boundsMarkov models on treesapplications to phylogenetics
Problems related to evolution (92D15) Markov processes: estimation; hidden Markov models (62M05) Continuous-time Markov processes on general state spaces (60J25) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Genetics and epigenetics (92D10)
Related Items
When can we reconstruct the ancestral state? Beyond Brownian motion, When can we reconstruct the ancestral state? A unified theory, Statistically consistent and computationally efficient inference of ancestral DNA sequences in the TKF91 model under dense taxon sampling, Sufficient condition for root reconstruction by parsimony on binary trees with general weights, Species tree estimation under joint modeling of coalescence and duplication: sample complexity of quartet methods, An impossibility result for phylogeny reconstruction from \(k\)-mer counts, Ancestral state reconstruction with large numbers of sequences and edge-length estimation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic theory with hierarchical autocorrelation: Ornstein-Uhlenbeck tree models
- Inferring ancestral sequences in taxon-rich phylogenies
- Global alignment of molecular sequences via ancestral state reconstruction
- Reconstruction for the Potts model
- Reconstruction of random colourings
- A survey of results for deletion channels and related synchronization channels
- Continuous-time Markov chains. An applications-oriented approach
- Inverting random functions
- Information flow on trees
- On the purity of the limiting Gibbs state for the Ising model on the Bethe lattice.
- Reconstruction on trees: Beating the second eigenvalue
- Broadcasting on trees and the Ising model.
- On the extremality of the disordered state for the Ising model on the Bethe lattice
- Phylogeny
- Reconstruction for Colorings on Trees
- Reconstruction Threshold for the Hardcore Model
- Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications
- Probability Inequalities for Sums of Bounded Random Variables
- Testing Statistical Hypotheses
- Elements of Information Theory
- Additional Limit Theorems for Indecomposable Multidimensional Galton-Watson Processes
- Probability