Experiments in stochastic computation for high-dimensional graphical models

Published

Journal Article

We discuss the implementation, development and performance of methods of stochastic computation in Gaussian graphical models. We view these methods from the perspective of high-dimensional model search, with a particular interest in the scalability with dimension of Markov chain Monte Carlo (MCMC) and other stochastic search methods. After reviewing the structure and context of undirected Gaussian graphical models and model uncertainty (covariance selection), we discuss prior specifications, including new priors over models, and then explore a number of examples using various methods of stochastic computation. Traditional MCMC methods are the point of departure for this experimentation; we then develop alternative stochastic search ideas and contrast this new approach with MCMC. Our examples range from low (12-20) to moderate (150) dimension, and combine simple synthetic examples with data analysis from gene expression studies. We conclude with comments about the need and potential for new computational methods in far higher dimensions, including constructive approaches to Gaussian graphical modeling and computation. © Institute of Mathematical Statistics, 2005.

Full Text

Duke Authors

Cited Authors

  • Jones, B; Carvalho, C; Dobra, A; Hans, C; Carter, C; West, M

Published Date

  • November 1, 2005

Published In

Volume / Issue

  • 20 / 4

Start / End Page

  • 388 - 400

International Standard Serial Number (ISSN)

  • 0883-4237

Digital Object Identifier (DOI)

  • 10.1214/088342305000000304

Citation Source

  • Scopus