Geometric Ergodicity of van Dyk and Meng's Algorithm for the Multivariate Student'stModel

From MaRDI portal
Publication:5474420

DOI10.1198/016214504000000223zbMath1089.60518OpenAlexW2033190522MaRDI QIDQ5474420

James P. Hobert, Dobrin Marchev

Publication date: 26 June 2006

Published in: Journal of the American Statistical Association (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1198/016214504000000223



Related Items

Sufficient burn-in for Gibbs samplers for a hierarchical random effects model., Convergence rates of two-component MCMC samplers, Batch means and spectral variance estimators in Markov chain Monte Carlo, Assessing and Visualizing Simultaneous Simulation Error, Fast Markov Chain Monte Carlo for High-Dimensional Bayesian Regression Models With Shrinkage Priors, Rigorous confidence bounds for MCMC under a geometric drift condition, The Modified-Half-Normal distribution: Properties and an efficient sampling scheme, Gibbs sampling, exponential families and orthogonal polynomials, Markov chain Monte Carlo: can we trust the third significant figure?, Cross-fertilizing strategies for better EM mountain climbing and DA field exploration: a graphical guide book, Nonasymptotic bounds on the estimation error of MCMC algorithms, Trace class Markov chains for the normal-gamma Bayesian shrinkage model, Geometric ergodicity for Bayesian shrinkage models, A spectral analytic comparison of trace-class data augmentation algorithms and their sandwich variants, Geometric ergodicity of random scan Gibbs samplers for hierarchical one-way random effects models, On Monte Carlo methods for Bayesian multivariate regression models with heavy-tailed errors, Convergence of Conditional Metropolis-Hastings Samplers, Quantitative non-geometric convergence bounds for independence samplers, Trace Class Markov Chains for Bayesian Inference with Generalized Double Pareto Shrinkage Priors, Component-wise Markov chain Monte Carlo: uniform and geometric ergodicity under mixing and composition, Convergence complexity analysis of Albert and Chib's algorithm for Bayesian probit regression