Bounds on regeneration times and convergence rates for Markov chains

From MaRDI portal
Publication:1593619

DOI10.1016/S0304-4149(98)00085-4zbMath0961.60066MaRDI QIDQ1593619

Gareth O. Roberts, Richard L. Tweedie

Publication date: 17 January 2001

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)




Related Items

Perfect sampling of ergodic Harris chains, Geometric ergodicity of Metropolis algorithms, Corrigendum to ``Bounds on regeneration times and convergence rates for Markov chains, A mixture representation of \(\pi\) with applications in Markov chain Monte Carlo and perfect sampling., Sufficient burn-in for Gibbs samplers for a hierarchical random effects model., Retracted: Fixed point theorems and explicit estimates for convergence rates of continuous time Markov chains, Estimation Methods for Delays in Non-regenerative Discrete-Event Systems, Spectral Analysis of Markov Kernels and Application to the Convergence Rate Of Discrete Random Walks, Reflections on Bayesian inference and Markov chain Monte Carlo, Complexity results for MCMC derived from quantitative bounds, Comment: ``Gibbs sampling, exponential families, and orthogonal polynomials, Optimal scaling of random-walk Metropolis algorithms on general target distributions, Consistency of the maximum likelihood estimator for general hidden Markov models, Uniform accuracy of the maximum likelihood estimates for probabilistic models of biological sequences, Approximating Markov chains and \(V\)-geometric ergodicity via weak perturbation theory, Nonasymptotic bounds on the estimation error of MCMC algorithms, When is a Markov chain regenerative?, Honest exploration of intractable probability distributions via Markov chain Monte Carlo., On the limitations of single-step drift and minorization in Markov chain convergence analysis, SMALL AND PSEUDO-SMALL SETS FOR MARKOV CHAINS, Uniform ergodicity and strong stability estimates of homogeneous Markov chains, Polynomial bounds in the Ergodic theorem for one-dimensional diffusions and integrability of hitting times, One-shot coupling for certain stochastic recursive sequences., Quantitative bounds on convergence of time-inhomogeneous Markov chains, Renewal theory and computable convergence rates for geometrically erdgodic Markov chains, Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms, Hitting time and convergence rate bounds for symmetric Langevin diffusions, Harris recurrence of Metropolis-within-Gibbs and trans-dimensional Markov chains, Quantitative bounds of convergence for geometrically ergodic Markov chain in the Wasserstein distance with application to the Metropolis adjusted Langevin algorithm, Bounds on regeneration times and limit theorems for subgeometric Markov chains, Exponential convergence rate of ruin probabilities for level-dependent Lévy-driven risk processes, Convergence complexity analysis of Albert and Chib's algorithm for Bayesian probit regression, Conductance bounds on the L2 convergence rate of Metropolis algorithms on unbounded state spaces, Explicit Rates of Exponential Convergence for Reflected Jump-Diffusions on the Half-Line, Using a Markov Chain to Construct a Tractable Approximation of an Intractable Probability Distribution, Stationary distributions and convergence for Walsh diffusions, Ergodicity for SDEs and approximations: locally Lipschitz vector fields and degenerate noise., Convergence rates and moments of Markov chains associated with the mean of Dirichlet processes., Polynomial ergodicity of Markov transition kernels., On the use of Lyapunov methods in renewal theory, The polar slice sampler, Wasserstein-based methods for convergence complexity analysis of MCMC with applications



Cites Work