Inverting Random Functions III: Discrete MLE Revisited

2006/08/10 by Mike Steel, Mike A. Steel, Łászló A. Székely +3 · 2 citations
Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · #Algorithms and Data Compression #Bayesian Methods and Mixture Models #FOS: Mathematics #Fractal and DNA sequence analysis #Probability (math.PR) #math.PR

paper · pdf · doi:10.48550/arxiv.math/0608273

arxiv created 2006/08/10 · openalex publication_date 2006/08/10 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

• Asymptotic guarantees for Bayesian phylogenetic tree reconstruction
• Phylogenetic information complexity: Is testing a tree easier than finding it?

Related

• Expected number of inversions after a sequence of random adjacent transpositions
• Solving a Machine Learning Regression Problem Based on the Theory of Random Functions
• Burstein's permutation conjecture, Hong and Li's inversion sequence conjecture, and restricted Eulerian distributions
• Online Supplement to "Random Variate Generation by Numerical Inversion When Only the Density Is Known"
• Refined restricted inversion sequences