scientific article
From MaRDI portal
Publication:3608241
zbMath1164.65004MaRDI QIDQ3608241
Gareth O. Roberts, Søren Fiig Jarner
Publication date: 28 February 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
numerical examplescentral limit theoremGibbs samplerpolynomial ergodicityLangevin algorithmrandom-walk Metropolis algorithm
Computational methods in Markov chains (60J22) Central limit and other weak theorems (60F05) Monte Carlo methods (65C05) Sums of independent random variables; random walks (60G50) Numerical analysis or methods applied to Markov chains (65C40)
Related Items (18)
Which ergodic averages have finite asymptotic variance? ⋮ MCMC Algorithms for Posteriors on Matrix Spaces ⋮ Quenched phantom distribution functions for Markov chains ⋮ Objective priors for the number of degrees of freedom of a multivariate \(t\) distribution and the \(t\)-copula ⋮ Phantom distribution functions for some stationary sequences ⋮ Metropolis-Hastings algorithms with acceptance ratios of nearly 1 ⋮ Nonasymptotic bounds on the estimation error of MCMC algorithms ⋮ Limit theorems for some adaptive MCMC algorithms with subgeometric kernels. II ⋮ Optimal scaling of random walk Metropolis algorithms with non-Gaussian proposals ⋮ Markov chain Monte Carlo estimation of quantiles ⋮ Robust adaptive Metropolis algorithm with coerced acceptance rate ⋮ Variable transformation to obtain geometric ergodicity in the random-walk Metropolis algorithm ⋮ Ergodicity of Markov chain Monte Carlo with reversible proposal ⋮ Random walk Metropolis algorithm in high dimension with non-Gaussian target distributions ⋮ Limit theorems for the zig-zag process ⋮ Irreversible samplers from jump and continuous Markov processes ⋮ A note on the polynomial ergodicity of the one-dimensional Zig-Zag process ⋮ Comparison of Markov chains via weak Poincaré inequalities with application to pseudo-marginal MCMC
This page was built for publication:
