Coordinate selection rules for Gibbs sampling

DOI10.1214/aoap/1034968139zbMath0855.60060OpenAlexW2011487343MaRDI QIDQ1814746

George S. Fishman

Publication date: 14 January 1997

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoap/1034968139

zbMATH Keywords

Monte CarloMarkov random fieldGibbs samplingcoordinate selection

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Discrete-time Markov processes on general state spaces (60J05)

Related Items

Convergence rates of two-component MCMC samplers, Optimizing random scan Gibbs samplers, A note on Markov chain Monte Carlo sweep strategies, Random walks on the BMW monoid: an algebraic approach, Mixing times of the biased card shuffling and the asymmetric exclusion process, Systematic scan for sampling colorings, An upper bound on the convergence time of the Gibbs sampler in Ising models, Coordinate selection rules for Gibbs sampling, Information bounds for Gibbs samplers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparing sweep strategies for stochastic relaxation
• On rates of convergence of stochastic relaxation for Gaussian and non- Gaussian distributions
• Simple conditions for the convergence of the Gibbs sampler and Metropolis-Hastings algorithms
• Coordinate selection rules for Gibbs sampling
• Improving Stochastic Relaxation for Gussian Random Fields
• Sampling-Based Approaches to Calculating Marginal Densities
• Covariance structure of the Gibbs sampler with applications to the comparisons of estimators and augmentation schemes
• Some Metric Inequalities in the Space of Matrices
• Inequalities: theory of majorization and its applications