Conditional Separation as a Binary Relation

Pearl's d-separation is a foundational notion to study conditional independence between random variables on directed acyclic graphs. Pearl defined the d-separation of two subsets conditionally on a third one. We show how the d-separation can be extended beyond acyclic graphs and can be expressed and characterized as a binary relation between vertices.