论文信息 - Simple conditions for the convergence of the Gibbs sampler and Metropolis-Hastings algorithms - 字舞流文

Simple conditions for the convergence of the Gibbs sampler and Metropolis-Hastings algorithms

Adrian F. M. Smith | G. Roberts

[1] L. Tierney. Markov Chains for Exploring Posterior Distributions , 1994 .

[2] Nicholas G. Polson,et al. On the Geometric Convergence of the Gibbs Sampler , 1994 .

[3] D. Spiegelhalter,et al. Modelling Complexity: Applications of Gibbs Sampling in Medicine , 1993 .

[4] J. Besag,et al. Spatial Statistics and Bayesian Computation , 1993 .

[5] Kung-Sik Chan. Asymptotic behavior of the Gibbs sampler , 1993 .

[6] D. Rubin,et al. Inference from Iterative Simulation Using Multiple Sequences , 1992 .

[7] Adrian F. M. Smith,et al. Sampling-Based Approaches to Calculating Marginal Densities , 1990 .

[8] Adrian F. M. Smith,et al. Bayesian computation via the gibbs sampler and related markov chain monte carlo methods (with discus , 1993 .

[9] Donald Geman,et al. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10] E. Nummelin. General irreducible Markov chains and non-negative operators: Notes and comments , 1984 .

[11] W. K. Hastings,et al. Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .

[12] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.