In probability theory , a pairwise independent set of random variables is a set of random variables, any pair of which is independent [1] . Any set of randomly independent random variables is pairwise independent, but not all pairwise independent sets are independent in the aggregate. Pairwise independent random variables with finite dispersion are not correlated .
In practice, if this is not taken out of context, it is considered that independence means independence in the aggregate . Thus, a sentence of the form “ {\ displaystyle X} , , are independent random variables "means that , , are independent in aggregate.
Content
- 1 Example
- 2 Summary
- 3 See also
- 4 References
Example
Independence in aggregate does not follow from pairwise independence, as shown in the following example, attributed to S. N. Bernshtein [2]
Let random variables and denote two independent coin flips. Put 1 denotes the loss of an eagle, 0 - tails. Let be - a random variable equal to 1 if, as a result of exactly one of the two coin flips, an eagle fell out, and 0 otherwise. Then the three has the following probability distribution :
| with a probability of 1/4, | ||
| with a probability of 1/4, | ||
| with a probability of 1/4, | ||
| with a probability of 1/4. |
Note that the distributions of each random variable individually are equal to: and . The distributions of any pairs of these quantities are also equal: where
Since each of the pairwise joint distributions is equal to the product of the corresponding marginal distributions, the random variables are pairwise independent:
- and independent
- and independent
- and are independent.
In spite of this, , and are not independent in aggregate because . For the left side is 1/4, and the right is 1/8. Moreover, any of the three random variables , and is uniquely determined by two others and equals their sum taken modulo 2 .
Summary
Generally for any can talk about -ar independence. The idea is similar: a set of random variables is -ar independent if any subset of its power is independent in aggregate. -ary independence was used in theoretical computer science to prove the theorem on the MAXEkSAT problem.
See also
- Pairwise
- Pairwise Disjunctive Families of Sets
Links
- ↑ Gut, A. Probability: a Graduate Course. - Springer-Verlag, 2005. - ISBN 0-387-27332-8 . pg. 71-72.
- ↑ Hogg RV, McKean JW, Craig AT Introduction to Mathematical Statistics. - 6. - Upper Saddle River, NJ: Pearson Prentice Hall, 2005. - ISBN 0-13-008507-3 . Remark 2.6.1, p. 120.