The ratio of normalizing constants for Bayesian graphical Gaussian model selection

06/14/2017
by   A. Mohammadi, et al.
0

The ratio of normalizing constants for the G-Wishart distribution, for two graphs differing by an edge e, has long been a bottleneck in the search for efficient model selection in the class of graphical Gaussian models. We give an accurate approximation to this ratio under two assumptions: first, we assume that the scale of the prior is the identity, second we assume that the set of paths between the two ends of e are disjoint. The first approximation does not represent a restriction since this is what statisticians use. The second assumption is a real restriction but we conjecture that similar results are also true without this second assumption. We shall prove it in subsequent work. This approximation is simply a ratio of Gamma functions and thus need no simulation. We illustrate the efficiency and practical impact of our result by comparing model selection in the class of graphical Gaussian models using this approximation and using current Metropolis-Hastings methods. We work both with simulated data and a complex high-dimensional real data set. In the numerical examples, we do not assume that the paths between the two endpoints of edge e are disjoint.

READ FULL TEXT

page 34

page 35

research
04/02/2020

Bayesian model selection approach for colored graphical Gaussian models

We consider a class of colored graphical Gaussian models obtained by pla...
research
08/27/2019

Model Selection With Graphical Neighbour Information

Accurate model selection is a fundamental requirement for statistical an...
research
07/27/2022

Graphical Gaussian models associated to a homogeneous graph with permutation symmetries

We consider multivariate centered Gaussian models for the random vector ...
research
06/15/2018

Robust Bayesian Model Selection for Variable Clustering with the Gaussian Graphical Model

Variable clustering is important for explanatory analysis. However, only...
research
06/21/2021

A generalized EMS algorithm for model selection with incomplete data

Recently, a so-called E-MS algorithm was developed for model selection i...
research
07/04/2019

High-dimensional Gaussian graphical model for network-linked data

Graphical models are commonly used to represent conditional dependence r...
research
07/06/2020

Learning the Markov order of paths in a network

We study the problem of learning the Markov order in categorical sequenc...

Please sign up or login with your details

Forgot password? Click here to reset