Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Special pages
Niidae Wiki
Search
Search
Appearance
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
Bernoulli trial
(section)
Page
Discussion
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Page information
Appearance
move to sidebar
hide
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Preliminary== Suppose there exists an experiment consisting of independently repeated trials, each of which has only two possible outcomes; called experimental Bernoulli trials. The collection of <math> n </math> experimental realizations of success (1) and failure (0) will be defined by a Bernoulli random variable: <math> bX_r |==> { x:bX_r == f(bX_r = x)::[x=1, x=0;;(p, p-1)] } </math> {{newline}} | <math> p=total_1/n</math> {{newline}} {{newline}} Let <math>p</math> be the probability of success in a Bernoulli trial, and <math>q</math> 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 [[Collectively exhaustive events|exhaustive]]. Thus, one has the following relations: :<math> p = 1 - q, \quad \quad q = 1 - p, \quad \quad p + q = 1.</math> Alternatively, these can be stated in terms of [[Odds (statistics)|odds]]: given probability ''<math>p</math>'' of success and ''<math>q</math>'' of failure, the ''odds for'' are <math>p:q</math> and the ''odds against'' are <math>q:p.</math> These can also be expressed as numbers, by dividing, yielding the odds for, <math>o_f</math>, and the odds against, <math>o_a</math>: :<math> \begin{align} o_f &= p/q = p/(1-p) = (1-q)/q\\ o_a &= q/p = (1-p)/p = q/(1-q). \end{align} </math> These are [[multiplicative inverse]]s, so they multiply to 1, with the following relations: :<math> o_f = 1/o_a, \quad o_a = 1/o_f, \quad o_f \cdot o_a = 1.</math> In the case that a Bernoulli trial is representing an event from finitely many [[equally likely outcomes]], where ''<math>S</math>'' of the outcomes are success and ''<math>F</math>'' of the outcomes are failure, the odds for are <math>S:F</math> and the odds against are <math>F:S.</math> This yields the following formulas for probability and odds: :<math> \begin{align} p &= S/(S+F)\\ q &= F/(S+F)\\ o_f &= S/F\\ o_a &= F/S. \end{align} </math> 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 variable]]s 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 <math>n</math> of [[statistically independent]] Bernoulli trials, each with a probability of success <math>p</math>, and counts the number of successes. A random variable corresponding to a binomial experiment is denoted by <math>B(n,p)</math>, and is said to have a ''[[binomial distribution]]''. The probability of exactly <math>k</math> successes in the experiment <math>B(n,p)</math> is given by: :<math>P(k)={n \choose k} p^k q^{n-k}</math> where <math>{n \choose k}</math> is a [[binomial coefficient]]. Bernoulli trials may also lead to [[negative binomial distribution]]s (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 trial]]s.<ref>[[Rajeev Motwani]] and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York (NY), 1995, p.67-68</ref>
Summary:
Please note that all contributions to Niidae Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Encyclopedia:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Search
Search
Editing
Bernoulli trial
(section)
Add topic