Statistics – Computation
Scientific paper
2008-07-30
Electronic Journal of Statistics 2008, Vol. 2, 634-660
Statistics
Computation
Published in at http://dx.doi.org/10.1214/07-EJS162 the Electronic Journal of Statistics (http://www.i-journals.org/ejs/) by t
Scientific paper
10.1214/07-EJS162
In Markov chain Monte Carlo (MCMC) sampling considerable thought goes into constructing random transitions. But those transitions are almost always driven by a simulated IID sequence. Recently it has been shown that replacing an IID sequence by a weakly completely uniformly distributed (WCUD) sequence leads to consistent estimation in finite state spaces. Unfortunately, few WCUD sequences are known. This paper gives general methods for proving that a sequence is WCUD, shows that some specific sequences are WCUD, and shows that certain operations on WCUD sequences yield new WCUD sequences. A numerical example on a 42 dimensional continuous Gibbs sampler found that some WCUD inputs sequences produced variance reductions ranging from tens to hundreds for posterior means of the parameters, compared to IID inputs.
Owen Art B.
Tribble Seth D.
No associations
LandOfFree
Construction of weakly CUD sequences for MCMC sampling 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 Construction of weakly CUD sequences for MCMC sampling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Construction of weakly CUD sequences for MCMC sampling will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-259626