Variance bounding of delayed-acceptance kernels

DOI10.1007/S11009-021-09914-1zbMath1494.60079arXiv1706.02142OpenAlexW3214755068MaRDI QIDQ2157432

Chris Sherlock, Anthony J. T. Lee

Publication date: 28 July 2022

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.02142

zbMATH Keywords

Metropolis-Hastingsconductancevariance boundingdelayed-acceptance

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Delayed acceptance particle MCMC for exact inference in stochastic kinetic models
• Markov chains and stochastic stability
• Variance bounding Markov chains
• General state space Markov chains and MCMC algorithms
• A note on Metropolis-Hastings kernels for general state spaces
• Exponential convergence of Langevin distributions and their discrete approximations
• Geometric ergodicity and hybrid Markov chains
• Geometric ergodicity of Metropolis algorithms
• Markov chains for exploring posterior distributions. (With discussion)
• Rates of convergence of the Hastings and Metropolis algorithms
• Efficiency of delayed-acceptance random walk metropolis algorithms
• Importance sampling correction versus standard averages of reversible MCMCs in terms of the asymptotic variance
• On the geometric ergodicity of Hamiltonian Monte Carlo
• Variance bounding and geometric ergodicity of Markov chain Monte Carlo kernels for approximate Bayesian computation
• Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
• Optimum Monte-Carlo sampling using Markov chains
• Speeding up MCMC by Delayed Acceptance and Data Subsampling
• A First Course in Bayesian Statistical Methods
• Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
• Monte Carlo strategies in scientific computing

This page was built for publication: Variance bounding of delayed-acceptance kernels