2000 character limit reached
Patterns of conjunctive forks
Published 13 Aug 2016 in math.PR | (1608.03949v2)
Abstract: Three events in a probability space form a conjunctive fork if they satisfy specific constraints on conditional independence and covariances. Patterns of conjunctive forks within collections of events are characterized by means of systems of linear equations that have positive solutions. This characterization allows patterns of conjunctive forks to be recognized in polynomial time. Relations to previous work on causal betweenness and on patterns of conditional independence among random variables are discussed.
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.