Necessary conditions for geometric and polynomial ergodicity of random-walk-type Markov chains

DOI10.3150/bj/1066223269zbMath1043.60054OpenAlexW1964394336MaRDI QIDQ1431532

Richard L. Tweedie, Søren Fiig Jarner

Publication date: 10 June 2004

Published in: Bernoulli (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.bj/1066223269

zbMATH Keywords

momentsrate of convergenceMarkov chain Monte Carlostationary distributionMetropolis algorithm

Mathematics Subject Classification ID

Discrete-time Markov processes on general state spaces (60J05)

Related Items

Cauchy Markov random field priors for Bayesian inversion, Information-geometric Markov chain Monte Carlo methods using diffusions, SUBGEOMETRICALLY ERGODIC AUTOREGRESSIONS, MCMC Algorithms for Posteriors on Matrix Spaces, Error Bounds for Augmented Truncations of Discrete-Time Block-Monotone Markov Chains under Subgeometric Drift Conditions, Convergence of Position-Dependent MALA with Application to Conditional Simulation in GLMMs, Nonasymptotic bounds on the estimation error of MCMC algorithms, Several types of convergence rates of the \(M/G/1\) queueing system, Subgeometric ergodicity and β-mixing, Fast mixing of Metropolis-Hastings with unimodal targets, Fourier transform MCMC, heavy-tailed distributions, and geometric ergodicity, Variable transformation to obtain geometric ergodicity in the random-walk Metropolis algorithm, Ergodicity of Markov chain Monte Carlo with reversible proposal, On the geometric ergodicity of Hamiltonian Monte Carlo, Convergence rates and moments of Markov chains associated with the mean of Dirichlet processes., A note on the polynomial ergodicity of the one-dimensional Zig-Zag process