title: Bayesian sparse graphical models and their mixtures.
abstract: We propose Bayesian methods for Gaussian graphical models that lead to sparse and adaptively shrunk estimators of the precision (inverse covariance) matrix. Our methods are based on lasso-type regularization priors leading to parsimonious parameterization of the precision matrix, which is essential in several applications involving learning relationships among the variables. In this context, we introduce a novel type of selection prior that develops a sparse structure on the precision matrix by making most of the elements exactly zero, in addition to ensuring positive definiteness - thus conducting model selection and estimation simultaneously. More importantly, we extend these methods to analyze clustered data using finite mixtures of Gaussian graphical model and infinite mixtures of Gaussian graphical models. We discuss appropriate posterior simulation schemes to implement posterior inference in the proposed models, including the evaluation of normalizing constants that are functions of parameters of interest, which result from the restriction of positive definiteness on the correlation matrix. We evaluate the operating characteristics of our method via several simulations and demonstrate the application to real data examples in genomics.
authors.affiliation: The University of Texas MD Anderson Cancer Center, Houston, TX, USA.
authors.forename: Rajesh
authors.initials: R
authors.lastname: Talluri
authors.affiliation: The University of Texas MD Anderson Cancer Center, Houston, TX, USA.
authors.forename: Veerabhadran
authors.initials: V
authors.lastname: Baladandayuthapani
authors.affiliation: Texas A&M University, College Station TX, USA.
authors.forename: Bani K
authors.initials: BK
authors.lastname: Mallick
keywords: bayesian; covariance selection; finite mixtures; gaussian graphical models; infinite mixtures; sparse modeling