Bernoulli trial

In the theory of probability and statistics, a Bernoulli trial (or binomial trial) is a random experiment with exactly two possible outcomes, "success" and "failure", in which the probability of success is the same every time the experiment is conducted.^[1] It is named after Jacob Bernoulli, a 17th-century Swiss mathematician, who analyzed them in his Ars Conjectandi (1713).^[2]

The mathematical formalisation of the Bernoulli trial is known as the Bernoulli process. This article offers an elementary introduction to the concept, whereas the article on the Bernoulli process offers a more advanced treatment.

Since a Bernoulli trial has only two possible outcomes, it can be framed as some "yes or no" question. For example:

Is the top card of a shuffled deck an ace?
Was the newborn child a girl? (See human sex ratio.)

Therefore, success and failure are merely labels for the two outcomes, and should not be construed literally. The term "success" in this sense consists in the result meeting specified conditions, not in any moral judgement. More generally, given any probability space, for any event (set of outcomes), one can define a Bernoulli trial, corresponding to whether the event occurred or not (event or complementary event). Examples of Bernoulli trials include:

Flipping a coin. In this context, obverse ("heads") conventionally denotes success and reverse ("tails") denotes failure. A fair coin has the probability of success 0.5 by definition. In this case there are exactly two possible outcomes.
Rolling a die, where a six is "success" and everything else a "failure". In this case there are six possible outcomes, and the event is a six; the complementary event "not a six" corresponds to the other five possible outcomes.
In conducting a political opinion poll, choosing a voter at random to ascertain whether that voter will vote "yes" in an upcoming referendum.

Definition

Independent repeated trials of an experiment with exactly two possible outcomes are called Bernoulli trials. Call one of the outcomes "success" and the other outcome "failure". Let $p$ be the probability of success in a Bernoulli trial, and $q$ be the probability of failure. Then the probability of success and the probability of failure sum to one, since these are complementary events: "success" and "failure" are mutually exclusive and exhaustive. Thus one has the following relations:

p=1-q,\quad \quad q=1-p,\quad \quad p+q=1.

Alternatively, these can be stated in terms of odds: given probability p of success and q of failure, the odds for are $p:q$ and the odds against are $q:p.$ These can also be expressed as numbers, by dividing, yielding the odds for, $o_{f}$ , and the odds against, $o_{a}:$ ,

{\begin{aligned}o_{f}&=p/q=p/(1-p)=(1-q)/q\\o_{a}&=q/p=(1-p)/p=q/(1-q)\end{aligned}}

These are multiplicative inverses, so they multiply to 1, with the following relations:

o_{f}=1/o_{a},\quad o_{a}=1/o_{f},\quad o_{f}\cdot o_{a}=1.

In the case that a Bernoulli trial is representing an event from finitely many equally likely outcomes, where S of the outcomes are success and F of the outcomes are failure, the odds for are $S:F$ and the odds against are $F:S.$ This yields the following formulas for probability and odds:

{\begin{aligned}p&=S/(S+F)\\q&=F/(S+F)\\o_{f}&=S/F\\o_{a}&=F/S\end{aligned}}

Note that here the odds are computed by dividing the number of outcomes, not the probabilities, but the proportion is the same, since these ratios only differ by multiplying both terms by the same constant factor.

Random variables describing Bernoulli trials are often encoded using the convention that 1 = "success", 0 = "failure".

Closely related to a Bernoulli trial is a binomial experiment, which consists of a fixed number $n$ of statistically independent Bernoulli trials, each with a probability of success $p$ , and counts the number of successes. A random variable corresponding to a binomial experiment is denoted by $B(n,p)$ , and is said to have a binomial distribution. The probability of exactly $k$ successes in the experiment $B(n,p)$ is given by:

P(k)={n \choose k}p^{k}q^{n-k}

where ${n \choose k}$ is a binomial coefficient.

Bernoulli trials may also lead to negative binomial distributions (which count the number of successes in a series of repeated Bernoulli trials until a specified number of failures are seen), as well as various other distributions.

When multiple Bernoulli trials are performed, each with its own probability of success, these are sometimes referred to as Poisson trials.^[3]

Example: tossing coins

Consider the simple experiment where a fair coin is tossed four times. Find the probability that exactly two of the tosses result in heads.

Solution

For this experiment, let a heads be defined as a success and a tails as a failure. Because the coin is assumed to be fair, the probability of success is $p={\tfrac {1}{2}}$ . Thus the probability of failure, $q$ , is given by

q=1-p=1-{\tfrac {1}{2}}={\tfrac {1}{2}}

.

Using the equation above, the probability of exactly two tosses out of four total tosses resulting in a heads is given by:

{\begin{aligned}P(2)&={4 \choose 2}p^{2}q^{4-2}\\&=6\times \left({\tfrac {1}{2}}\right)^{2}\times \left({\tfrac {1}{2}}\right)^{2}\\&={\dfrac {3}{8}}.\end{aligned}}

References

^ Papoulis, A. (1984). "Bernoulli Trials". Probability, Random Variables, and Stochastic Processes (2nd ed.). New York: McGraw-Hill. pp. 57–63.
^ James Victor Uspensky: Introduction to Mathematical Probability, McGraw-Hill, New York 1937, page 45
^ Rajeev Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York (NY), 1995, p.67-68

External links

"Bernoulli trials", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
"Simulation of n Bernoulli trials". math.uah.edu. Retrieved 2014-01-21.

[1] Papoulis, A. (1984). "Bernoulli Trials". Probability, Random Variables, and Stochastic Processes (2nd ed.). New York: McGraw-Hill. pp. 57–63.

[2] James Victor Uspensky: Introduction to Mathematical Probability, McGraw-Hill, New York 1937, page 45

[3] Rajeev Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York (NY), 1995, p.67-68

[1]

[2]

[3]

Definition

Example: tossing coins

Solution

See also

References

External links