Abstract

In Markov chain Monte Carlo analysis, rapid convergence of the chain to its target distribution is crucial. A chain that converges geometrically quickly is geometrically ergodic. We explore geometric ergodicity for two-component Gibbs samplers (GS) that, under a chosen scanning strategy, evolve through one-at-a-time component-wise updates. We consider three such strategies: composition, random sequence, and random scans. We show that if any one of these scans produces a geometrically ergodic GS, so too do the others. Further, we provide a simple set of sufficient conditions for the geometric ergodicity of the GS. We illustrate our results using two examples.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.