Faithfulness in Chain Graphs: The Gaussian Case

08/13/2010
by   Jose M. Peña, et al.
0

This paper deals with chain graphs under the classic Lauritzen-Wermuth-Frydenberg interpretation. We prove that the regular Gaussian distributions that factorize with respect to a chain graph G with d parameters have positive Lebesgue measure with respect to R^d, whereas those that factorize with respect to G but are not faithful to it have zero Lebesgue measure with respect to R^d. This means that, in the measure-theoretic sense described, almost all the regular Gaussian distributions that factorize with respect to G are faithful to it.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/04/2022

On chromatic parameters of some Regular graphs

In this work, we try to enunciate the Total chromatic number of some Cay...
research
04/24/2012

Learning AMP Chain Graphs under Faithfulness

This paper deals with chain graphs under the alternative Andersson-Madig...
research
05/15/2023

Characterization of Plotkin-optimal two-weight codes over finite chain rings and related applications

Few-weight codes over finite chain rings are associated with combinatori...
research
01/30/2013

Bayesian Networks from the Point of View of Chain Graphs

AThe paper gives a few arguments in favour of the use of chain graphs fo...
research
07/19/2018

The Limiting Eigenvalue Distribution of Iterated k-Regular Graph Cylinders

We explore the limiting empirical eigenvalue distributions arising from ...
research
04/21/2020

On the regularity of De Bruijn multigrids

In this paper we prove that any odd multigrid with non-zero rational off...
research
06/17/2021

Identifiability of AMP chain graph models

We study identifiability of Andersson-Madigan-Perlman (AMP) chain graph ...

Please sign up or login with your details

Forgot password? Click here to reset