Comment: ``Gibbs sampling, exponential families, and orthogonal polynomials
From MaRDI portal
(Redirected from Comment: ``Gibbs sampling, exponential families, and orthogonal polynomials)
Comment: ``Gibbs sampling, exponential families, and orthogonal polynomials''
Comment: ``Gibbs sampling, exponential families, and orthogonal polynomials''
Abstract: Comment on ``Gibbs Sampling, Exponential Families, and Orthogonal Polynomials [arXiv:0808.3852]
Cites work
- A mixture representation of \(\pi\) with applications in Markov chain Monte Carlo and perfect sampling.
- A regeneration proof of the central limit theorem for uniformly ergodic Markov chains
- Bounds on regeneration times and convergence rates for Markov chains
- Fixed-Width Output Analysis for Markov Chain Monte Carlo
- General state space Markov chains and MCMC algorithms
- Geometric ergodicity and perfect simulation
- Honest exploration of intractable probability distributions via Markov chain Monte Carlo.
- Markov chain Monte Carlo: can we trust the third significant figure?
- Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
- On the Markov chain central limit theorem
- Renewal theory and computable convergence rates for geometrically erdgodic Markov chains
- Sufficient burn-in for Gibbs samplers for a hierarchical random effects model.
Cited in
(5)- Convergence rates of two-component MCMC samplers
- Exact convergence analysis of the independent Metropolis-Hastings algorithms
- Gibbs sampling, exponential families and orthogonal polynomials
- Comment: ``Gibbs sampling, exponential families and orthogonal polynomials
- Rejoinder: ``Gibbs sampling, exponential families and orthogonal polynomials
This page was built for publication: Comment: ``Gibbs sampling, exponential families, and orthogonal polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q900454)