Matrix representations and independencies in directed acyclic graphs

DOI10.1214/08-AOS594zbMATH Open1162.62061arXiv0904.0333OpenAlexW3102916470MaRDI QIDQ1020988FDOQ1020988

Authors: Giovanni Maria Marchetti, Nanny Wermuth 

Publication date: 4 June 2009

Published in: The Annals of Statistics (Search for Journal in Brave)

Abstract: For a directed acyclic graph, there are two known criteria to decide whether any specific conditional independence statement is implied for all distributions factorized according to the given graph. Both criteria are based on special types of path in graphs. They are called separation criteria because independence holds whenever the conditioning set is a separating set in a graph theoretical sense. We introduce and discuss an alternative approach using binary matrix representations of graphs in which zeros indicate independence statements. A matrix condition is shown to give a new path criterion for separation and to be equivalent to each of the previous two path criteria.

Full work available at URL: https://arxiv.org/abs/0904.0333

Recommendations

• Acyclic directed graphs representing independence models
• Acyclic Directed Graphs to Represent Conditional Independence Models
• CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
• On chain graph models for description of conditional independence structures
• A characterization of Markov equivalence classes for acyclic digraphs

zbMATH Keywords

conditional independencepartial closureedge matrixparent graphpartial inversionseparation criteriastepwise data generating process

Mathematics Subject Classification ID

Multivariate analysis (62H99) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Characterization and structure theory for multivariate probability distributions; copulas (62H05) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Title not available (Why is that?)
• Influence diagrams for statistical modelling
• Title not available (Why is that?)
• Title not available (Why is that?)
• Identifying independence in bayesian networks
• Partial inversion for linear systems and partial closure of independence graphs
• Dynamic shortest paths and transitive closure: algorithmic techniques and data structures
• Joint Response Graphs and Separation Induced by Triangular Systems
• Independence properties of directed markov fields
• Distortion of effects caused by indirect confounding
• Title not available (Why is that?)

Cited In (8)

• Digraph Matrix Analysis
• Palindromic Bernoulli distributions
• Star graphs induce tetrad correlations: for Gaussian as well as for binary variables
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sequences of regressions and their independences
• Triangular systems for symmetric binary variables
• Probability distributions with summary graph structure

Uses Software

• ggm

This page was built for publication: Matrix representations and independencies in directed acyclic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1020988)