Information bounds for Gibbs samplers
type: Item
instance of: scholarly article
title: Information bounds for Gibbs samplers
zbMATH Open document ID: 0927.62080
author: Ian W. Mckeague
author: Wolfgang Wefelmeyer
author: Priscilla Greenwood
published in: The Annals of Statistics
publication date: 1999-12-14T00:00:00Z
Mathematics Subject Classification ID: 62M05
Mathematics Subject Classification ID: 65C40
Mathematics Subject Classification ID: 62G20
zbMATH DE Number: 1353645
zbMATH Keywords: efficient estimator
zbMATH Keywords: empirical estimator
zbMATH Keywords: Markov chain Monte Carlo
zbMATH Keywords: variance bound
describes a project that uses: Gibbsit
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1214/aos/1024691464
OpenAlex ID: W2057575215
cites work: Q3837295
cites work: Q4279798
cites work: Q4879979
cites work: Coordinate selection rules for Gibbs sampling
cites work: Q4272795
cites work: Optimal spectral structure of reversible stochastic matrices, Monte Carlo methods and the simulation of Markov random fields
cites work: Antithetic coupling of two Gibbs sampler chains.
cites work: Sampling-Based Approaches to Calculating Marginal Densities
cites work: Outperforming the Gibbs sampler empirical estimator for nearest-neighbor random fields
cites work: Q4267668
cites work: Efficiency of estimators for partially specified filtered models
cites work: Efficiency of empirical estimators for Markov chains
cites work: A characterization of limiting distributions of regular estimates
cites work: Auxiliary Variable Methods for Markov Chain Monte Carlo with Applications
cites work: On statistics of Markov step processes: Representation of log-likelihood ratio processes in filtered local models
cites work: Local asymptotic normality and mixed normality for Markov statistical models
cites work: On the rate of convergence of the Metropolis algorithm and Gibbs sampler by geometric bounds
cites work: Central limit theorem for additive functionals of reversible Markov processes and applications to simple exclusions
cites work: Covariance structure of the Gibbs sampler with applications to the comparisons of estimators and augmentation schemes
cites work: Q4322327
cites work: Markov chain Monte Carlo and Rao-Blackwellization
cites work: Rates of convergence of the Hastings and Metropolis algorithms
cites work: Markov chains and stochastic stability
cites work: Computable bounds for geometric convergence rates of Markov chains
cites work: Efficient estimation of the stationary distribution for exponentially ergodic Markov chains
cites work: Optimum Monte-Carlo sampling using Markov chains
cites work: Q4934521
cites work: Q4298913
cites work: Geometric ergodicity and hybrid Markov chains
cites work: Q4363938
cites work: Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
cites work: Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
cites work: The Calculation of Posterior Distributions by Data Augmentation
DOI: 10.1214/AOS/1024691464
Recommended article: Q3842618
Recommended article: A bound on the rate of convergence for the discrete Gibbs sampler
Recommended article: On convergence rates of Gibbs samplers for uniform distributions
Recommended article: Asymptotic Behavior of the Gibbs Sampler
description: scientific article; zbMATH DE number 1353645