Convergence rates of Metropolis-Hastings algorithms

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
Markov chain Monte Carlo confidence intervals
Central limit theorem for Markov processes with spectral gap in the Wasserstein metric
Spectral gaps for a Metropolis-Hastings algorithm in infinite dimensions
Subgeometric rates of convergence in Wasserstein distance for Markov chains
Quantitative non-geometric convergence bounds for independence samplers
Quantitative bounds for Markov chain convergence: Wasserstein and total variation distances
Asymptotic coupling and a general form of Harris' theorem with applications to stochastic delay equations
On the ergodicity properties of some adaptive MCMC algorithms
Markov chain Monte Carlo: can we trust the third significant figure?
On the Markov chain central limit theorem
Central limit theorem for additive functionals of reversible Markov processes and applications to simple exclusions
What do we know about the Metropolis algorithm?
A note on Metropolis-Hastings kernels for general state spaces
Exponential convergence of Langevin distributions and their discrete approximations
Honest exploration of intractable probability distributions via Markov chain Monte Carlo.
On the criterion, that a given system of deviations from the probable in the case of a correlated system of variables is such that it can be reasonably supposed to have arisen from random sampling.
Locally contractive iterated function systems
Bounds on regeneration times and convergence rates for Markov chains
Geometric ergodicity of Metropolis algorithms
Quantitative bounds on convergence of time-inhomogeneous Markov chains
Renewal theory and computable convergence rates for geometrically erdgodic Markov chains
Sufficient burn-in for Gibbs samplers for a hierarchical random effects model.
Markov chains for exploring posterior distributions. (With discussion)
Rates of convergence of the Hastings and Metropolis algorithms
Geometric ergodicity and the spectral gap of non-reversible Markov chains
Irreducibility and geometric ergodicity of Hamiltonian Monte Carlo
Wasserstein-based methods for convergence complexity analysis of MCMC with applications
Convergence rates of two-component MCMC samplers
Exact convergence analysis of the independent Metropolis-Hastings algorithms
On the limitations of single-step drift and minorization in Markov chain convergence analysis
On the geometric ergodicity of Hamiltonian Monte Carlo
On the computational complexity of MCMC-based estimators in large samples
Error bounds for Metropolis-Hastings algorithms applied to perturbations of Gaussian measures in high dimensions
Subgeometric rates of convergence of Markov processes in the Wasserstein metric
Coupling and convergence for Hamiltonian Monte Carlo
Harris-type results on geometric and subgeometric convergence to equilibrium for stochastic semigroups
Yet Another Look at Harris’ Ergodic Theorem for Markov Chains
Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
Fixed-Width Output Analysis for Markov Chain Monte Carlo
Handbook of Markov Chain Monte Carlo
Markov Chains and Stochastic Stability
Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
Random walks in a convex body and an improved volume algorithm
Conductance bounds on the L² convergence rate of Metropolis algorithms on unbounded state spaces
Markov Chains
Riemann Manifold Langevin and Hamiltonian Monte Carlo Methods
Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
Nonasymptotic mixing of the MALA algorithm
A note on acceptance rate criteria for CLTS for Metropolis–Hastings algorithms
Multivariate output analysis for Markov chain Monte Carlo
Assessing and Visualizing Simultaneous Simulation Error
Convergence of Conditional Metropolis-Hastings Samplers
Equation of State Calculations by Fast Computing Machines
The Hastings algorithm at fifty
MCMC for Imbalanced Categorical Data
Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
Monte Carlo sampling methods using Markov chains and their applications
Optimal Transport
An adaptive Metropolis algorithm
Quantitative bounds of convergence for geometrically ergodic Markov chain in the Wasserstein distance with application to the Metropolis adjusted Langevin algorithm
Component-wise Markov chain Monte Carlo: uniform and geometric ergodicity under mixing and composition
Dimension-Free Mixing for High-Dimensional Bayesian Variable Selection
Convergence of Position-Dependent MALA with Application to Conditional Simulation in GLMMs
Complexity results for MCMC derived from quantitative bounds
Efficient shape-constrained inference for the autocovariance sequence from a reversible Markov chain
Exact convergence analysis for metropolis–hastings independence samplers in Wasserstein distances
Explicit convergence bounds for Metropolis Markov chains: isoperimetry, spectral gaps and profiles

This page was built for publication: Convergence rates of Metropolis-Hastings algorithms