On random- and systematic-scan samplers

DOI10.1093/BIOMET/ASW019zbMATH Open1506.62010OpenAlexW2511006079MaRDI QIDQ5384404FDOQ5384404

Authors:

Publication date: 24 June 2019

Published in: Biometrika (Search for Journal in Brave)

Full work available at URL: https://research-information.bris.ac.uk/ws/files/72476340/novice_final_supplemental.pdf

Recommendations

• Optimizing random scan Gibbs samplers
• A note on Markov chain Monte Carlo sweep strategies
• scientific article; zbMATH DE number 720679
• Geometric ergodicity and scanning strategies for two-component Gibbs samplers
• Information bounds for Gibbs samplers

zbMATH Keywords

Markov chain Monte CarloMetropolis-within-Gibbs algorithmPeskun orderdeterministic-scan samplerrandom-scan sampler

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Computational methods for problems pertaining to statistics (62-08) Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40)

Cited In (9)

• Markov Kernels Local Aggregation for Noise Vanishing Distribution Sampling
• A hybrid scan Gibbs sampler for Bayesian models with latent variables
• Convergence rates of two-component MCMC samplers
• Analysis of two-component Gibbs samplers using the theory of two projections
• Peskun-Tierney ordering for Markovian Monte Carlo: beyond the reversible scenario
• Title not available (Why is that?)
• Importance sampling correction versus standard averages of reversible MCMCs in terms of the asymptotic variance
• Non-reversible guided Metropolis kernel
• Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques

This page was built for publication: On random- and systematic-scan samplers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384404)