Math 2.0

definition

Conditional independence

Definition

Let (Ω,F,P)(\Omega, \mathcal{F}, P) be a probability space and let A,B,C∈FA, B, C \in \mathcal{F} with P(C)>0P(C) > 0. The events AA and BB are conditionally independent given CC if P(A∩B∣C)=P(A∣C) P(B∣C),P(A \cap B \mid C) = P(A \mid C) \, P(B \mid C), where P(⋅∣C)P(\cdot \mid C) is the conditional probability given CC.

Remarks

If also P(B∩C)>0P(B \cap C) > 0, the condition is equivalent to P(A∣B∩C)=P(A∣C)P(A \mid B \cap C) = P(A \mid C). Conditional independence does not imply independence, and independence does not imply conditional independence. Example: choose one of two coins at random, a fair coin or a coin with two heads, and toss it two times. Given the coin, the two tosses are independent. Without this knowledge, they are dependent. For random variables XX and YY given ZZ, the definition uses the conditional distributions given ZZ.

Explanations

L1 human

Two results can be linked only through a hidden common cause. When you know the cause, the link disappears. This is conditional independence given the cause.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What depends on this

7 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Conditional_independence, Conditional independence of events