# Unifying DAGs and UGs

arXiv: https://arxiv.org/abs/1708.08722 · HTML: https://mlsanity.com/paper/1708.08722/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 29 Aug 2017.

## Built on by (most cited first, 2 of 2)

- [Graph Computing for Financial Crime and Fraud Detection: Trends, Challenges and Outlook](https://mlsanity.com/paper/2103.03227/) (2021)
- [Financial Crime & Fraud Detection Using Graph Computing: Application Considerations & Outlook](https://mlsanity.com/paper/2103.01854/) (2021)

## Abstract (arXiv)

We introduce a new class of graphical models that generalizes Lauritzen-Wermuth-Frydenberg chain graphs by relaxing the semi-directed acyclity constraint so that only directed cycles are forbidden. Moreover, up to two edges are allowed between any pair of nodes. Specifically, we present local, pairwise and global Markov properties for the new graphical models and prove their equivalence. We also present an equivalent factorization property. Finally, we present a causal interpretation of the new models.