Complexity results for MCMC derived from quantitative bounds (Q6104001)

scientific article; zbMATH DE number 7692294

Language	Label	Description	Also known as
English	Complexity results for MCMC derived from quantitative bounds	scientific article; zbMATH DE number 7692294

Statements

instance of

scholarly article

0 references

title

Complexity results for MCMC derived from quantitative bounds (English)

0 references

0 references

0 references

The Annals of Applied Probability

0 references

publication date

5 June 2023

0 references

full work available at URL

https://arxiv.org/abs/1708.00829

0 references

zbMATH Keywords

convergence complexity

0 references

drift and minorization

0 references

high dimensions

0 references

Markov chain Monte Carlo

0 references

mixing time

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A tail inequality for suprema of unbounded empirical processes with applications to Markov chains

0 references

Exponential concentration inequalities for additive functionals of Markov chains

0 references

Renewal theory and computable convergence rates for geometrically erdgodic Markov chains

0 references

Nonasymptotic mixing of the MALA algorithm

0 references

Handbook of Markov Chain Monte Carlo

0 references

The Pólya-gamma Gibbs sampler for Bayesian logistic regression is uniformly ergodic

0 references

Q5586401

0 references

The complexity of theorem-proving procedures

0 references

Theoretical Guarantees for Approximate Sampling from Smooth and Log-Concave Densities

0 references

On the convergence complexity of Gibbs samplers for a family of simple Bayesian random effects models

0 references

Nonasymptotic convergence analysis for the unadjusted Langevin algorithm

0 references

Q5214293

0 references

Randomly coloring graphs with lower bounds on girth and maximum degree

0 references

Error bounds for Metropolis-Hastings algorithms applied to perturbations of Gaussian measures in high dimensions

0 references

Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model

0 references

Markov chain Monte Carlo: can we trust the third significant figure?

0 references

Sampling-Based Approaches to Calculating Marginal Densities

0 references

Inference from iterative simulation using multiple sequences

0 references

Q4864274

0 references

Asymptotic coupling and a general form of Harris' theorem with applications to stochastic delay equations

0 references

Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains

0 references

On the convergence rate of the ``out-of-order'' block Gibbs sampler

0 references

Fixed-Width Output Analysis for Markov Chain Monte Carlo

0 references

Honest exploration of intractable probability distributions via Markov chain Monte Carlo.

0 references

Sufficient burn-in for Gibbs samplers for a hierarchical random effects model.

0 references

Geometric ergodicity of the Bayesian Lasso

0 references

Nonasymptotic bounds on the estimation error of MCMC algorithms

0 references

Rigorous confidence bounds for MCMC under a geometric drift condition

0 references

Hit-and-run from a corner

0 references

Hit-and-Run from a Corner

0 references

Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions: continuous dynamics

0 references

Perturbation bounds for Monte Carlo within metropolis via restricted approximations

0 references

Markov chains and stochastic stability

0 references

Computable bounds for geometric convergence rates of Markov chains

0 references

Concentration inequalities for Markov chains by Marton couplings and spectral methods

0 references

Convergence complexity analysis of Albert and Chib's algorithm for Bayesian probit regression

0 references

Weak convergence and optimal scaling of random walk Metropolis algorithms

0 references

Optimal Scaling of Discrete Approximations to Langevin Diffusions

0 references

Complexity bounds for Markov chain Monte Carlo algorithms via diffusion limits

0 references

Bounds on regeneration times and convergence rates for Markov chains

0 references

Rates of convergence of stochastically monotone and continuous time Markov models

0 references

Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo

0 references

Rates of convergence for Gibbs sampling for variance component models

0 references

Quantitative convergence rates of Markov chains: A simple account

0 references

Explicit error bounds for lazy reversible Markov chain Monte Carlo

0 references

Error bounds for computing the expectation by Markov chain Monte Carlo

0 references

Explicit error bounds for Markov chain Monte Carlo

0 references

On a generalization of the preconditioned Crank-Nicolson metropolis algorithm

0 references

Approximate counting, uniform generation and rapidly mixing Markov chains

0 references

Q5290281

0 references

Sufficient conditions for torpid mixing of parallel and simulated tempering

0 references

Conditions for rapid mixing of parallel and simulated tempering on multimodal distributions

0 references

Optimal scaling of random-walk Metropolis algorithms on general target distributions

0 references

Mathematical analysis II. Transl. from the 4th Russian edition by Roger Cooke

0 references

Identifiers

zbMATH Open document ID

0 references

0 references

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6104001