Coloured Graphical Models and their Symmetries

12/03/2020
by   Isobel Davies, et al.
0

Coloured graphical models are Gaussian statistical models determined by an undirected coloured graph. These models can be described by linear spaces of symmetric matrices. We outline a relationship between the symmetries of the graph and the linear forms that vanish on the reciprocal variety of the model. In the special case of the uniform coloured n-cycle, this gives a complete description of all such linear forms.

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
06/17/2021

Identifiability of AMP chain graph models

We study identifiability of Andersson-Madigan-Perlman (AMP) chain graph ...
research
09/03/2019

On perfectness in Gaussian graphical models

Knowing when a graphical model is perfect to a distribution is essential...
research
02/04/2021

Graph Coding for Model Selection and Anomaly Detection in Gaussian Graphical Models

A classic application of description length is for model selection with ...
research
06/18/2018

The Minimax Learning Rate of Normal and Ising Undirected Graphical Models

Let G be an undirected graph with m edges and d vertices. We show that d...
research
10/09/2021

On sets of linear forms of maximal complexity

We present a uniform description of sets of m linear forms in n variable...
research
09/03/2019

Generating random Gaussian graphical models

Structure learning methods for covariance and concentration graphs are o...

Please sign up or login with your details

Forgot password? Click here to reset