Robust graphical modeling of gene networks using classical and alternative T-distributions

Abstract

Graphical Gaussian models have proven to be useful tools for exploring network structures based on multivariate data. Applications to studies of gene expression have generated substantial interest in these models, and resulting recent progress includes the development of fitting methodology involving penalization of the likelihood function. In this paper we advocate the use of multivariate $t$-distributions for more robust inference of graphs. In particular, we demonstrate that penalized likelihood inference combined with an application of the EM algorithm provides a computationally efficient approach to model selection in the $t$-distribution case. We consider two versions of multivariate $t$-distributions, one of which requires the use of approximation techniques. For this distribution, we describe a Markov chain Monte Carlo EM algorithm based on a Gibbs sampler as well as a simple variational approximation that makes the resulting method feasible in large problems.

Published in at http://dx.doi.org/10.1214/10-AOAS410 the Annals of Applied Statistics (http://www.imstat.org/aoas/) by the Institute of Mathematical Statistics (http://www.imstat.org)

References in corpus (2)

• High-dimensional graphs and variable selection with the Lasso
• Multiple Testing and Error Control in Gaussian Graphical Model Selection

Cited by in corpus (8)

• Multivariate Generalized Gaussian Distribution: Convexity and Graphical Models
• A cautionary note on robust covariance plug-in methods
• Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs
• Challenges of cellwise outliers
• Robust estimators for non-decomposable elliptical graphical models
• Groups acting on Gaussian graphical models
• Covariate-Assisted Bayesian Graph Learning for Heterogeneous Data
• A Bayesian Graphical Approach for Large-Scale Portfolio Management with Fewer Historical Data