Partial correlation hypersurfaces in Gaussian graphical models

06/01/2018
by   Jan Draisma, et al.
0

We derive a combinatorial sufficient condition for a partial correlation hypersurface in the parameter space of a directed Gaussian graphical model to be nonsingular, and speculate on whether this condition can be used in algorithms for learning the graph. Since the condition is fulfilled in the case of a complete DAG on any number of vertices, the result implies an affirmative answer to a question raised by Lin-Uhler-Sturmfels-Bühlmann.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/29/2021

Symmetrically colored Gaussian graphical models with toric vanishing ideal

A colored Gaussian graphical model is a linear concentration model in wh...
research
11/30/2020

Exponential decay of pairwise correlation in Gaussian graphical models with an equicorrelational one-dimensional connection pattern

We consider Gaussian graphical models associated with an equicorrelation...
research
08/17/2018

A Stepwise Approach for High-Dimensional Gaussian Graphical Models

We present a stepwise approach to estimate high dimensional Gaussian gra...
research
06/11/2018

Network reconstruction with local partial correlation: comparative evaluation

Over the past decade, various methods have been proposed for the reconst...
research
03/12/2015

Qualitative inequalities for squared partial correlations of a Gaussian random vector

We describe various sets of conditional independence relationships, suff...
research
11/03/2017

Partial correlation graphs and the neighborhood lattice

We define and study partial correlation graphs (PCGs) with variables in ...
research
09/23/2022

Sure Screening for Transelliptical Graphical Models

We propose a sure screening approach for recovering the structure of a t...

Please sign up or login with your details

Forgot password? Click here to reset