%0 Journal Article %1 liu_new_2006 %A Liu, Xuefeng %A Daniels, Michael J %D 2006 %J Journal of Computational and Graphical Statistics %K Carlo, Markov Monte chain correlations, multinomial probit regression, %N 4 %P 897--914 %R 10.1198/106186006X160681 %T A new algorithm for simulating a correlation matrix based on parameter expansion and reparameterization %U http://www.tandfonline.com/doi/abs/10.1198/106186006X160681 %V 15 %X The correlation matrix (denoted by R) plays an important role in many statistical models. Unfortunately, sampling the correlation matrix in Markov chain Monte Carlo (MCMC) algorithms can be problematic. In addition to the positive definite constraint of covariance matrices, correlation matrices have diagonal elements fixed at one. In this article, we propose an efficient two-stage parameter expanded reparameterization and Metropolis-Hastings (PX-RPMH) algorithm for simulating R. Using this algorithm, we draw all elements of R simultaneously by first drawing a covariance matrix from an inverse Wishart distribution, and then translating it back to a correlation matrix through a reduction function and accepting it based on a Metropolis-Hastings acceptance probability. This algorithm is illustrated using multivariate probit (MVP) models and multivariate regression (MVR) models with a common correlation matrix across groups. Via both a simulation study and a real data example, the performance of the PX-RPMH algorithm is compared with those of other common algorithms. The results show that the PX-RPMH algorithm is more efficient than other methods for sampling a correlation matrix.

@article{liu_new_2006, abstract = {The correlation matrix (denoted by R) plays an important role in many statistical models. Unfortunately, sampling the correlation matrix in Markov chain Monte Carlo (MCMC) algorithms can be problematic. In addition to the positive definite constraint of covariance matrices, correlation matrices have diagonal elements fixed at one. In this article, we propose an efficient two-stage parameter expanded reparameterization and Metropolis-Hastings (PX-RPMH) algorithm for simulating R. Using this algorithm, we draw all elements of R simultaneously by first drawing a covariance matrix from an inverse Wishart distribution, and then translating it back to a correlation matrix through a reduction function and accepting it based on a Metropolis-Hastings acceptance probability. This algorithm is illustrated using multivariate probit (MVP) models and multivariate regression (MVR) models with a common correlation matrix across groups. Via both a simulation study and a real data example, the performance of the PX-RPMH algorithm is compared with those of other common algorithms. The results show that the PX-RPMH algorithm is more efficient than other methods for sampling a correlation matrix.}, added-at = {2017-01-09T13:57:26.000+0100}, author = {Liu, Xuefeng and Daniels, Michael J}, biburl = {https://www.bibsonomy.org/bibtex/2e9fd843799763333f95a56d602e1a66e/yourwelcome}, doi = {10.1198/106186006X160681}, interhash = {1e4ccb94457ccf64767633c864659e68}, intrahash = {e9fd843799763333f95a56d602e1a66e}, issn = {1061-8600}, journal = {Journal of Computational and Graphical Statistics}, keywords = {Carlo, Markov Monte chain correlations, multinomial probit regression,}, number = 4, pages = {897--914}, timestamp = {2017-01-09T14:01:11.000+0100}, title = {A new algorithm for simulating a correlation matrix based on parameter expansion and reparameterization}, url = {http://www.tandfonline.com/doi/abs/10.1198/106186006X160681}, urldate = {2013-03-21}, volume = 15, year = 2006 }