CLTs and asymptotic variance of time-sampled Markov chains

DOI10.1007/s11009-011-9237-8zbMath1262.60068arXiv1102.2171OpenAlexW2113561010MaRDI QIDQ1945602

Gareth O. Roberts, Krzysztof Łatuszyński

Publication date: 8 April 2013

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

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

zbMATH Keywords

central limit theoremasymptotic varianceMetropolis algorithmMCMC estimationBarker's algorithmtime-sampled Markov chainsvariance bounding Markov chains

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Central limit and other weak theorems (60F05) Discrete-time Markov processes on general state spaces (60J05)

Related Items

The use of a single pseudo-sample in approximate Bayesian computation, Remarks on rates of convergence of powers of contractions, Dimension-Independent MCMC Sampling for Inverse Problems with Non-Gaussian Priors, Optimal scaling of MCMC beyond Metropolis, Barker's algorithm for Bayesian inference with intractable likelihoods, Spectral gaps for a Metropolis-Hastings algorithm in infinite dimensions, Collective proposal distributions for nonlinear MCMC samplers: mean-field theory and fast implementation

Cites Work

• Unnamed Item
• Rigorous confidence bounds for MCMC under a geometric drift condition
• Markov chains and stochastic stability
• Variance bounding Markov chains
• A factorisation of diffusion measure and finite sample path constructions
• General state space Markov chains and MCMC algorithms
• On the Markov chain central limit theorem
• On variance conditions for Markov chain CLTs
• Central limit theorem for additive functionals of reversible Markov processes and applications to simple exclusions
• A note on Metropolis-Hastings kernels for general state spaces
• Geometric ergodicity and hybrid Markov chains
• Geometric convergence rates for time-sampled Markov chains
• Renewal theory and computable convergence rates for geometrically erdgodic Markov chains
• Exact simulation of diffusions
• Retrospective exact simulation of diffusion sample paths with applications
• Optimum Monte-Carlo sampling using Markov chains
• Exact and Computationally Efficient Likelihood-Based Estimation for Discretely Observed Diffusion Processes (with Discussion)
• Fixed-Width Output Analysis for Markov Chain Monte Carlo
• A splitting technique for Harris recurrent Markov chains
• A New Approach to the Limit Theory of Recurrent Markov Chains
• Asymptotic Variance and Convergence Rates of Nearly-Periodic Markov Chain Monte Carlo Algorithms
• Simulating events of unknown probabilities via reverse time martingales
• Monte Carlo sampling methods using Markov chains and their applications
• A regeneration proof of the central limit theorem for uniformly ergodic Markov chains