An Approach to Diagnosing Total Variation Convergence of MCMC Algorithms
暂无分享,去创建一个
[1] Adrian F. M. Smith,et al. Bayesian computation via the gibbs sampler and related markov chain monte carlo methods (with discus , 1993 .
[2] P. Diaconis. Group representations in probability and statistics , 1988 .
[3] Adrian F. M. Smith,et al. Sampling-Based Approaches to Calculating Marginal Densities , 1990 .
[4] A. Raftery,et al. How Many Iterations in the Gibbs Sampler , 1991 .
[5] D. Rubin,et al. Inference from Iterative Simulation Using Multiple Sequences , 1992 .
[6] Peter W. Glynn,et al. Stationarity detection in the initial transient problem , 1992, TOMC.
[7] Alan E. Gelfand,et al. Bayesian statistics without tears: A sampling-resampling perspective , 1992 .
[8] J. Q. Smith,et al. 1. Bayesian Statistics 4 , 1993 .
[9] Adrian F. M. Smith,et al. Simple conditions for the convergence of the Gibbs sampler and Metropolis-Hastings algorithms , 1994 .
[10] C. Robert,et al. Estimation of Finite Mixture Distributions Through Bayesian Sampling , 1994 .
[11] P. Dellaportas. Random variate transformations in the Gibbs sampler: issues of efficiency and convergence , 1995 .
[12] S. Chib,et al. Understanding the Metropolis-Hastings Algorithm , 1995 .