Inverting random functions. III: Discrete MLE revisited

DOI10.1007/S00026-009-0023-ZzbMATH Open1277.62079arXivmath/0608273OpenAlexW2046247607MaRDI QIDQ659798FDOQ659798

Authors: Mike Steel, László A. Székely 

Publication date: 24 January 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

Abstract: This paper continues our earlier investigations into the inversion of random functions in a general (abstract) setting. In Section 2 we investigate a concept of invertibility and the invertibility of the composition of random functions. In Section 3 we resolve some questions concerning the number of samples required to ensure the accuracy of parametric maximum likelihood estimation (MLE). A direct application to phylogeny reconstruction is given.

Full work available at URL: https://arxiv.org/abs/math/0608273

Recommendations

• Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications
• Inverting random functions
• Maximum likelihood estimation for discrete exponential families and random graphs
• Efficient algorithms for inverting evolution
• scientific article; zbMATH DE number 1256739

zbMATH Keywords

maximum likelihood estimationrandom functionphylogeny reconstruction

Mathematics Subject Classification ID

Point estimation (62F10) Taxonomy, cladistics, statistics in mathematical biology (92B10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Note on the Consistency of the Maximum Likelihood Estimate
• Full reconstruction of Markov models on evolutionary trees: identifiability and consistency.
• Inverting random functions
• A few logs suffice to build (almost) all trees (I)
• Identifiability of a Markovian model of molecular evolution with gamma-distributed rates
• Teasing Apart Two Trees
• Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications
• Title not available (Why is that?)

Cited In (5)

• Consistency and convergence rate of phylogenetic inference via regularization
• Phylogenetic information complexity: is testing a tree easier than finding it?
• Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications
• Inverting random functions
• Consistency of Bayesian inference of resolved phylogenetic trees

This page was built for publication: Inverting random functions. III: Discrete MLE revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659798)