Information bounds for Gibbs samplers
From MaRDI portal
Publication:1307091
DOI10.1214/aos/1024691464zbMath0927.62080OpenAlexW2057575215MaRDI QIDQ1307091
Ian W. McKeague, Wolfgang Wefelmeyer, Prescilla E. Greenwood
Publication date: 14 December 1999
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aos/1024691464
Asymptotic properties of nonparametric inference (62G20) Markov processes: estimation; hidden Markov models (62M05) Numerical analysis or methods applied to Markov chains (65C40)
Related Items
Convergence rates of two-component MCMC samplers, On the rate of convergence of the Gibbs sampler for the 1-D Ising model by geometric bound, On false discovery control under dependence, A hybrid scan Gibbs sampler for Bayesian models with latent variables
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Markov chains and stochastic stability
- Efficient estimation of the stationary distribution for exponentially ergodic Markov chains
- Central limit theorem for additive functionals of reversible Markov processes and applications to simple exclusions
- Optimal spectral structure of reversible stochastic matrices, Monte Carlo methods and the simulation of Markov random fields
- On statistics of Markov step processes: Representation of log-likelihood ratio processes in filtered local models
- On the rate of convergence of the Metropolis algorithm and Gibbs sampler by geometric bounds
- Computable bounds for geometric convergence rates of Markov chains
- Outperforming the Gibbs sampler empirical estimator for nearest-neighbor random fields
- Geometric ergodicity and hybrid Markov chains
- Coordinate selection rules for Gibbs sampling
- Local asymptotic normality and mixed normality for Markov statistical models
- Antithetic coupling of two Gibbs sampler chains.
- Efficiency of empirical estimators for Markov chains
- Rates of convergence of the Hastings and Metropolis algorithms
- Markov chain Monte Carlo and Rao-Blackwellization
- Efficiency of estimators for partially specified filtered models
- Optimum Monte-Carlo sampling using Markov chains
- Sampling-Based Approaches to Calculating Marginal Densities
- The Calculation of Posterior Distributions by Data Augmentation
- Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
- Auxiliary Variable Methods for Markov Chain Monte Carlo with Applications
- Covariance structure of the Gibbs sampler with applications to the comparisons of estimators and augmentation schemes
- Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
- A characterization of limiting distributions of regular estimates