Abstract
Abstract General methods are provided for analyzing the convergence of discrete-time, general state-space Markov chains, such as those used in stochastic simulation algorithms including the Gibbs sampler. The methods provide rigorous, a priori bounds on how long these simulations should be run to give satisfactory results. Results are applied to two models of the Gibbs sampler: a bivariate normal model, and a hierarchical Poisson model (with gamma conditionals). The methods use the notion of minorization conditions for Markov chains.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
