dirty MCMC streams
Iain Murray and Lloyd T. Elliott had posted this paper on arXiv just before I left for my U,K, 2012 tour and I did not have time to read it in detail, nor obviously to report on it. Fortunately, during the ICMS meeting, Iain presented an handmade poster on this paper that allowed me a quick tour, enough to report on the contents! The main point of the paper is that it is possible to modify many standard MCMC codes so that they can be driven by a dependent random sequence. The authors show that various if specific dependent sequences of uniform variates do not modify the right target and the ergodicity of the MCMC scheme. As mentioned in the conclusion of the paper, this may have interesting consequences in parallel implementations where randomness becomes questionable, or in physical random generators, whose independence may also be questionable…
May 7, 2012 at 1:16 pm
Thanks, Radford, I had not seen your discussion when I wrote the post!
May 7, 2012 at 4:47 am
You can read some discussion of Murray and Elliott’s paper and a related paper of mine at http://radfordneal.wordpress.com/2012/05/03/non-random-mcmc/