Hostname: page-component-5db58dd55d-lqwgf Total loading time: 0 Render date: 2026-06-14T15:06:30.648Z Has data issue: false hasContentIssue false

Maximum likelihood estimation for spinal-structured trees

Published online by Cambridge University Press:  03 October 2024

Romain Azaïs*
Affiliation:
Inria team MOSAIC
Benoît Henry*
Affiliation:
IMT Nord Europe
*
*Postal address: ÉNS de Lyon, 46 Allée d’Italie, 69 007 Lyon, France. Email address: romain.azais@inria.fr
**Postal address: Institut Mines-Télécom, Univ. Lille, 59 000 Lille, France. Email address: benoit.henry@imt-nordeurope.fr

Abstract

We investigate some aspects of the problem of the estimation of birth distributions (BDs) in multi-type Galton–Watson trees (MGWs) with unobserved types. More precisely, we consider two-type MGWs called spinal-structured trees. This kind of tree is characterized by a spine of special individuals whose BD $\nu$ is different from the other individuals in the tree (called normal, and whose BD is denoted by $\mu$). In this work, we show that even in such a very structured two-type population, our ability to distinguish the two types and estimate $\mu$ and $\nu$ is constrained by a trade-off between the growth-rate of the population and the similarity of $\mu$ and $\nu$. Indeed, if the growth-rate is too large, large deviation events are likely to be observed in the sampling of the normal individuals, preventing us from distinguishing them from special ones. Roughly speaking, our approach succeeds if $r\lt \mathfrak{D}(\mu,\nu)$, where r is the exponential growth-rate of the population and $\mathfrak{D}$ is a divergence measuring the dissimilarity between $\mu$ and $\nu$.

Information

Type
Original Article
Copyright
© The Author(s), 2024. Published by Cambridge University Press on behalf of Applied Probability Trust

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable