Bayesian Covariance Matrix Estimation using a Mixture of Decomposable Graphical Models
Estimating a covariance matrix efficiently and discovering its structure are important statistical problems with applications in many fields. This article takes a Bayesian approach to estimate the covariance matrix of Gaussian data. We use ideas from Gaussian graphical models and model selection to construct a prior for the covariance matrix that is a mixture over all decomposable graphs, where a graph means the configuration of nonzero offdiagonal elements in the inverse of the covariance matrix. Our prior for the covariance matrix is such that the probability of each graph size is specified by the user and graphs of equal size are assigned equal probability. Most previous approaches assume that all graphs are equally probable. We give empirical results that show the prior that assigns equal probability over graph sizes outperforms the prior that assigns equal probability over all graphs, both in identifying the correct decomposable graph and in more efficiently estimating the covariance matrix. The advantage is greatest when the number of observations is small relative to the dimension of the covariance matrix. The article also shows empirically that there is minimal change in statistical efficiency in using the mixture over decomposable graphs prior for estimating a general covariance compared to the Bayesian estimator by Wong et al. (2003), even when the graph of the covariance matrix is nondecomposable. However, our approach has some important advantages over that of Wong et al. (2003). Our method requires the number of decomposable graphs for each graph size. We show how to estimate these numbers using simulation and that the simulation results agree with analytic results when such results are known. We also show how to estimate the posterior distribution of the covariance matrix using Markov chain Monte Carlo with the elements of the covariance matrix integrated out and give empirical results that show the sampler is computationally efficient and converges rapidly. Finally, we note that both the prior and the simulation method to evaluate the prior apply generally to any decomposable graphical model.
|Date of creation:||Apr 2007|
|Date of revision:|
|Contact details of provider:|| Postal: |
Fax: +61)-2- 9313- 6337
Web page: http://www.economics.unsw.edu.au/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Mathias Drton, 2004. "Model selection for Gaussian concentration graphs," Biometrika, Biometrika Trust, vol. 91(3), pages 591-602, September.
- Smith M. & Kohn R., 2002. "Parsimonious Covariance Matrix Estimation for Longitudinal Data," Journal of the American Statistical Association, American Statistical Association, vol. 97, pages 1141-1153, December.
- Alberto Roverato, 2002. "Hyper Inverse Wishart Distribution for Non-decomposable Graphs and its Application to Bayesian Inference for Gaussian Graphical Models," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 29(3), pages 391-411.
- Frederick Wong, 2003. "Efficient estimation of covariance selection models," Biometrika, Biometrika Trust, vol. 90(4), pages 809-830, December.
- S. P. Brooks & P. Giudici & G. O. Roberts, 2003. "Efficient construction of reversible jump Markov chain Monte Carlo proposal distributions," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 65(1), pages 3-39.
When requesting a correction, please mention this item's handle: RePEc:swe:wpaper:2007-13. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Gabriele Gratton)
If references are entirely missing, you can add them using this form.