ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1103.1768
111
70

Wishart distributions for decomposable covariance graph models

9 March 2011
Kshitij Khare
B. Rajaratnam
ArXiv (abs)PDFHTML
Abstract

Gaussian covariance graph models encode marginal independence among the components of a multivariate random vector by means of a graph GGG. 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 Σ\SigmaΣ, as compared to the concentration matrix Ω=Σ−1\Omega =\Sigma^{-1}Ω=Σ−1. The parameter space of interest for covariance graph models is the cone PGP_GPG​ of positive definite matrices with fixed zeros corresponding to the missing edges of GGG. As in Letac and Massam [Ann. Statist. 35 (2007) 1278--1323], we consider the case where GGG is decomposable. In this paper, we construct on the cone PGP_GPG​ a family of Wishart distributions which serve a similar purpose in the covariance graph setting as those constructed by Letac and Massam [Ann. Statist. 35 (2007) 1278--1323] and Dawid and Lauritzen [Ann. Statist. 21 (1993) 1272--1317] do in the concentration graph setting. We proceed to undertake a rigorous study of these "covariance" Wishart distributions and derive several deep and useful properties of this class.

View on arXiv
Comments on this paper