Coordinate selection rules for Gibbs sampling
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3145626 (Why is no real title available?)
- scientific article; zbMATH DE number 472933 (Why is no real title available?)
- scientific article; zbMATH DE number 597902 (Why is no real title available?)
- scientific article; zbMATH DE number 720679 (Why is no real title available?)
- scientific article; zbMATH DE number 3204642 (Why is no real title available?)
- scientific article; zbMATH DE number 3061616 (Why is no real title available?)
- Comparing sweep strategies for stochastic relaxation
- Coordinate selection rules for Gibbs sampling
- Covariance structure of the Gibbs sampler with applications to the comparisons of estimators and augmentation schemes
- Improving Stochastic Relaxation for Gussian Random Fields
- Inequalities: theory of majorization and its applications
- On rates of convergence of stochastic relaxation for Gaussian and non- Gaussian distributions
- Sampling-Based Approaches to Calculating Marginal Densities
- Simple conditions for the convergence of the Gibbs sampler and Metropolis-Hastings algorithms
- Some Metric Inequalities in the Space of Matrices
Cited in
(10)- Convergence analysis of herded-Gibbs-type sampling algorithms: effects of weight sharing
- An upper bound on the convergence time of the Gibbs sampler in Ising models
- Mixing times of the biased card shuffling and the asymmetric exclusion process
- A note on Markov chain Monte Carlo sweep strategies
- Convergence rates of two-component MCMC samplers
- Random walks on the BMW monoid: an algebraic approach
- Optimizing random scan Gibbs samplers
- Systematic scan for sampling colorings
- Information bounds for Gibbs samplers
- Coordinate selection rules for Gibbs sampling
This page was built for publication: Coordinate selection rules for Gibbs sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1814746)
