Extending the Latent Multinomial Model with Complex Error Processes and Dynamic Markov Bases
Simon J Bonner, Matthew R Schofield, Patrik Noren, and Steven J Price

TL;DR
This paper extends the latent multinomial model for mark-recapture data by incorporating complex error processes and dynamic Markov bases, improving modeling flexibility and computational feasibility for studies with error-prone identification methods.
Contribution
It introduces a novel extension of the LMM that separates the capture and error processes and develops a dynamic Markov basis MCMC scheme for complex error models.
Findings
Dynamic Markov bases enable efficient sampling for complex error models.
Simulation shows improved accuracy in survival estimates with the extended model.
Application to snake data demonstrates practical utility.
Abstract
The latent multinomial model (LMM) model of Link et al. (2010) provided a general framework for modelling mark-recapture data with potential errors in identification. Key to this approach was a Markov chain Monte Carlo (MCMC) scheme for sampling possible configurations of the counts true capture histories that could have generated the observed data. This MCMC algorithm used vectors from a basis for the kernel of the linear map between the true and observed counts to move between the possible configurations of the true data. Schofield and Bonner (2015) showed that a strict basis was sufficient for some models of the errors, including the model presented by Link et al. (2010), but a larger set called a Markov basis may be required for more complex models. We address two further challenges with this approach: 1) that models with more complex error mechanisms do not fit easily within the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
