Data Augmentation and Reversible Jump MCMC for Multinomial Index Problems

Statistics – Applications

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

A feature of multinomial models with unknown index $N$ is that the dimension of the parameter space potentially depends on $N$, a complication when fitting models by Markov chain Monte Carlo (MCMC). Two commonly used approaches to this problem are: (i) trans-dimensional reversible jump MCMC and (ii) superpopulation data augmentation. A distinguishing feature of the two approaches is that $N$, and combinatorial terms involving $N$, are not explicit in the superpopulation likelihood. To resolve ambiguity about the relationship between the two approaches we compare them analytically. We show that superpopulation data augmentation is equivalent to trans-dimensional sampling but with a restricted prior on $N$. We highlight potential drawbacks that result from not making $N$ explicit in the likelihood in the superpopulation approach. One advantage of the superpopulation approach has been the availability of easy to use BUGS code. We provide simple BUGS code that implements trans-dimensional reversible jump MCMC for the mark-recapture model $M_h$ that can be readily extended to related models.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Data Augmentation and Reversible Jump MCMC for Multinomial Index Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Data Augmentation and Reversible Jump MCMC for Multinomial Index Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data Augmentation and Reversible Jump MCMC for Multinomial Index Problems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-476456

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.