University of Cambridge > Talks.cam > Causal Inference Reading Group > A matrix algebra for graphical statistical models

A matrix algebra for graphical statistical models

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Martina Scauda.

Directed mixed graphs permit directed and bidirected edges between any two vertices. They were first considered in the path analysis developed by Sewall Wright and play an essential role in statistical modeling. We introduce a matrix algebra for walks on such graphs. Each element of the algebra is a matrix whose entries are sets of walks on the graph from the corresponding row to the corresponding column. The matrix algebra is then generated by applying addition (set union), multiplication (concatenation), and transpose to the two basic matrices consisting of directed and bidirected edges. We use it to formalize, in the context of Gaussian linear systems, the correspondence between important graphical concepts such as latent projection and graph separation with important probabilistic concepts such as marginalization and (conditional) independence. In two further examples regarding confounder adjustment and the augmentation criterion, we illustrate how the algebra allows us to visualize complex graphical proofs. A “dictionary” and LATE Xmacros for the matrix algebra are provided in the Appendix.

Preprint available: https://arxiv.org/pdf/2407.15744

This talk is part of the Causal Inference Reading Group series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity