Papers › Exact Likelihoods for N-mixture models with Time-to-Detection Data
Exact Likelihoods for N-mixture models with Time-to-Detection Data
Linda M Haines, Res Altwegg, David L. Borchers
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper is concerned with the formulation of N-mixture models for estimating the abundance and probability of detection of a species from binary response, count and time-to-detection data. A modelling framework, which encompasses time-to-first-detection within the context of detection/non-detection and time-to-each-detection and time-to-first-detection within the context of count data, is introduced. Two observation processes which depend on whether or not double counting is assumed to occur are also considered. The main focus of the paper is on the derivation of explicit forms for the likelihoods associated with each of the proposed models. Closed-form expressions for the likelihoods associated with time-to-detection data are new and are developed from the theory of order statistics. A key finding of the study is that, based on the assumption of no double counting, the likelihoods associated with times-to-detection together with count data are the product of the likelihood for the counts alone and a term which depends on the detection probability parameter. This result demonstrates that, in this case, recording times-to-detection could well improve precision in estimation over recording counts alone. In contrast, for the double counting protocol with exponential arrival times, no information was found to be gained by recording times-to-detection in addition to the count data. An R package and an accompanying vignette are also introduced in order to complement the algebraic results and to demonstrate the use of the models in practice.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections