Connecting the latent multinomial
Matthew R. Schofield, Simon J. Bonner

TL;DR
This paper refines Bayesian methods for capture-recapture data analysis by emphasizing the necessity of Markov bases over simple bases for ensuring irreducible Markov chains, with proofs and examples illustrating their importance.
Contribution
It demonstrates that using Markov bases is essential for proper Bayesian sampling in capture-recapture models and provides a constructive method to obtain such bases.
Findings
Markov bases ensure irreducibility in Markov chain sampling
A specific lattice basis is proven to be a Markov basis for certain models
The paper offers a method to construct Markov bases for classes of models
Abstract
Link et al. (2010) define a general framework for analyzing capture-recapture data with potential misidentifications. In this framework, the observed vector of counts, , is considered as a linear function of a vector of latent counts, , such that , with assumed to follow a multinomial distribution conditional on the model parameters, . Bayesian methods are then applied by sampling from the joint posterior distribution of both and . In particular, Link et al. (2010) propose a Metropolis-Hastings algorithm to sample from the full conditional distribution of , where new proposals are generated by sequentially adding elements from a basis of the null space (kernel) of . We consider this algorithm and show that using elements from a simple basis for the kernel of may not produce an irreducible Markov chain. Instead, we require a Markov basis,…
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.
