Wishart distributions for decomposable covariance graph models
Kshitij Khare, Bala Rajaratnam

TL;DR
This paper introduces a new family of Wishart distributions tailored for decomposable covariance graph models, providing a rigorous analysis of their properties and expanding the tools available for statistical inference in this setting.
Contribution
It constructs covariance Wishart distributions for decomposable graphs and thoroughly studies their properties, filling a gap in the statistical modeling of covariance structures.
Findings
Defined covariance Wishart distributions on the cone P_G
Derived key properties of these distributions
Established their role analogous to classical Wishart in covariance graph models
Abstract
Gaussian covariance graph models encode marginal independence among the components of a multivariate random vector by means of a graph . These models are distinctly different from the traditional concentration graph models (often also referred to as Gaussian graphical models or covariance selection models) since the zeros in the parameter are now reflected in the covariance matrix , as compared to the concentration matrix . The parameter space of interest for covariance graph models is the cone of positive definite matrices with fixed zeros corresponding to the missing edges of . As in Letac and Massam [Ann. Statist. 35 (2007) 1278--1323], we consider the case where is decomposable. In this paper, we construct on the cone a family of Wishart distributions which serve a similar purpose in the covariance graph setting as those constructed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
