We focus on a capture-recapture model in which capture probabilities arise from an unspecified distribution F. We show that model parameters are identifiable based on the unconditional likelihood. This is not true with the conditional likelihood. We also clarify that consistency and asymptotic equivalence of maximum likelihood estimators based on conditional and unconditional likelihood do not hold. We show that estimates of the undetected fraction of population based on the unconditional likelihood converge to the so-called estimable sharpest lower bound and we derive a new asymptotic equivalence result. We finally provide theoretical and simulation arguments in favor of the use of the unconditional likelihood rather than the conditional likelihood especially when one is willing to infer on the sharpest lower bound.
Identifiability and inferential issues in capture-recapture experiments with heterogeneous detection probabilities / Farcomeni, Alessio; Tardella, Luca. - In: ELECTRONIC JOURNAL OF STATISTICS. - ISSN 1935-7524. - 6:0(2012), pp. 2602-2626. [10.1214/12-ejs758]
Identifiability and inferential issues in capture-recapture experiments with heterogeneous detection probabilities
FARCOMENI, Alessio;TARDELLA, Luca
2012
Abstract
We focus on a capture-recapture model in which capture probabilities arise from an unspecified distribution F. We show that model parameters are identifiable based on the unconditional likelihood. This is not true with the conditional likelihood. We also clarify that consistency and asymptotic equivalence of maximum likelihood estimators based on conditional and unconditional likelihood do not hold. We show that estimates of the undetected fraction of population based on the unconditional likelihood converge to the so-called estimable sharpest lower bound and we derive a new asymptotic equivalence result. We finally provide theoretical and simulation arguments in favor of the use of the unconditional likelihood rather than the conditional likelihood especially when one is willing to infer on the sharpest lower bound.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.