Estimation of parental abundance using hierarchical Bayesian modeling with data augmentation

Abstract

Pedigree-based estimation methods leverage the fact that each offspring in a cohort is genotypically “marked” by its parents and represent a recent and promising toolset for estimating population dynamics. This includes pedigree accumulation estimators that model the “accumulation” of inferred unique parents within a given cohort to estimate parental abundance. Unlike close-kin mark-recapture approaches, which rely on intercohort comparisons, pedigree accumulation modeling can be completed solely using intracohort samples. This is particularly advantageous for semelparous species, where intercohort pairs are impossible and adult life stages can be difficult to sample without affecting their likelihood of successfully reproducing. Previous work has evaluated a range of estimators for such datasets, concluding that the non-parametric Chao estimator provides the most accurate and precise estimates for feasible levels of sampling effort. We used simulated data to evaluate an alternative estimator based on hierarchical modeling and data augmentation in a Bayesian framework. Results indicate that estimates from the hierarchical Bayesian estimator had comparable accuracy and better precision than both the previously tested Chao1 estimator and the improved iChao formulation across a range of sample sizes and sex ratios. Furthermore, the Bayesian estimator was far more robust to simulated errors in pedigree reconstruction, especially the presence of false negatives. Hierarchical Bayesian pedigree accumulation models can also provide additional insight into underlying reproductive ecology through their use of an explicit observation process, allowing for the incorporation or estimation of species- and population-specific reproductive dynamics. More broadly, the parametric nature of these models offers opportunities to efficiently pool information among datasets as well as to propagate uncertainty within more complex models.