Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
From MaRDI portal
Publication:4844189
DOI10.2307/2291067zbMath0824.60077OpenAlexW4248858991MaRDI QIDQ4844189
Publication date: 6 November 1995
Full work available at URL: https://doi.org/10.2307/2291067
Gibbs samplercouplingbivariate normal modelMetropolis-Hastings algorithmdrift conditionHarris recurrenceregeneration timehierarchical Poisson model
Monte Carlo methods (65C05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Continuous-time Markov processes on discrete state spaces (60J27)
Related Items (only showing first 100 items - show all)
Geometric ergodicity of Metropolis algorithms ⋮ 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. ⋮ A Monte Carlo approach to quantifying model error in Bayesian parameter estimation ⋮ Retracted: Fixed point theorems and explicit estimates for convergence rates of continuous time Markov chains ⋮ Sequential stratified regeneration: \textit{MCMC} for large state spaces with an application to subgraph count estimation ⋮ Dimension free convergence rates for Gibbs samplers for Bayesian linear mixed models ⋮ Improving SAMC using smoothing methods: Theory and applications to Bayesian model selection problems ⋮ Geometric ergodicity of Gibbs samplers for the horseshoe and its regularized variants ⋮ On the theoretical properties of the exchange algorithm ⋮ Exact convergence analysis of the independent Metropolis-Hastings algorithms ⋮ A computational procedure for estimation of the mixing time of the random-scan Metropolis algorithm ⋮ Exponential convergence rates of Markov chains under a weaken minorization condition ⋮ Convergence of independent particle systems ⋮ Rates of convergence for everywhere-positive Markov chains ⋮ Batch means and spectral variance estimators in Markov chain Monte Carlo ⋮ A note on formal constructions of sequential conditional couplings ⋮ A new approach to estimating the expected first hitting time of evolutionary algorithms ⋮ A gentle stochastic thermostat for molecular dynamics ⋮ Convergence rates of attractive-repulsive MCMC algorithms ⋮ Stability of noisy Metropolis-Hastings ⋮ Markov chain convergence: From finite to infinite ⋮ Elementary bounds on mixing times for decomposable Markov chains ⋮ Geometric ergodicity of the Bayesian Lasso ⋮ Approximate bounding of mixing time for multiple-step Gibbs samplers ⋮ Rates of convergence of the Hastings and Metropolis algorithms ⋮ Convergence properties of the Gibbs sampler for perturbations of Gaussians ⋮ Stochastic alternating projections ⋮ Geometric ergodicity and the spectral gap of non-reversible Markov chains ⋮ Rigorous confidence bounds for MCMC under a geometric drift condition ⋮ Geometric ergodicity for classes of homogeneous Markov chains ⋮ Convergence properties of data augmentation algorithms for high-dimensional robit regression ⋮ Geometric ergodicity of a hybrid sampler for Bayesian inference of phylogenetic branch lengths ⋮ Gibbs sampling, exponential families and orthogonal polynomials ⋮ Comment: ``Gibbs sampling, exponential families and orthogonal polynomials ⋮ Comment: ``Gibbs sampling, exponential families, and orthogonal polynomials ⋮ 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 ⋮ Gibbs sampling, conjugate priors and coupling ⋮ One-shot CFTP; application to a class of truncated Gaussian densities ⋮ A short history of Markov chain Monte Carlo: Subjective recollections from incomplete data ⋮ Quantitative bounds for Markov chain convergence: Wasserstein and total variation distances ⋮ Nonasymptotic bounds on the estimation error of MCMC algorithms ⋮ Exact sampling for intractable probability distributions via a Bernoulli factory ⋮ Couplings via comparison principle and exponential ergodicity of SPDEs in the hypoelliptic setting ⋮ Convergence rate of Markov chain methods for genomic motif discovery ⋮ Geometric ergodicity of the Gibbs sampler for Bayesian quantile regression ⋮ Data augmentation, frequentist estimation, and the Bayesian analysis of multinomial logit models ⋮ A Gibbs sampler on the \(n\)-simplex ⋮ Gibbs/Metropolis algorithms on a convex polytope ⋮ On the convergence time of some non-reversible Markov chain Monte Carlo methods ⋮ Analysis of convergence rates of some Gibbs samplers on continuous state spaces ⋮ Convergence rate and concentration inequalities for Gibbs sampling in high dimension ⋮ Honest exploration of intractable probability distributions via Markov chain Monte Carlo. ⋮ Geometric ergodicity for Bayesian shrinkage models ⋮ Variance bounding Markov chains ⋮ Geometric ergodicity of a Metropolis-Hastings algorithm for Bayesian inference of phylogenetic branch lengths ⋮ Markov chain Monte Carlo estimation of quantiles ⋮ Asymptotic properties of the maximum likelihood estimator in regime switching econometric models ⋮ Estimating drift and minorization coefficients for Gibbs sampling algorithms ⋮ On the limitations of single-step drift and minorization in Markov chain convergence analysis ⋮ Faithful couplings of Markov chains: Now equals forever ⋮ Mixture of transmuted Pareto distribution: properties, applications and estimation under Bayesian framework ⋮ Fast mixing of Metropolis-Hastings with unimodal targets ⋮ Sub-exponential rate of convergence to equilibrium for processes on the half-line ⋮ A Monte Carlo integration approach to estimating drift and minorization coefficients for Metropolis-Hastings samplers ⋮ Convergence rates for semistochastic processes ⋮ On Monte Carlo methods for Bayesian multivariate regression models with heavy-tailed errors ⋮ Quantitative non-geometric convergence bounds for independence samplers ⋮ Small sets and Markov transition densities. ⋮ One-shot coupling for certain stochastic recursive sequences. ⋮ Quantitative bounds on convergence of time-inhomogeneous Markov chains ⋮ Variable transformation to obtain geometric ergodicity in the random-walk Metropolis algorithm ⋮ Renewal theory and computable convergence rates for geometrically erdgodic Markov chains ⋮ Exponential ergodicity and convergence for generalized reflected Brownian motion ⋮ Hitting time and convergence rate bounds for symmetric Langevin diffusions ⋮ Harris recurrence of Metropolis-within-Gibbs and trans-dimensional Markov chains ⋮ Explicit error bounds for lazy reversible Markov chain Monte Carlo ⋮ On the use of stochastic approximation Monte Carlo for Monte Carlo integration ⋮ Convergence analysis of a collapsed Gibbs sampler for Bayesian vector autoregressions ⋮ Convergence and accuracy of Gibbs sampling for conditional distributions in generalized linear models ⋮ What do we know about the Metropolis algorithm? ⋮ Geometric ergodicity of Gibbs and block Gibbs samplers for a hierarchical random effects model ⋮ Convergence complexity analysis of Albert and Chib's algorithm for Bayesian probit regression ⋮ On the convergence complexity of Gibbs samplers for a family of simple Bayesian random effects models ⋮ Revisiting the Gelman-Rubin diagnostic ⋮ Explicit Rates of Exponential Convergence for Reflected Jump-Diffusions on the Half-Line ⋮ Consistent estimation of the spectrum of trace class data augmentation algorithms ⋮ Convergence rate bounds for iterative random functions using one-shot coupling ⋮ Two convergence properties of hybrid samplers ⋮ Ergodicity for SDEs and approximations: locally Lipschitz vector fields and degenerate noise. ⋮ Polynomial ergodicity of Markov transition kernels. ⋮ Information bounds for Gibbs samplers ⋮ Bounds on regeneration times and convergence rates for Markov chains ⋮ Convergence rates in uniform ergodicity by hitting times and \(L^2\)-exponential convergence rates ⋮ Comparison of Markov chains via weak Poincaré inequalities with application to pseudo-marginal MCMC ⋮ The polar slice sampler ⋮ Wasserstein-based methods for convergence complexity analysis of MCMC with applications
This page was built for publication: Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
