Self-regenerative Markov chain Monte Carlo with adaptation
From MaRDI portal
Publication:1433458
DOI10.3150/bj/1065444811zbMath1044.62033OpenAlexW1989328058MaRDI QIDQ1433458
Sujit K. Sahu, Anatoly A. Zhigljavsky
Publication date: 18 June 2004
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3150/bj/1065444811
Computational methods in Markov chains (60J22) Bayesian inference (62F15) Numerical analysis or methods applied to Markov chains (65C40)
Related Items
Regenerative Markov Chain Monte Carlo for Any Distribution ⋮ Bayesian networks: regenerative Gibbs samplings ⋮ Rigorous confidence bounds for MCMC under a geometric drift condition ⋮ Rao–Blackwellisation in the Markov Chain Monte Carlo Era ⋮ A vanilla Rao-Blackwellization of Metropolis-Hastings algorithms ⋮ The importance Markov chain ⋮ Adaptive Proposal Construction for Reversible Jump MCMC ⋮ Componentwise adaptation for high dimensional MCMC ⋮ Convergence of adaptive mixtures of importance sampling schemes ⋮ Adaptive proposal distribution for random walk Metropolis algorithm ⋮ Simulation from a Target Distribution Based on Discretization and Weighting ⋮ Nested adaptation of MCMC algorithms ⋮ Regenerative Markov Chain Importance Sampling ⋮ Variational formulas for asymptotic variance of general discrete-time Markov chains
