Computable bounds for geometric convergence rates of Markov chains
From MaRDI portal
Publication:1345578
DOI10.1214/aoap/1177004900zbMath0812.60059OpenAlexW2028493795WikidataQ120217374 ScholiaQ120217374MaRDI QIDQ1345578
Sean P. Meyn, Richard L. Tweedie
Publication date: 14 May 1995
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoap/1177004900
uniform convergencerenewal theoryspectral gapqueueing theoryMonte Carlo algorithmsinvariant probability measuregeometrically ergodic Markov chains
Related Items
On quantitative hypocoercivity estimates based on Harris-type theorems, Reflections on Bayesian inference and Markov chain Monte Carlo, Complexity results for MCMC derived from quantitative bounds, Robustness of iterated function systems of Lipschitz maps, Explicit bounds for spectral theory of geometrically ergodic Markov kernels and applications, Quantitative bounds of convergence for geometrically ergodic Markov chain in the Wasserstein distance with application to the Metropolis adjusted Langevin algorithm, Component-wise Markov chain Monte Carlo: uniform and geometric ergodicity under mixing and composition, Ergodic risk-sensitive control of Markov processes on countable state space revisited, Spectral theory and limit theorems for geometrically ergodic Markov processes, On the asymptotic behavior of an Ornstein-Uhlenbeck process with random forcing, Geometric ergodicity of Metropolis algorithms, On the optimality equation for average cost Markov control processes with Feller transition probabilities, Law of large numbers for random dynamical systems, Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\)., 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, Abstraction-guided truncations for stationary distributions of Markov population models, An extension of the square root law of TCP, Rates of convergence for everywhere-positive Markov chains, MCMC Algorithms for Posteriors on Matrix Spaces, Batch means and spectral variance estimators in Markov chain Monte Carlo, On the simulation of Markov chain steady-state distribution using CFTP algorithm, Lower estimates of transition densities and bounds on exponential ergodicity for stochastic PDEs, Unnamed Item, Analyzing the performance of simultaneous generalized hill climbing algorithms, Explicit convergence rates of the embedded \(\mathrm{M}/\mathrm{G}/1\) queue, Stability of noisy Metropolis-Hastings, On the ergodicity properties of some adaptive MCMC algorithms, Optimality in Feller semi-Markov control processes, Approximation of noncooperative semi-Markov games, Markov chain convergence: From finite to infinite, Almost-sure enhanced dissipation and uniform-in-diffusivity exponential mixing for advection-diffusion by stochastic Navier-Stokes, Spectral Analysis of Markov Kernels and Application to the Convergence Rate Of Discrete Random Walks, Rates of convergence of the Hastings and Metropolis algorithms, Quantitative spectral gaps for hypoelliptic stochastic differential equations with small noise, \(V\)-geometrical ergodicity of Markov kernels via finite-rank approximations, On the ergodicity of the adaptive Metropolis algorithm on unbounded domains, Geometric ergodicity and the spectral gap of non-reversible Markov chains, Quantitative Convergence Rates for Subgeometric Markov Chains, Learning performance of Tikhonov regularization algorithm with geometrically beta-mixing observations, Geometric ergodicity for classes of homogeneous Markov chains, Unnamed Item, Harris-type results on geometric and subgeometric convergence to equilibrium for stochastic semigroups, A uniform Berry-Esseen theorem on \(M\)-estimators for geometrically ergodic Markov chains, Markov chain Monte Carlo: can we trust the third significant figure?, Optimal scaling of random-walk Metropolis algorithms on general target distributions, Convergence rate to equilibrium in Wasserstein distance for reflected jump-diffusions, T. E. Harris's contributions to recurrent Markov processes and stochastic flows, Approximating Markov chains and \(V\)-geometric ergodicity via weak perturbation theory, Nonasymptotic bounds on the estimation error of MCMC algorithms, On nonlinear Markov chain Monte Carlo, New average optimality conditions for semi-Markov decision processes in Borel spaces, On the convergence time of some non-reversible Markov chain Monte Carlo methods, Markovian stochastic approximation with expanding projections, Honest exploration of intractable probability distributions via Markov chain Monte Carlo., The design and analysis of a generalized RESTART/DPR algorithm for rare event simulation, Asymptotically optimal pointwise and minimax quickest change-point detection for dependent data, On the limitations of single-step drift and minorization in Markov chain convergence analysis, Unnamed Item, Faithful couplings of Markov chains: Now equals forever, Nonparametric estimation of the stationary density and the transition density of a Markov chain, Attack allocation on remote state estimation in multi-systems: structural results and asymptotic solution, Sub-exponential rate of convergence to equilibrium for processes on the half-line, Convergence rates for semistochastic processes, Stochastic games with unbounded payoffs: applications to robust control in economics, Regular Perturbation of V-Geometrically Ergodic Markov Chains, Perturbation analysis for denumerable Markov chains with application to queueing models, One-shot coupling for certain stochastic recursive sequences., Multiscale expansion of invariant measures for SPDEs, Markov-chain monte carlo: Some practical implications of theoretical results, Quantitative bounds on convergence of time-inhomogeneous Markov chains, New perturbation bounds for denumerable Markov chains, Large deviation asymptotics and control variates for simulating large functions, Renewal theory and computable convergence rates for geometrically erdgodic Markov chains, On a continuous solution to the Bellman-Poisson equation in stochastic games, A Fixed Point Approach to Solve the Average Cost Optimality Equation for Semi-Markov Decision Processes with Feller Transition Probabilities, Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms, Stationary distributions in the atom-on-demand problem, Simulating the Invariant Measures of Markov Chains Using Backward Coupling at Regeneration Times, Nonzero-Sum Expected Average Discrete-Time Stochastic Games: The Case of Uncountable Spaces, Exponential convergence rate of ruin probabilities for level-dependent Lévy-driven risk processes, Simple conditions for metastability of continuous Markov chains, Sensitivity and convergence of uniformly ergodic Markov chains, Expectations for nonreversible Markov chains, Possible biases induced by mcmc convergence diagnostics, What do we know about the Metropolis algorithm?, Perfect Forward Simulation via Simulated Tempering, Convergence complexity analysis of Albert and Chib's algorithm for Bayesian probit regression, Zero-sum ergodic semi-Markov games with weakly continuous transition probabilities, Stochastic approximation cut algorithm for inference in modularized Bayesian models, Explicit Rates of Exponential Convergence for Reflected Jump-Diffusions on the Half-Line, Average optimality for Markov decision processes in borel spaces: a new condition and approach, Stationary distributions and convergence for Walsh diffusions, MCMC for Imbalanced Categorical Data, On Uniform Exponential Ergodicity of Markovian Multiclass Many-Server Queues in the Halfin–Whitt Regime, Two convergence properties of hybrid samplers, On the policy improvement algorithm for ergodic risk-sensitive control, Nonparametric estimation in null recurrent time series., Fundamental design principles for reinforcement learning algorithms, Stochastic Gradient Markov Chain Monte Carlo, Information bounds for Gibbs samplers, Bounds on regeneration times and convergence rates for Markov chains, Discrete-time constrained stochastic games with the expected average payoff criteria, Generalization of discrete-time geometric bounds to convergence rate of Markov processes on Rn, Wasserstein-based methods for convergence complexity analysis of MCMC with applications, Unnamed Item, On adaptive Markov chain Monte Carlo algorithms
