Chain rule (probability)

Chain rule (probability)

In probability theory, the chain rule permits the calculation of any member of the joint distribution of a set of random variables using only conditional probabilities.

Consider an indexed set of sets A_1, \ldots A_n. To find the value of this member of the joint distribution, we can apply the definition of conditional probability to obtain:

\mathrm  P(A_n, \ldots A_1)  =  P(A_n | A_{n-1}, \ldots A_1) \cdot P( A_{n-1}, \ldots A_1)

Repeating this process with each final term creates the product

\mathrm  P(\cap_{k=1}^n A_k )  = \prod_{k=1}^n  \mathrm P( A_k \mid \cap_{j=1}^{k-1} A_j )

For example:

 \mathrm P(A_4, A_3, A_2, A_1) = \mathrm P(A_4 \mid A_3, A_2, A_1) \mathrm\cdot P(A_3 \mid A_2, A_1) \mathrm\cdot P(A_2 \mid A_1) \mathrm\cdot P(A_1)

The rule is useful in the study of Bayesian networks, which describe a probability distribution in terms of conditional probabilities.

This rule is illustrated in the following example. Urn 1 has 1 black ball and 2 white balls and Urn 2 has 1 black ball and 3 white balls. Suppose we pick an urn at random and then select a ball from that urn. Let event A be choosing the first urn: P(A) = P(~A) = 1/2. Let event B be the chance we choose a white ball. Chance of choosing a white ball, given that we've chose the first urn, is P(B|A) = 2/3. Chance of choosing a white ball, given that we've chosen the second urn is P(B|~A) = 3/4. Event A, B would be their intersection; choosing the first urn and a white ball from it. The probability can be found by the chain rule for probability:

 \mathrm P(A, B)=\mathrm P(B \mid A) \mathrm P(A) = 2/3 \times 1/2 = 1/3.

References


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Chain rule (disambiguation) — Chain rule may refer to: Chain rule in calculus: Cyclic chain rule, or triple product rule: Chain rule (probability) …   Wikipedia

  • Chain rule for Kolmogorov complexity — The chain rule for Kolmogorov complexity is an analogue of the chain rule for information entropy, which states: H(X,Y) = H(X) + H(Y | X) That is, the combined randomness of two sequences X and Y is the sum of the randomness of X plus whatever… …   Wikipedia

  • Conditional probability — The actual probability of an event A may in many circumstances differ from its original probability, because new information is available, in particular the information that an other event B has occurred. Intuition prescribes that the still… …   Wikipedia

  • Joint probability distribution — In the study of probability, given two random variables X and Y that are defined on the same probability space, the joint distribution for X and Y defines the probability of events defined in terms of both X and Y. In the case of only two random… …   Wikipedia

  • Bayesian probability — Bayesian statistics Theory Bayesian probability Probability interpretations Bayes theorem Bayes rule · Bayes factor Bayesian inference Bayesian network Prior · Posterior · Likelihood …   Wikipedia

  • List of probability topics — This is a list of probability topics, by Wikipedia page. It overlaps with the (alphabetical) list of statistical topics. There are also the list of probabilists and list of statisticians.General aspects*Probability *Randomness, Pseudorandomness,… …   Wikipedia

  • List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… …   Wikipedia

  • Itō calculus — Itō calculus, named after Kiyoshi Itō, extends the methods of calculus to stochastic processes such as Brownian motion (Wiener process). It has important applications in mathematical finance and stochastic differential equations.The central… …   Wikipedia

  • Kolmogorov complexity — In algorithmic information theory (a subfield of computer science), the Kolmogorov complexity of an object, such as a piece of text, is a measure of the computational resources needed to specify the object. It is named after Soviet Russian… …   Wikipedia

  • Integration by substitution — Topics in Calculus Fundamental theorem Limits of functions Continuity Mean value theorem Differential calculus  Derivative Change of variables Implicit differentiation Taylor s theorem Related rates …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”