Trace-class Monte Carlo Markov chains for Bayesian multivariate linear regression with non-Gaussian errors

被引:5
|
作者
Qin, Qian [1 ]
Hobert, James P. [1 ]
机构
[1] Univ Florida, Dept Stat, Gainesville, FL 32611 USA
基金
美国国家科学基金会;
关键词
Compact operator; Data augmentation algorithm; Haar PX-DA algorithm; Heavy-tailed distribution; Scale mixture; Markov operator; Trace-class operator; ALGORITHMS; SPECTRA;
D O I
10.1016/j.jmva.2018.03.012
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
Let pi denote the intractable posterior density that results when the likelihood from a multivariate linear regression model with errors from a scale mixture of normals is combined with the standard non-informative prior. There is a simple data augmentation algorithm (based on latent data from the mixing density) that can be used to explore pi. Let h and d denote the mixing density and the dimension of the regression model, respectively. Hobert et al. (2018) have recently shown that, if h converges to 0 at the origin at an appropriate rate, and integral(infinity)(0) u(d/2) h(u) du < infinity, then the Markov chains underlying the data augmentation (DA) algorithm and an alternative Haar parameter expanded DA (PX-DA) algorithm are both geometrically ergodic. Their results are established using probabilistic techniques based on drift and minorization conditions. In this paper, spectral analytic techniques are used to establish that something much stronger than geometric ergodicity often holds. In particular, it is shown that, under simple conditions on h, the Markov operators defined by the DA and Haar PX-DA Markov chains are trace-class, i.e., compact with summable eigenvalues. Many standard mixing densities satisfy the conditions developed in this paper. Indeed, the new results imply that the DA and Haar PX-DA Markov operators are trace-class whenever the mixing density is generalized inverse Gaussian, log-normal, Frechet (with shape parameter larger than d/2), or inverted Gamma (with shape parameter larger than d/2). (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码:335 / 345
页数:11
相关论文
共 3 条