Abstract

We examine the convergence properties of some simple Gibbs sampler examples under various scans. We find some surprising results, including Gibbs samplers where deterministic-scan is much more efficient than random-scan, and other samplers where the opposite is true.  We also present an example where the convergence takes precisely the same time with any fixed deterministic scan, but modifying the scan in any way leads to significantly slower convergence.

This work is licensed under a Creative Commons Attribution 4.0 License.