Necessary conditions for geometric and polynomial ergodicity of random-walk-type Markov chains
From MaRDI portal
(Redirected from Publication:1431532)
Recommendations
- A note on the geometric ergodicity of a Markov chain
- Geometric ergodicity for classes of homogeneous Markov chains
- scientific article; zbMATH DE number 1531952
- Strengthening ergodicity to geometric ergodicity for markov chains
- Conditions of ergodicity of almost homogeneous Markov chains
- Geometric ergodicity and hybrid Markov chains
- Some sufficient conditions for non-ergodicity of markov chains
- Characterization and sufficient conditions for normed ergodicity of Markov chains
Cited in
(25)- Error bounds for augmented truncations of discrete-time block-monotone Markov chains under subgeometric drift conditions
- Fast mixing of Metropolis-Hastings with unimodal targets
- Practical drift conditions for subgeometric rates of convergence.
- Polynomial ergodicity of Markov transition kernels.
- Geometric ergodicity of Metropolis algorithms
- Fourier transform MCMC, heavy-tailed distributions, and geometric ergodicity
- On the geometric ergodicity of Hamiltonian Monte Carlo
- Polynomial convergence rates of Markov chains
- Cauchy Markov random field priors for Bayesian inversion
- Information-geometric Markov chain Monte Carlo methods using diffusions
- MCMC Algorithms for Posteriors on Matrix Spaces
- Rademacher complexity for Markov chains: applications to kernel smoothing and Metropolis-Hastings
- Ergodicity of Markov chain Monte Carlo with reversible proposal
- Variable transformation to obtain geometric ergodicity in the random-walk Metropolis algorithm
- Subgeometric ergodicity and \(\beta\)-mixing
- Rates of convergence of some multivariate Markov chains with polynomial eigenfunctions
- Convergence of Position-Dependent MALA with Application to Conditional Simulation in GLMMs
- SUBGEOMETRICALLY ERGODIC AUTOREGRESSIONS
- Geometric convergence rates for time-sampled Markov chains
- A note on the polynomial ergodicity of the one-dimensional Zig-Zag process
- Several types of convergence rates of the \(M/G/1\) queueing system
- A note on geometric ergodicity and floating-point roundoff error
- Spectral gaps of random walk Metropolis chains
- Convergence rates and moments of Markov chains associated with the mean of Dirichlet processes.
- Nonasymptotic bounds on the estimation error of MCMC algorithms
This page was built for publication: Necessary conditions for geometric and polynomial ergodicity of random-walk-type Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1431532)
