Polynomial ergodicity of Markov transition kernels.
From MaRDI portal
Publication:2574534
DOI10.1016/S0304-4149(02)00182-5zbMath1075.60547MaRDI QIDQ2574534
Publication date: 29 November 2005
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Computational methods in Markov chains (60J22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40)
Related Items
Practical drift conditions for subgeometric rates of convergence., SUBGEOMETRICALLY ERGODIC AUTOREGRESSIONS, Uniform ergodicity of continuous-time controlled Markov chains: a survey and new results, Explicit convergence rates of the embedded \(\mathrm{M}/\mathrm{G}/1\) queue, Limit theorems for some adaptive MCMC algorithms with subgeometric kernels, Subexponential upper and lower bounds in Wasserstein distance for Markov processes, Quantitative Convergence Rates for Subgeometric Markov Chains, The ODE method for stability of skip-free Markov chains with applications to MCMC, Markov chain Monte Carlo: can we trust the third significant figure?, Polynomial convergence rates of piecewise deterministic Markov processes, Nonasymptotic bounds on the estimation error of MCMC algorithms, On nonlinear Markov chain Monte Carlo, Convergence of adaptive and interacting Markov chain Monte Carlo algorithms, On sub-geometric ergodicity of diffusion processes, A central limit theorem for adaptive and interacting Markov chains, Markov chain Monte Carlo estimation of quantiles, Subgeometric ergodicity and β-mixing, MCMC design-based non-parametric regression for rare event. application to nested risk computations, Quantitative non-geometric convergence bounds for independence samplers, Subgeometric ergodicity of strong Markov processes, Renewal theory and computable convergence rates for geometrically erdgodic Markov chains, Ergodicity of Markov chain Monte Carlo with reversible proposal, Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms, On the convergence of stochastic approximations under a subgeometric ergodic Markov dynamic, Conductance bounds on the L2 convergence rate of Metropolis algorithms on unbounded state spaces, Additive Functionals for Discrete-Time Markov Chains with Applications to Birth-Death Processes, Criteria for geometric and algebraic transience for discrete-time Markov chains, State-dependent Foster-Lyapunov criteria for subgeometric convergence of Markov chains
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Markov chains and stochastic stability
- Regeneration and general Markov chains
- \(V\)-subgeometric ergodicity for a Hastings-Metropolis algorithm
- Bounds on regeneration times and convergence rates for Markov chains
- Geometric ergodicity of Metropolis algorithms
- Polynomial convergence rates of Markov chains
- Corrigendum to ``Bounds on regeneration times and convergence rates for Markov chains
- The rate of convergence of a homogeneous Markov chain arising from two-queue networks
- Rates of convergence of the Hastings and Metropolis algorithms
- Langevin-type models. I: Diffusions with given stationary distributions and their discretizations
- On Polynomial Mixing and Convergence Rate for Stochastic Difference and Differential Equations
- SUR UN MODÉLE AUTORÉGRESSIF NON LINÉAIRE, ERGODICITÉ ET ERGODICITÉ GÉOMÉTRIQUE
- Subexponential distributions and integrated tails
- Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
- Geometric ergodicity of nonlinear first order autoregressive models
- Iterated Random Functions
- Subgeometric Rates of Convergence of f-Ergodic Markov Chains
- Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
