Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Probability distribution

From Wikipedia, the free encyclopedia
Mathematical function for the probability a given outcome occurs in an experiment
For other uses, seeDistribution.
Part of a series onstatistics
Probability theory

Inprobability theory andstatistics, aprobability distribution is afunction that gives the probabilities of occurrence of possibleevents for anexperiment.[1][2] It is a mathematical description of arandom phenomenon in terms of itssample space and theprobabilities ofevents (subsets of the sample space).[3]

For instance, ifX is used to denote the outcome of a coin toss ("the experiment"), then the probability distribution ofX would take the value 0.5 (1 in 2 or 1/2) forX = heads, and 0.5 forX = tails (assuming thatthe coin is fair). More commonly, probability distributions are used to compare the relative occurrence of many different random values.

Probability distributions can be defined in different ways and for discrete or for continuous variables. Distributions with special properties or for especially important applications are given specific names.

Introduction

[edit]

A probability distribution is a mathematical description of the probabilities of events, subsets of thesample space. The sample space, often represented in notation by Ω ,{\displaystyle \ \Omega \ ,} is theset of all possibleoutcomes of a random phenomenon being observed. The sample space may be any set: a set ofreal numbers, a set of descriptive labels, a set ofvectors, a set of arbitrary non-numerical values, etc. For example, the sample space of a coin flip could beΩ ={"heads", "tails"}.

To define probability distributions for the specific case ofrandom variables (so the sample space can be seen as a numeric set), it is common to distinguish betweendiscrete andcontinuousrandom variables. In the discrete case, it is sufficient to specify aprobability mass functionp{\displaystyle p} assigning a probability to each possible outcome (e.g. when throwing a fairdie, each of the six digits“1” to“6”, corresponding to the number of dots on the die, has probability16).{\displaystyle {\tfrac {1}{6}}).} The probability of anevent is then defined to be the sum of the probabilities of all outcomes that satisfy the event; for example, the probability of the event "the die rolls an even value" isp(2)+p(4)+p(6)=16+16+16=12.{\displaystyle p({\text{“}}2{\text{”}})+p({\text{“}}4{\text{”}})+p({\text{“}}6{\text{”}})={\frac {1}{6}}+{\frac {1}{6}}+{\frac {1}{6}}={\frac {1}{2}}.}In contrast, when a random variable takes values from a continuum then by convention, any individual outcome is assigned probability zero. For such continuous random variables, only events that include infinitely many outcomes such as intervals have probability greater than 0.

For example, consider measuring the weight of a piece of ham in the supermarket, and assume the scale can provide arbitrarily many digits of precision. Then, the probability that it weighsexactly 500 g must be zero because no matter how high the level of precision chosen, it cannot be assumed that there are no non-zero decimal digits in the remaining omitted digits ignored by the precision level.

However, for the same use case, it is possible to meet quality control requirements such as that a package of "500 g" of ham must weigh between 490 g and 510 g with at least 98% probability. This is possible because this measurement does not require as much precision from the underlying equipment.

Figure 1: The left graph shows a probability density function. The right graph shows the cumulative distribution function. The value ata in the cumulative distribution equals the area under the probability density curve up to the pointa.

Continuous probability distributions can be described by means of thecumulative distribution function, which describes the probability that the random variable is no larger than a given value (i.e.,P(Xx) for somex. The cumulative distribution function is the area under theprobability density function from-∞ tox, as shown in figure 1.[4]

Most continuous probability distributions encountered in practice are not only continuous but alsoabsolutely continuous. Such distributions can be described by theirprobability density function. Informally, the probability densityf{\displaystyle f} of a random variableX{\displaystyle X} describes theinfinitesimal probability thatX{\displaystyle X} takes any valuex{\displaystyle x} — that isP(xX<x+Δx)f(x)Δx{\displaystyle P(x\leq X<x+\Delta x)\approx f(x)\,\Delta x} asΔx>0{\displaystyle \Delta x>0} becomes is arbitrarily small. The probability thatX{\displaystyle X} lies in a given interval can be computed rigorously byintegrating the probability density function over that interval.[5]

General probability definition

[edit]

Let(Ω,F,P){\displaystyle (\Omega ,{\mathcal {F}},P)} be aprobability space,(E,E){\displaystyle (E,{\mathcal {E}})} be ameasurable space, andX:ΩE{\displaystyle X:\Omega \to E} be a(E,E){\displaystyle (E,{\mathcal {E}})}-valued random variable. Then theprobability distribution ofX{\displaystyle X} is thepushforward measure of the probability measureP{\displaystyle P} onto(E,E){\displaystyle (E,{\mathcal {E}})} induced byX{\displaystyle X}. Explicitly, this pushforward measure on(E,E){\displaystyle (E,{\mathcal {E}})} is given byX(P)(B)=P(X1(B)){\displaystyle X_{*}(P)(B)=P\left(X^{-1}(B)\right)} forBE.{\displaystyle B\in {\mathcal {E}}.}

Any probability distribution is aprobability measure on(E,E){\displaystyle (E,{\mathcal {E}})} (in general different fromP{\displaystyle P}, unlessX{\displaystyle X} happens to be the identity map).[citation needed]

A probability distribution can be described in various forms, such as by a probability mass function or a cumulative distribution function. One of the most general descriptions, which applies for absolutely continuous and discrete variables, is by means of a probability functionP:AR{\displaystyle P\colon {\mathcal {A}}\to \mathbb {R} } whoseinput spaceA{\displaystyle {\mathcal {A}}} is aσ-algebra, and gives areal numberprobability as its output, particularly, a number in[0,1]R{\displaystyle [0,1]\subseteq \mathbb {R} }.

The probability functionP{\displaystyle P} can take as argument subsets of the sample space itself, as in the coin toss example, where the functionP{\displaystyle P} was defined so thatP(heads) = 0.5 andP(tails) = 0.5. However, because of the widespread use ofrandom variables, which transform the sample space into a set of numbers (e.g.,R{\displaystyle \mathbb {R} },N{\displaystyle \mathbb {N} }), it is more common to study probability distributions whose argument are subsets of these particular kinds of sets (number sets),[6] and all probability distributions discussed in this article are of this type. It is common to denote asP(XE){\displaystyle P(X\in E)} the probability that a certain value of the variableX{\displaystyle X} belongs to a certain eventE{\displaystyle E}.[7][8]

The above probability function only characterizes a probability distribution if it satisfies all theKolmogorov axioms, that is:

  1. P(XE)0EA{\displaystyle P(X\in E)\geq 0\;\forall E\in {\mathcal {A}}}, so the probability is non-negative
  2. P(XE)1EA{\displaystyle P(X\in E)\leq 1\;\forall E\in {\mathcal {A}}}, so no probability exceeds1{\displaystyle 1}
  3. P(XiEi)=iP(XEi){\displaystyle P(X\in \bigcup _{i}E_{i})=\sum _{i}P(X\in E_{i})} for any countable disjoint family of sets{Ei}{\displaystyle \{E_{i}\}}

The concept of probability function is made more rigorous by defining it as the element of aprobability space(X,A,P){\displaystyle (X,{\mathcal {A}},P)}, whereX{\displaystyle X} is the set of possible outcomes,A{\displaystyle {\mathcal {A}}} is the set of all subsetsEX{\displaystyle E\subset X} whose probability can be measured, andP{\displaystyle P} is the probability function, orprobability measure, that assigns a probability to each of these measurable subsetsEA{\displaystyle E\in {\mathcal {A}}}.[9]

Probability distributions usually belong to one of two classes. Adiscrete probability distribution is applicable to the scenarios where the set of possible outcomes isdiscrete (e.g. a coin toss, a roll of a die) and the probabilities are encoded by a discrete list of the probabilities of the outcomes; in this case the discrete probability distribution is known asprobability mass function. On the other hand,absolutely continuous probability distributions are applicable to scenarios where the set of possible outcomes can take on values in a continuous range (e.g. real numbers), such as the temperature on a given day. In the absolutely continuous case, probabilities are described by aprobability density function, and the probability distribution is by definition the integral of the probability density function.[7][5][8] Thenormal distribution is a commonly encountered absolutely continuous probability distribution. More complex experiments, such as those involvingstochastic processes defined incontinuous time, may demand the use of more generalprobability measures.

A probability distribution whose sample space is one-dimensional (for example real numbers, list of labels, ordered labels or binary) is calledunivariate, while a distribution whose sample space is avector space of dimension 2 or more is calledmultivariate. A univariate distribution gives the probabilities of a singlerandom variable taking on various different values; a multivariate distribution (ajoint probability distribution) gives the probabilities of arandom vector – a list of two or more random variables – taking on various combinations of values. Important and commonly encountered univariate probability distributions include thebinomial distribution, thehypergeometric distribution, and thenormal distribution. A commonly encountered multivariate distribution is themultivariate normal distribution.

Besides the probability function, the cumulative distribution function, the probability mass function and the probability density function, themoment generating function and thecharacteristic function also serve to identify a probability distribution, as they uniquely determine an underlying cumulative distribution function.[10]

Figure 2: Theprobability density function (pdf) of thenormal distribution, also called Gaussian or "bell curve", the most important absolutely continuous random distribution. As notated on the figure, the probabilities of intervals of values correspond to the area under the curve.

Terminology

[edit]

Some key concepts and terms, widely used in the literature on the topic of probability distributions, are listed below.[1]

Basic terms

[edit]

Discrete probability distributions

[edit]

Absolutely continuous probability distributions

[edit]
  • Absolutely continuous probability distribution: for many random variables with uncountably many values.
  • Probability density function (pdf) orprobability density: function whose value at any given sample (or point) in thesample space (the set of possible values taken by the random variable) can be interpreted as providing arelative likelihood that the value of the random variable would equal that sample.

Related terms

[edit]
  • Support: set of values that can be assumed with non-zero probability (or probability density in the case of a continuous distribution) by the random variable. For a random variableX{\displaystyle X}, it is sometimes denoted asRX{\displaystyle R_{X}}.
  • Tail:[12] the regions close to the bounds of the random variable, if the pmf or pdf are relatively low therein. Usually has the formX>a{\displaystyle X>a},X<b{\displaystyle X<b} or a union thereof.
  • Head:[12] the region where the pmf or pdf is relatively high. Usually has the forma<X<b{\displaystyle a<X<b}.
  • Expected value ormean: theweighted average of the possible values, using their probabilities as their weights; or the continuous analog thereof.
  • Median: the value such that the set of values less than the median, and the set greater than the median, each have probabilities no greater than one-half.
  • Mode: for a discrete random variable, the value with highest probability; for an absolutely continuous random variable, a location at which the probability density function has a local peak.
  • Quantile: the q-quantile is the valuex{\displaystyle x} such thatP(X<x)=q{\displaystyle P(X<x)=q}.
  • Variance: the second moment of the pmf or pdf about the mean; an important measure of thedispersion of the distribution.
  • Standard deviation: the square root of the variance, and hence another measure of dispersion.
  • Symmetry: a property of some distributions in which the portion of the distribution to the left of a specific value (usually the median) is a mirror image of the portion to its right.
  • Skewness: a measure of the extent to which a pmf or pdf "leans" to one side of its mean. The thirdstandardized moment of the distribution.
  • Kurtosis: a measure of the "fatness" of the tails of a pmf or pdf. The fourth standardized moment of the distribution.

Cumulative distribution function

[edit]

In the special case of a real-valued random variable, the probability distribution can equivalently be represented by a cumulative distribution function instead of a probability measure. The cumulative distribution function of a random variableX{\displaystyle X} with regard to a probability distributionp{\displaystyle p} is defined asF(x)=P(Xx).{\displaystyle F(x)=P(X\leq x).}

The cumulative distribution function of any real-valued random variable has the properties:

Conversely, any functionF:RR{\displaystyle F:\mathbb {R} \to \mathbb {R} } that satisfies the first four of the properties above is the cumulative distribution function of some probability distribution on the real numbers.[13]

Any probability distribution can be decomposed as themixture of adiscrete, anabsolutely continuous and asingular continuous distribution,[14] and thus any cumulative distribution function admits a decomposition as theconvex sum of the three according cumulative distribution functions.

Discrete probability distribution

[edit]
Main article:Probability mass function
Figure 3: Theprobability mass function (pmf)p(S){\displaystyle p(S)} specifies the probability distribution for the sumS{\displaystyle S} of counts from twodice. For example, the figure shows thatp(11)=2/36=1/18{\displaystyle p(11)=2/36=1/18}. The pmf allows the computation of probabilities of events such asP(X>9)=1/12+1/18+1/36=1/6{\displaystyle P(X>9)=1/12+1/18+1/36=1/6}, and all other probabilities in the distribution.
Figure 4: The probability mass function of a discrete probability distribution. The probabilities of thesingletons {1}, {3}, and {7} are respectively 0.2, 0.5, 0.3. A set not containing any of these points has probability zero.
Figure 5: Thecdf of a discrete probability distribution, ...
Figure 6: ... of a continuous probability distribution, ...
Figure 7: ... of a distribution which has both a continuous part and a discrete part

Adiscrete probability distribution is the probability distribution of a random variable that can take on only a countable number of values[15] (almost surely)[16] which means that the probability of any eventE{\displaystyle E} can be expressed as a (finite orcountably infinite) sum:P(XE)=ωAEP(X=ω),{\displaystyle P(X\in E)=\sum _{\omega \in A\cap E}P(X=\omega ),}whereA{\displaystyle A} is a countable set withP(XA)=1{\displaystyle P(X\in A)=1}. Thus the discrete random variables (i.e. random variables whose probability distribution is discrete) are exactly those with aprobability mass functionp(x)=P(X=x){\displaystyle p(x)=P(X=x)}. In the case where the range of values is countably infinite, these values have to decline to zero fast enough for the probabilities to add up to 1. For example, ifp(n)=12n{\displaystyle p(n)={\tfrac {1}{2^{n}}}} forn=1,2,...{\displaystyle n=1,2,...}, the sum of probabilities would be1/2+1/4+1/8+=1{\displaystyle 1/2+1/4+1/8+\dots =1}.

Well-known discrete probability distributions used in statistical modeling include thePoisson distribution, theBernoulli distribution, thebinomial distribution, thegeometric distribution, thenegative binomial distribution andcategorical distribution.[3] When asample (a set of observations) is drawn from a larger population, the sample points have anempirical distribution that is discrete, and which provides information about the population distribution. Additionally, thediscrete uniform distribution is commonly used in computer programs that make equal-probability random selections between a number of choices.

Cumulative distribution function

[edit]

A real-valued discrete random variable can equivalently be defined as a random variable whose cumulative distribution function increases only byjump discontinuities—that is, its cdf increases only where it "jumps" to a higher value, and is constant in intervals without jumps. The points where jumps occur are precisely the values which the random variable may take.Thus the cumulative distribution function has the formF(x)=P(Xx)=ωxp(ω).{\displaystyle F(x)=P(X\leq x)=\sum _{\omega \leq x}p(\omega ).}The points where the cdf jumps always form a countable set; this may be any countable set and thus may even be dense in the real numbers.

Dirac delta representation

[edit]

A discrete probability distribution is often represented withDirac measures, also called one-point distributions (see below), the probability distributions ofdeterministic random variables. For any outcomeω{\displaystyle \omega }, letδω{\displaystyle \delta _{\omega }} be the Dirac measure concentrated atω{\displaystyle \omega }. Given a discrete probability distribution, there is a countable setA{\displaystyle A} withP(XA)=1{\displaystyle P(X\in A)=1} and a probability mass functionp{\displaystyle p}. IfE{\displaystyle E} is any event, thenP(XE)=ωAp(ω)δω(E),{\displaystyle P(X\in E)=\sum _{\omega \in A}p(\omega )\delta _{\omega }(E),}or in short,PX=ωAp(ω)δω.{\displaystyle P_{X}=\sum _{\omega \in A}p(\omega )\delta _{\omega }.}

Similarly, discrete distributions can be represented with theDirac delta function as ageneralizedprobability density functionf{\displaystyle f}, wheref(x)=ωAp(ω)δ(xω),{\displaystyle f(x)=\sum _{\omega \in A}p(\omega )\delta (x-\omega ),}which meansP(XE)=Ef(x)dx=ωAp(ω)Eδ(xω)=ωAEp(ω){\displaystyle P(X\in E)=\int _{E}f(x)\,dx=\sum _{\omega \in A}p(\omega )\int _{E}\delta (x-\omega )=\sum _{\omega \in A\cap E}p(\omega )}for any eventE.{\displaystyle E.}[17]

Indicator-function representation

[edit]

For a discrete random variableX{\displaystyle X}, letu0,u1,{\displaystyle u_{0},u_{1},\dots } be the values it can take with non-zero probability. DenoteΩi=X1(ui)={ω:X(ω)=ui},i=0,1,2,{\displaystyle \Omega _{i}=X^{-1}(u_{i})=\{\omega :X(\omega )=u_{i}\},\,i=0,1,2,\dots }These aredisjoint sets, and for such setsP(iΩi)=iP(Ωi)=iP(X=ui)=1.{\displaystyle P\left(\bigcup _{i}\Omega _{i}\right)=\sum _{i}P(\Omega _{i})=\sum _{i}P(X=u_{i})=1.}It follows that the probability thatX{\displaystyle X} takes any value except foru0,u1,{\displaystyle u_{0},u_{1},\dots } is zero, and thus one can writeX{\displaystyle X} asX(ω)=iui1Ωi(ω){\displaystyle X(\omega )=\sum _{i}u_{i}1_{\Omega _{i}}(\omega )}except on a set of probability zero, where1A{\displaystyle 1_{A}} is the indicator function ofA{\displaystyle A}. This may serve as an alternative definition of discrete random variables.

One-point distribution

[edit]

A special case is the discrete distribution of a random variable that can take on only one fixed value, in other words, a Dirac measure. Expressed formally, the random variableX{\displaystyle X} has a one-point distribution if it has a possible outcomex{\displaystyle x} such thatP(X=x)=1.{\displaystyle P(X{=}x)=1.}[18] All other possible outcomes then have probability 0. Its cumulative distribution function jumps immediately from 0 beforex{\displaystyle x} to 1 atx{\displaystyle x}. It is closely related to a deterministic distribution, which cannot take on any other value, while a one-point distribution can take other values, though only with probability 0. For most practical purposes the two notions are equivalent.

Absolutely continuous probability distribution

[edit]
Main article:Probability density function

Anabsolutely continuous probability distribution is a probability distribution on the real numbers with uncountably many possible values, such as a whole interval in the real line, and where the probability of any event can be expressed as an integral.[19] More precisely, a real random variableX{\displaystyle X} has anabsolutely continuous probability distribution if there is a functionf:R[0,]{\displaystyle f:\mathbb {R} \to [0,\infty ]} such that for each intervalI=[a,b]R{\displaystyle I=[a,b]\subset \mathbb {R} } the probability ofX{\displaystyle X} belonging toI{\displaystyle I} is given by the integral off{\displaystyle f} overI{\displaystyle I}:[20][21]P(aXb)=abf(x)dx.{\displaystyle P\left(a\leq X\leq b\right)=\int _{a}^{b}f(x)\,dx.}This is the definition of aprobability density function, so that absolutely continuous probability distributions are exactly those with a probability density function.In particular, the probability forX{\displaystyle X} to take any single valuea{\displaystyle a} (that is,aXa{\displaystyle a\leq X\leq a}) is zero, because anintegral with coinciding upper and lower limits is always equal to zero.If the interval[a,b]{\displaystyle [a,b]} is replaced by any measurable setA{\displaystyle A}, the according equality still holds:P(XA)=Af(x)dx.{\displaystyle P(X\in A)=\int _{A}f(x)\,dx.}

Anabsolutely continuous random variable is a random variable whose probability distribution is absolutely continuous.

There are many examples of absolutely continuous probability distributions:normal,uniform,chi-squared, andothers.

Cumulative distribution function

[edit]

Absolutely continuous probability distributions as defined above are precisely those with anabsolutely continuous cumulative distribution function.In this case, the cumulative distribution functionF{\displaystyle F} has the formF(x)=P(Xx)=xf(t)dt{\displaystyle F(x)=P(X\leq x)=\int _{-\infty }^{x}f(t)\,dt}wheref{\displaystyle f} is a density of the random variableX{\displaystyle X} with regard to the distributionP{\displaystyle P}.

Note on terminology: Absolutely continuous distributions ought to be distinguished fromcontinuous distributions, which are those having a continuous cumulative distribution function. Every absolutely continuous distribution is a continuous distribution but the inverse is not true, there existsingular distributions, which are neither absolutely continuous nor discrete nor a mixture of those, and do not have a density. An example is given by theCantor distribution. Some authors however use the term "continuous distribution" to denote all distributions whose cumulative distribution function isabsolutely continuous, i.e. refer to absolutely continuous distributions as continuous distributions.[7]

For a more general definition of density functions and the equivalent absolutely continuous measures seeabsolutely continuous measure.

Kolmogorov definition

[edit]
Main articles:Probability space andProbability measure

In themeasure-theoretic formalization ofprobability theory, arandom variable is defined as ameasurable functionX{\displaystyle X} from aprobability space(Ω,F,P){\displaystyle (\Omega ,{\mathcal {F}},\mathbb {P} )} to ameasurable space(X,A){\displaystyle ({\mathcal {X}},{\mathcal {A}})}. Given that probabilities of events of the form{ωΩX(ω)A}{\displaystyle \{\omega \in \Omega \mid X(\omega )\in A\}} satisfyKolmogorov's probability axioms, theprobability distribution ofX{\displaystyle X} is theimage measureXP{\displaystyle X_{*}\mathbb {P} } ofX{\displaystyle X} , which is aprobability measure on(X,A){\displaystyle ({\mathcal {X}},{\mathcal {A}})} satisfyingXP=PX1{\displaystyle X_{*}\mathbb {P} =\mathbb {P} X^{-1}}.[22][23][24]

Other kinds of distributions

[edit]
Figure 8: One solution for theRabinovich–Fabrikant equations. What is the probability of observing a state on a certain place of the support (i.e., the red subset)?

Absolutely continuous and discrete distributions with support onRk{\displaystyle \mathbb {R} ^{k}} orNk{\displaystyle \mathbb {N} ^{k}} are extremely useful to model a myriad of phenomena,[7][4] since most practical distributions are supported on relatively simple subsets, such ashypercubes orballs. However, this is not always the case, and there exist phenomena with supports that are actually complicated curvesγ:[a,b]Rn{\displaystyle \gamma :[a,b]\rightarrow \mathbb {R} ^{n}} within some spaceRn{\displaystyle \mathbb {R} ^{n}} or similar. In these cases, the probability distribution is supported on the image of such curve, and is likely to be determined empirically, rather than finding a closed formula for it.[25]

One example is shown in the figure to the right, which displays the evolution of asystem of differential equations (commonly known as theRabinovich–Fabrikant equations) that can be used to model the behaviour ofLangmuir waves inplasma.[26] When this phenomenon is studied, the observed states from the subset are as indicated in red. So one could ask what is the probability of observing a state in a certain position of the red subset; if such a probability exists, it is called the probability measure of the system.[27][25]

This kind of complicated support appears quite frequently indynamical systems. It is not simple to establish that the system has a probability measure, and the main problem is the following. Lett1t2t3{\displaystyle t_{1}\ll t_{2}\ll t_{3}} be instants in time andO{\displaystyle O} a subset of the support; if the probability measure exists for the system, one would expect the frequency of observing states inside setO{\displaystyle O} would be equal in interval[t1,t2]{\displaystyle [t_{1},t_{2}]} and[t2,t3]{\displaystyle [t_{2},t_{3}]}, which might not happen; for example, it could oscillate similar to a sine,sin(t){\displaystyle \sin(t)}, whose limit whent{\displaystyle t\rightarrow \infty } does not converge. Formally, the measure exists only if the limit of the relative frequency converges when the system is observed into the infinite future.[28] The branch of dynamical systems that studies the existence of a probability measure isergodic theory.

Note that even in these cases, the probability distribution, if it exists, might still be termed "absolutely continuous" or "discrete" depending on whether the support is uncountable or countable, respectively.

Random number generation

[edit]
Main article:Pseudo-random number sampling

Most algorithms are based on apseudorandom number generator that produces numbersX{\displaystyle X} that are uniformly distributed in thehalf-open interval[0, 1). Theserandom variatesX{\displaystyle X} are then transformed via some algorithm to create a new random variate having the required probability distribution. With this source of uniform pseudo-randomness, realizations of any random variable can be generated.[29]

For example, supposeU has a uniform distribution between 0 and 1. To construct a random Bernoulli variable for some0 < p < 1, defineX={1if U<p0if Up.{\displaystyle X={\begin{cases}1&{\text{if }}U<p\\0&{\text{if }}U\geq p.\end{cases}}}We thus haveP(X=1)=P(U<p)=p,P(X=0)=P(Up)=1p.{\displaystyle P(X=1)=P(U<p)=p,\quad P(X=0)=P(U\geq p)=1-p.}Therefore, the random variableX has a Bernoulli distribution with parameterp.[29]

This method can be adapted to generate real-valued random variables with any distribution: for be any cumulative distribution functionF, letFinv be the generalized left inverse ofF,{\displaystyle F,} also known in this context as thequantile function orinverse distribution function:Finv(p)=inf{xR:pF(x)}.{\displaystyle F^{\mathrm {inv} }(p)=\inf\{x\in \mathbb {R} :p\leq F(x)\}.}Then,Finv(p) ≤x if and only ifpF(x). As a result, ifU is uniformly distributed on[0, 1], then the cumulative distribution function ofX =Finv(U) isF.

For example, suppose we want to generate a random variable having an exponential distribution with parameterλ{\displaystyle \lambda } — that is, with cumulative distribution functionF:x1eλx.{\displaystyle F:x\mapsto 1-e^{-\lambda x}.}F(x)=u1eλx=ueλx=1uλx=ln(1u)x=1λln(1u){\displaystyle {\begin{aligned}F(x)=u&\Leftrightarrow 1-e^{-\lambda x}=u\\[2pt]&\Leftrightarrow e^{-\lambda x}=1-u\\[2pt]&\Leftrightarrow -\lambda x=\ln(1-u)\\[2pt]&\Leftrightarrow x={\frac {-1}{\lambda }}\ln(1-u)\end{aligned}}}soFinv(u)=1λln(1u){\displaystyle F^{\mathrm {inv} }(u)=-{\tfrac {1}{\lambda }}\ln(1-u)}, and ifU has a uniform distribution on[0, 1) thenX=1λln(1U){\displaystyle X=-{\tfrac {1}{\lambda }}\ln(1-U)} has an exponential distribution with parameterλ.{\displaystyle \lambda .}[29]

Although from a theoretical point of view this method always works, in practice the inverse distribution function is unknown and/or cannot be computed efficiently. In this case, other methods (such as theMonte Carlo method) are used.

Common probability distributions and their applications

[edit]
For a more comprehensive list, seeList of probability distributions.

The concept of the probability distribution and the random variables which they describe underlies the mathematical discipline of probability theory, and the science of statistics. There is spread or variability in almost any value that can be measured in a population (e.g. height of people, durability of a metal, sales growth, traffic flow, etc.); almost all measurements are made with some intrinsic error; in physics, many processes are described probabilistically, from thekinetic properties of gases to thequantum mechanical description offundamental particles. For these and many other reasons, simplenumbers are often inadequate for describing a quantity, while probability distributions are often more appropriate.

The following is a list of some of the most common probability distributions, grouped by the type of process that they are related to. For a more complete list, seelist of probability distributions, which groups by the nature of the outcome being considered (discrete, absolutely continuous, multivariate, etc.)

All of the univariate distributions below are singly peaked; that is, it is assumed that the values cluster around a single point. In practice, actually observed quantities may cluster around multiple values. Such quantities can be modeled using amixture distribution.

Linear growth (e.g. errors, offsets)

[edit]
  • Normal distribution (Gaussian distribution), for a single such quantity; the most commonly used absolutely continuous distribution

Exponential growth (e.g. prices, incomes, populations)

[edit]

Uniformly distributed quantities

[edit]

Bernoulli trials (yes/no events, with a given probability)

[edit]

Categorical outcomes (events withK possible outcomes)

[edit]

Poisson process (events that occur independently with a given rate)

[edit]

Absolute values of vectors with normally distributed components

[edit]
  • Rayleigh distribution, for the distribution of vector magnitudes with Gaussian distributed orthogonal components. Rayleigh distributions are found in RF signals with Gaussian real and imaginary components.
  • Rice distribution, a generalization of the Rayleigh distributions for where there is a stationary background signal component. Found inRician fading of radio signals due to multipath propagation and in MR images with noise corruption on non-zero NMR signals.

Normally distributed quantities operated with sum of squares

[edit]

As conjugate prior distributions in Bayesian inference

[edit]
Main article:Conjugate prior

Some specialized applications of probability distributions

[edit]

Fitting

[edit]
This section is an excerpt fromProbability distribution fitting.[edit]

Probability distribution fitting or simply distribution fitting is the fitting of a probability distribution to a series of data concerning the repeated measurement of a variable phenomenon.The aim of distribution fitting is topredict theprobability or toforecast thefrequency of occurrence of the magnitude of the phenomenon in a certain interval.

There are many probability distributions (seelist of probability distributions) of which some can be fitted more closely to the observed frequency of the data than others, depending on the characteristics of the phenomenon and of the distribution. The distribution giving a close fit is supposed to lead to good predictions.

In distribution fitting, therefore, one needs to select a distribution that suits the data well.

See also

[edit]

Lists

[edit]

References

[edit]

Citations

[edit]
  1. ^abEveritt, Brian (2006).The Cambridge dictionary of statistics (3rd ed.). Cambridge, UK: Cambridge University Press.ISBN 978-0-511-24688-3.OCLC 161828328.
  2. ^Ash, Robert B. (2008).Basic probability theory (Dover ed.). Mineola, N.Y.: Dover Publications. pp. 66–69.ISBN 978-0-486-46628-6.OCLC 190785258.
  3. ^abEvans, Michael; Rosenthal, Jeffrey S. (2010).Probability and statistics: the science of uncertainty (2nd ed.). New York: W.H. Freeman and Co. p. 38.ISBN 978-1-4292-2462-8.OCLC 473463742.
  4. ^abDekking, Michel (1946–) (2005).A Modern Introduction to Probability and Statistics : Understanding why and how. London, UK: Springer.ISBN 978-1-85233-896-1.OCLC 262680588.{{cite book}}: CS1 maint: numeric names: authors list (link)
  5. ^ab"1.3.6.1. What is a Probability Distribution".www.itl.nist.gov. Retrieved2020-09-10.
  6. ^Walpole, R.E.; Myers, R.H.; Myers, S.L.; Ye, K. (1999).Probability and statistics for engineers. Prentice Hall.
  7. ^abcdRoss, Sheldon M. (2010).A first course in probability. Pearson.
  8. ^abDeGroot, Morris H.; Schervish, Mark J. (2002).Probability and Statistics. Addison-Wesley.
  9. ^Billingsley, P. (1986).Probability and measure. Wiley.ISBN 9780471804789.
  10. ^Shephard, N.G. (1991)."From characteristic function to distribution function: a simple framework for the theory".Econometric Theory.7 (4):519–529.doi:10.1017/S0266466600004746.S2CID 14668369.
  11. ^Chapters 1 and 2 ofVapnik (1998)
  12. ^abMore information and examples can be found in the articlesHeavy-tailed distribution,Long-tailed distribution,fat-tailed distribution
  13. ^Erhan, Çınlar (2011).Probability and stochastics. New York: Springer. p. 57.ISBN 9780387878584.
  14. ^seeLebesgue's decomposition theorem
  15. ^Erhan, Çınlar (2011).Probability and stochastics. New York: Springer. p. 51.ISBN 9780387878591.OCLC 710149819.
  16. ^Cohn, Donald L. (1993).Measure theory. Birkhäuser.
  17. ^Khuri, André I. (March 2004). "Applications of Dirac's delta function in statistics".International Journal of Mathematical Education in Science and Technology.35 (2):185–195.doi:10.1080/00207390310001638313.ISSN 0020-739X.S2CID 122501973.
  18. ^Fisz, Marek (1963).Probability Theory and Mathematical Statistics (3rd ed.). John Wiley & Sons. p. 129.ISBN 0-471-26250-1.{{cite book}}:ISBN / Date incompatibility (help)
  19. ^Jeffrey Seth Rosenthal (2000).A First Look at Rigorous Probability Theory. World Scientific.
  20. ^Chapter 3.2 ofDeGroot & Schervish (2002)
  21. ^Bourne, Murray."11. Probability Distributions - Concepts".www.intmath.com. Retrieved2020-09-10.
  22. ^W., Stroock, Daniel (1999).Probability theory : an analytic view (Rev. ed.). Cambridge [England]: Cambridge University Press. p. 11.ISBN 978-0521663496.OCLC 43953136.{{cite book}}: CS1 maint: multiple names: authors list (link)
  23. ^Kolmogorov, Andrey (1950) [1933].Foundations of the theory of probability. New York, USA: Chelsea Publishing Company. pp. 21–24.
  24. ^Joyce, David (2014)."Axioms of Probability"(PDF).Clark University. RetrievedDecember 5, 2019.
  25. ^abAlligood, K.T.; Sauer, T.D.; Yorke, J.A. (1996).Chaos: an introduction to dynamical systems. Springer.
  26. ^Rabinovich, M.I.; Fabrikant, A.L. (1979). "Stochastic self-modulation of waves in nonequilibrium media".J. Exp. Theor. Phys.77:617–629.Bibcode:1979JETP...50..311R.
  27. ^Section 1.9 ofRoss, S.M.; Peköz, E.A. (2007).A second course in probability(PDF).
  28. ^Walters, Peter (2000).An Introduction to Ergodic Theory. Springer.
  29. ^abcDekking, Frederik Michel; Kraaikamp, Cornelis; Lopuhaä, Hendrik Paul; Meester, Ludolf Erwin (2005), "Why probability and statistics?",A Modern Introduction to Probability and Statistics, Springer London, pp. 1–11,doi:10.1007/1-84628-168-7_1,ISBN 978-1-85233-896-1
  30. ^Bishop, Christopher M. (2006).Pattern recognition and machine learning. New York: Springer.ISBN 0-387-31073-8.OCLC 71008143.
  31. ^Chang, Raymond. (2014).Physical chemistry for the chemical sciences. Thoman, John W., Jr., 1960-. [Mill Valley, California]. pp. 403–406.ISBN 978-1-68015-835-9.OCLC 927509011.{{cite book}}: CS1 maint: location missing publisher (link)
  32. ^Chen, P.; Chen, Z.; Bak-Jensen, B. (April 2008). "Probabilistic load flow: A review".2008 Third International Conference on Electric Utility Deregulation and Restructuring and Power Technologies. pp. 1586–1591.doi:10.1109/drpt.2008.4523658.ISBN 978-7-900714-13-8.S2CID 18669309.
  33. ^Maity, Rajib (2018-04-30).Statistical methods in hydrology and hydroclimatology. Singapore.ISBN 978-981-10-8779-0.OCLC 1038418263.{{cite book}}: CS1 maint: location missing publisher (link)

Sources

[edit]

External links

[edit]
Wikimedia Commons has media related toProbability distribution.
Discrete
univariate
with finite
support
with infinite
support
Continuous
univariate
supported on a
bounded interval
supported on a
semi-infinite
interval
supported
on the whole
real line
with support
whose type varies
Mixed
univariate
continuous-
discrete
Multivariate
(joint)
Directional
Degenerate
andsingular
Degenerate
Dirac delta function
Singular
Cantor
Families
Continuous data
Center
Dispersion
Shape
Count data
Summary tables
Dependence
Graphics
Study design
Survey methodology
Controlled experiments
Adaptive designs
Observational studies
Statistical theory
Frequentist inference
Point estimation
Interval estimation
Testing hypotheses
Parametric tests
Specific tests
Goodness of fit
Rank statistics
Bayesian inference
Correlation
Regression analysis
Linear regression
Non-standard predictors
Generalized linear model
Partition of variance
Categorical
Multivariate
Time-series
General
Specific tests
Time domain
Frequency domain
Survival
Survival function
Hazard function
Test
Biostatistics
Engineering statistics
Social statistics
Spatial statistics
National
Other
Retrieved from "https://en.wikipedia.org/w/index.php?title=Probability_distribution&oldid=1289132107"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp