Torsion constant: Difference between revisions

Revision as of 10:48, 17 December 2013

In probability theory, the craps principle is a theorem about event probabilities under repeated iid trials. Let $E_{1}$ and $E_{2}$ denote two mutually exclusive events which might occur on a given trial. Then for each trial, the conditional probability that $E_{1}$ occurs given that $E_{1}$ or $E_{2}$ occur is

P [E_{1} ∣ E_{1} \cup E_{2}] = \frac{P [E_{1}]}{P [E_{1}] + P [E_{2}]}

The events $E_{1}$ and $E_{2}$ need not be collectively exhaustive.

Proof

Since $E_{1}$ and $E_{2}$ are mutually exclusive,

P [E_{1} \cup E_{2}] = P [E_{1}] + P [E_{2}]

Also due to mutual exclusion,

E_{1} \cap (E_{1} \cup E_{2}) = E_{1}

By conditional probability,

P [E_{1} \cap (E_{1} \cup E_{2})] = P [E_{1} ∣ E_{1} \cup E_{2}] P [E_{1} \cup E_{2}]

Combining these three yields the desired result.

Application

If the trials are repetitions of a game between two players, and the events are

E_{1} : p l a y e r 1 w i n s

E_{2} : p l a y e r 2 w i n s

then the craps principle gives the respective conditional probabilities of each player winning a certain repetition, given that someone wins (i.e., given that a draw does not occur). In fact, the result is only affected by the relative marginal probabilities of winning $P [E_{1}]$ and $P [E_{2}]$ ; in particular, the probability of a draw is irrelevant.

Stopping

If the game is played repeatedly until someone wins, then the conditional probability above turns out to be the probability that the player wins the game.

Etymology

If the game being played is craps, then this principle can greatly simplify the computation of the probability of winning in a certain scenario. Specifically, if the first roll is a 4, 5, 6, 8, 9, or 10, then the dice are repeatedly re-rolled until one of two events occurs:

E_{1} : the

E_{2} : a

Since $E_{1}$ and $E_{2}$ are mutually exclusive, the craps principle applies. For example, if the original roll was a 4, then the probability of winning is

\frac{3 / 36}{3 / 36 + 6 / 36} = \frac{1}{3}

This avoids having to sum the infinite series corresponding to all the possible outcomes:

\sum_{i = 0}^{\infty} P [first i (i + 1)^{th}]

Mathematically, we can express the probability of rolling $i$ ties followed by rolling the point:

P [first i (i + 1)^{th}] = (1 - P [E_{1}] - P [E_{2}])^{i} P [E_{1}]

The summation becomes an infinite geometric series:

\sum_{i = 0}^{\infty} (1 - P [E_{1}] - P [E_{2}])^{i} P [E_{1}] = P [E_{1}] \sum_{i = 0}^{\infty} (1 - P [E_{1}] - P [E_{2}])^{i}

= \frac{P [E_{1}]}{1 - (1 - P [E_{1}] - P [E_{2}])} = \frac{P [E_{1}]}{P [E_{1}] + P [E_{2}]}

which agrees with the earlier result.

References

20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

My blog: http://www.primaboinca.com/view_profile.php?userid=5889534

@@ Line 1: / Line 1: @@
-Greetings! I am Marvella and I really feel comfy when people use the full name. For years he's been living in North Dakota and his family enjoys it. For years he's been working as a receptionist. over the counter std test - [http://yenisehir.de/index.php?do=/profile-7188/info/ her explanation] - preferred pastime for my children and me is to play baseball but I haven't produced a dime with it.
+In [[probability theory]], the '''craps principle''' is a theorem about [[Event (probability theory)|event]] [[probabilities]] under repeated [[Independent and identically-distributed random variables|iid]] trials. Let <math>E_1</math> and <math>E_2</math> denote two [[mutually exclusive]] events which might occur on a given trial. Then for each trial, the [[conditional probability]] that <math>E_1</math> occurs given that <math>E_1</math> or <math>E_2</math> occur is
+:<math>\operatorname{P}\left[E_1\mid E_1\cup E_2\right]=\frac{\operatorname{P}[E_1]}{\operatorname{P}[E_1]+\operatorname{P}[E_2]}</math>
+The events <math>E_1</math> and <math>E_2</math> need not be [[collectively exhaustive]].
+==Proof==
+Since <math>E_1</math> and <math>E_2</math> are mutually exclusive,
+:<math> \operatorname{P}[E_1\cup E_2]=\operatorname{P}[E_1]+\operatorname{P}[E_2]</math>
+Also due to mutual exclusion,
+:<math> E_1\cap(E_1\cup E_2)=E_1</math>
+By [[conditional probability]],
+:<math> \operatorname{P}[E_1\cap(E_1\cup E_2)]=\operatorname{P}\left[E_1\mid E_1\cup E_2\right]\operatorname{P}\left[E_1\cup E_2\right]</math>
+Combining these three yields the desired result.
+==Application==
+If the trials are repetitions of a game between two players, and the events are
+:<math>E_1:\mathrm{ player\ 1\ wins}</math>
+:<math>E_2:\mathrm{ player\ 2\ wins}</math>
+then the craps principle gives the respective conditional probabilities of each player winning a certain repetition, given that someone wins (i.e., given that a [[draw (tie)|draw]] does not occur). In fact, the result is only affected by the relative marginal probabilities of winning <math>\operatorname{P}[E_1]</math> and <math>\operatorname{P}[E_2]</math> ; in particular, the probability of a draw is irrelevant.
+===Stopping===
+If the game is played repeatedly until someone wins, then the conditional probability above turns out to be the probability that the player wins the game.
+==Etymology==
+If the game being played is [[craps]], then this principle can greatly simplify the computation of the probability of winning in a certain scenario. Specifically, if the first roll is a 4, 5, 6, 8, 9, or 10, then the dice are repeatedly re-rolled until one of two events occurs:
+:<math>E_1:\textrm{ the\ original\ roll\ (called\ 'the\ point')\ is\ rolled\ (a\ win) }</math>
+:<math>E_2:\textrm{ a\ 7\ is\ rolled\ (a\ loss) }</math>
+Since <math>E_1</math> and <math>E_2</math> are mutually exclusive, the craps principle applies. For example, if the original roll was a 4, then the probability of winning is
+:<math>\frac{3/36}{3/36 + 6/36}=\frac{1}{3}</math>
+This avoids having to sum the [[infinite series]] corresponding to all the possible outcomes:
+:<math>\sum_{i=0}^{\infty}\operatorname{P}[\textrm{first\ }i\textrm{\ rolls\ are\ ties,\ }(i+1)^\textrm{th}\textrm{\ roll\ is\ 'the\ point'}]</math>
+Mathematically, we can express the probability of rolling <math>i</math> ties followed by rolling the point:
+:<math>\operatorname{P}[\textrm{first\ }i\textrm{\ rolls\ are\ ties,\ }(i+1)^\textrm{th}\textrm{\ roll\ is\ 'the\ point'}]
+ = (1-\operatorname{P}[E_1]-\operatorname{P}[E_2])^i\operatorname{P}[E_1]
+</math>
+The summation becomes an infinite [[geometric series]]:
+:<math>\sum_{i=0}^{\infty} (1-\operatorname{P}[E_1]-\operatorname{P}[E_2])^i\operatorname{P}[E_1]
+= \operatorname{P}[E_1] \sum_{i=0}^{\infty} (1-\operatorname{P}[E_1]-\operatorname{P}[E_2])^i
+</math>
+::<math> = \frac{\operatorname{P}[E_1]}{1-(1-\operatorname{P}[E_1]-\operatorname{P}[E_2])}
+= \frac{\operatorname{P}[E_1]}{\operatorname{P}[E_1]+\operatorname{P}[E_2]}
+</math>
+which agrees with the earlier result.
+==References==
+{{cite book |author=Pitman, Jim |title=Probability |publisher=Springer-Verlag |location=Berlin |year=1993 |pages= |isbn=0-387-97974-3 |oclc= |doi=}}
+[[Category:Statistical theorems]]
+[[Category:Probability theory]]
+[[Category:Statistical principles]]

Torsion constant: Difference between revisions

Revision as of 10:48, 17 December 2013

Contents

Proof

Application

Stopping

Etymology

References

Navigation menu

Torsion constant: Difference between revisions

Revision as of 10:48, 17 December 2013

Proof

Application

Stopping

Etymology

References

Navigation menu

Search