2000 character limit reached
Topological Conditional Separation
Published 6 Aug 2021 in cs.DM and math.GN | (2108.03096v1)
Abstract: Pearl's d-separation is a foundational notion to study conditional independence between random variables. We define the topological conditional separation and we show that it is equivalent to the d-separation, extended beyond acyclic graphs, be they finite or infinite.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
