Probability density function

Function whose integral over a region describes the probability of an event occurring in that region

Box plot and probability density function of a normal distribution N(0, σ2). Geometric visualisation of the mode, median and mean of an arbitrary unimodal probability density function.[1]

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Probability density function" – news · newspapers · books · scholar · JSTOR (June 2022) (Learn how and when to remove this template message)

|

In probability theory, a probability density function (PDF), density function, or density of an absolutely continuous random variable, is a function whose value at any given sample (or point) in the sample space (the set of possible values taken by the random variable) can be interpreted as providing a relative likelihood that the value of the random variable would be equal to that sample.[2][3] Probability density is the probability per unit length, in other words, while the absolute likelihood for a continuous random variable to take on any particular value is 0 (since there is an infinite set of possible values to begin with), the value of the PDF at two different samples can be used to infer, in any particular draw of the random variable, how much more likely it is that the random variable would be close to one sample compared to the other sample.

In a more precise sense, the PDF is used to specify the probability of the random variable falling within a particular range of values, as opposed to taking on any one value. This probability is given by the integral of this variable's PDF over that range—that is, it is given by the area under the density function but above the horizontal axis and between the lowest and greatest values of the range. The probability density function is nonnegative everywhere, and the area under the entire curve is equal to 1.

The terms probability distribution function and probability function have also sometimes been used to denote the probability density function. However, this use is not standard among probabilists and statisticians. In other sources, "probability distribution function" may be used when the probability distribution is defined as a function over general sets of values or it may refer to the cumulative distribution function, or it may be a probability mass function (PMF) rather than the density. "Density function" itself is also used for the probability mass function, leading to further confusion.[4] In general though, the PMF is used in the context of discrete random variables (random variables that take values on a countable set), while the PDF is used in the context of continuous random variables.

## Example[edit]

Examples of four continuous probability density functions.

Suppose bacteria of a certain species typically live 4 to 6 hours. The probability that a bacterium lives exactly 5 hours is equal to zero. A lot of bacteria live for approximately 5 hours, but there is no chance that any given bacterium dies at exactly 5.00... hours. However, the probability that the bacterium dies between 5 hours and 5.01 hours is quantifiable. Suppose the answer is 0.02 (i.e., 2%). Then, the probability that the bacterium dies between 5 hours and 5.001 hours should be about 0.002, since this time interval is one-tenth as long as the previous. The probability that the bacterium dies between 5 hours and 5.0001 hours should be about 0.0002, and so on.

In this example, the ratio (probability of dying during an interval) / (duration of the interval) is approximately constant, and equal to 2 per hour (or 2 hour−1). For example, there is 0.02 probability of dying in the 0.01-hour interval between 5 and 5.01 hours, and (0.02 probability / 0.01 hours) = 2 hour−1. This quantity 2 hour−1 is called the probability density for dying at around 5 hours. Therefore, the probability that the bacterium dies at 5 hours can be written as (2 hour−1) dt. This is the probability that the bacterium dies within an infinitesimal window of time around 5 hours, where dt is the duration of this window. For example, the probability that it lives longer than 5 hours, but shorter than (5 hours + 1 nanosecond), is (2 hour−1)×(1 nanosecond) ≈ 6×10−13 (using the unit conversion 3.6×1012 nanoseconds = 1 hour).

There is a probability density function f with f(5 hours) = 2 hour−1. The integral of f over any window of time (not only infinitesimal windows but also large windows) is the probability that the bacterium dies in that window.

## Absolutely continuous univariate distributions[edit]

A probability density function is most commonly associated with absolutely continuous univariate distributions. A random variable X {\displaystyle X} has density  f X {\displaystyle f_{X}} , where  f X {\displaystyle f_{X}} is a non-negative Lebesgue-integrable function, if:

Pr [ a ≤ X ≤ b ] = ∫ a b f X ( x ) d x . {\displaystyle \Pr[a\leq X\leq b]=\int _{a}^{b}f_{X}(x)\,dx.}

Hence, if  F X {\displaystyle F_{X}} is the cumulative distribution function of  X {\displaystyle X} , then:

F X ( x ) = ∫ − ∞ x f X ( u ) d u , {\displaystyle F_{X}(x)=\int _{-\infty }^{x}f_{X}(u)\,du,}

and (if  f X {\displaystyle f_{X}} is continuous at  x {\displaystyle x} )

f X ( x ) = d d x F X ( x ) . {\displaystyle f_{X}(x)={\frac {d}{dx}}F_{X}(x).}

Intuitively, one can think of  f X ( x ) d x {\displaystyle f_{X}(x)\,dx} as being the probability of  X {\displaystyle X} falling within the infinitesimal interval [ x , x + d x ] {\displaystyle [x,x+dx]} .

## Formal definition[edit]

(This definition may be extended to any probability distribution using the measure-theoretic definition of probability.)

A random variable X {\displaystyle X} with values in a measurable space ( X , A ) {\displaystyle ({\mathcal {X}},{\mathcal {A}})} (usually  R n {\displaystyle \mathbb {R} ^{n}} with the Borel sets as measurable subsets) has as probability distribution the measure X∗P on  ( X , A ) {\displaystyle ({\mathcal {X}},{\mathcal {A}})} : the density of  X {\displaystyle X} with respect to a reference measure  μ {\displaystyle \mu } on  ( X , A ) {\displaystyle ({\mathcal {X}},{\mathcal {A}})} is the Radon–Nikodym derivative:

f = d X ∗ P d μ . {\displaystyle f={\frac {dX_{*}P}{d\mu }}.}

That is, f is any measurable function with the property that:

Pr [ X ∈ A ] = ∫ X − 1 A d P = ∫ A f d μ {\displaystyle \Pr[X\in A]=\int _{X^{-1}A}\,dP=\int _{A}f\,d\mu }

for any measurable set  A ∈ A . {\displaystyle A\in {\mathcal {A}}.}

### Discussion[edit]

In the continuous univariate case above, the reference measure is the Lebesgue measure. The probability mass function of a discrete random variable is the density with respect to the counting measure over the sample space (usually the set of integers, or some subset thereof).

It is not possible to define a density with reference to an arbitrary measure (e.g. one can not choose the counting measure as a reference for a continuous random variable). Furthermore, when it does exist, the density is almost unique, meaning that any two such densities coincide almost everywhere.

## Further details[edit]

Unlike a probability, a probability density function can take on values greater than one; for example, the continuous uniform distribution on the interval [0, 1/2] has probability density f(x) = 2 for 0 ≤ x ≤ 1/2 and f(x) = 0 elsewhere.

The standard normal distribution has probability density

f ( x ) = 1 2 π e − x 2 / 2 . {\displaystyle f(x)={\frac {1}{\sqrt {2\pi }}}\,e^{-x^{2}/2}.}

If a random variable X is given and its distribution admits a probability density function f, then the expected value of X (if the expected value exists) can be calculated as

E ⁡ [ X ] = ∫ − ∞ ∞ x f ( x ) d x . {\displaystyle \operatorname {E} [X]=\int _{-\infty }^{\infty }x\,f(x)\,dx.}

Not every probability distribution has a density function: the distributions of discrete random variables do not; nor does the Cantor distribution, even though it has no discrete component, i.e., does not assign positive probability to any individual point.

A distribution has a density function if and only if its cumulative distribution function F(x) is absolutely continuous. In this case: F is almost everywhere differentiable, and its derivative can be used as probability density:

d d x F ( x ) = f ( x ) . {\displaystyle {\frac {d}{dx}}F(x)=f(x).}

If a probability distribution admits a density, then the probability of every one-point set {a} is zero; the same holds for finite and countable sets.

Two probability densities f and g represent the same probability distribution precisely if they differ only on a set of Lebesgue measure zero.

In the field of statistical physics, a non-formal reformulation of the relation above between the derivative of the cumulative distribution function and the probability density function is generally used as the definition of the probability density function. This alternate definition is the following:

If dt is an infinitely small number, the probability that X is included within the interval (t, t \+ dt) is equal to f(t) dt, or:

Pr ( t < X < t + d t ) = f ( t ) d t . {\displaystyle \Pr(t<X<t+dt)=f(t)\,dt.}

## Link between discrete and continuous distributions[edit]

It is possible to represent certain discrete random variables as well as random variables involving both a continuous and a discrete part with a generalized probability density function using the Dirac delta function. (This is not possible with a probability density function in the sense defined above, it may be done with a distribution.) For example, consider a binary discrete random variable having the Rademacher distribution—that is, taking −1 or 1 for values, with probability 1⁄2 each. The density of probability associated with this variable is:

f ( t ) = 1 2 ( δ ( t + 1 ) + δ ( t − 1 ) ) . {\displaystyle f(t)={\frac {1}{2}}(\delta (t+1)+\delta (t-1)).}

More generally, if a discrete variable can take n different values among real numbers, then the associated probability density function is:

f ( t ) = ∑ i = 1 n p i δ ( t − x i ) , {\displaystyle f(t)=\sum _{i=1}^{n}p_{i}\,\delta (t-x_{i}),}

where  x 1 , … , x n {\displaystyle x_{1},\ldots ,x_{n}} are the discrete values accessible to the variable and  p 1 , … , p n {\displaystyle p_{1},\ldots ,p_{n}} are the probabilities associated with these values.

This substantially unifies the treatment of discrete and continuous probability distributions. The above expression allows for determining statistical characteristics of such a discrete variable (such as the mean, variance, and kurtosis), starting from the formulas given for a continuous distribution of the probability.

## Families of densities[edit]

It is common for probability density functions (and probability mass functions) to be parametrized—that is, to be characterized by unspecified parameters. For example, the normal distribution is parametrized in terms of the mean and the variance, denoted by  μ {\displaystyle \mu } and  σ 2 {\displaystyle \sigma ^{2}} respectively, giving the family of densities

f ( x ; μ , σ 2 ) = 1 σ 2 π e − 1 2 ( x − μ σ ) 2 . {\displaystyle f(x;\mu ,\sigma ^{2})={\frac {1}{\sigma {\sqrt {2\pi }}}}e^{-{\frac {1}{2}}\left({\frac {x-\mu }{\sigma }}\right)^{2}}.}

Different values of the parameters describe different distributions of different random variables on the same sample space (the same set of all possible values of the variable); this sample space is the domain of the family of random variables that this family of distributions describes. A given set of parameters describes a single distribution within the family sharing the functional form of the density. From the perspective of a given distribution, the parameters are constants, and terms in a density function that contain only parameters, but not variables, are part of the normalization factor of a distribution (the multiplicative factor that ensures that the area under the density—the probability of something in the domain occurring— equals 1). This normalization factor is outside the kernel of the distribution.

Since the parameters are constants, reparametrizing a density in terms of different parameters to give a characterization of a different random variable in the family, means simply substituting the new parameter values into the formula in place of the old ones.

## Densities associated with multiple variables[edit]

For continuous random variables X1, ..., Xn, it is also possible to define a probability density function associated to the set as a whole, often called joint probability density function. This density function is defined as a function of the n variables, such that, for any domain D in the n-dimensional space of the values of the variables X1, ..., Xn, the probability that a realisation of the set variables falls inside the domain D is

Pr ( X 1 , … , X n ∈ D ) = ∫ D f X 1 , … , X n ( x 1 , … , x n ) d x 1 ⋯ d x n . {\displaystyle \Pr \left(X_{1},\ldots ,X_{n}\in D\right)=\int _{D}f_{X_{1},\ldots ,X_{n}}(x_{1},\ldots ,x_{n})\,dx_{1}\cdots dx_{n}.}

If F(x1, ..., xn) = Pr(X1 ≤ x1, ..., Xn ≤ xn) is the cumulative distribution function of the vector (X1, ..., Xn), then the joint probability density function can be computed as a partial derivative

f ( x ) = ∂ n F ∂ x 1 ⋯ ∂ x n | x {\displaystyle f(x)=\left.{\frac {\partial ^{n}F}{\partial x_{1}\cdots \partial x_{n}}}\right|_{x}}

### Marginal densities[edit]

For i = 1, 2, ..., n, let fXi(xi) be the probability density function associated with variable Xi alone. This is called the marginal density function, and can be deduced from the probability density associated with the random variables X1, ..., Xn by integrating over all values of the other n − 1 variables:

f X i ( x i ) = ∫ f ( x 1 , … , x n ) d x 1 ⋯ d x i − 1 d x i + 1 ⋯ d x n . {\displaystyle f_{X_{i}}(x_{i})=\int f(x_{1},\ldots ,x_{n})\,dx_{1}\cdots dx_{i-1}\,dx_{i+1}\cdots dx_{n}.}

### Independence[edit]

Continuous random variables X1, ..., Xn admitting a joint density are all independent from each other if and only if

f X 1 , … , X n ( x 1 , … , x n ) = f X 1 ( x 1 ) ⋯ f X n ( x n ) . {\displaystyle f_{X_{1},\ldots ,X_{n}}(x_{1},\ldots ,x_{n})=f_{X_{1}}(x_{1})\cdots f_{X_{n}}(x_{n}).}

### Corollary[edit]

If the joint probability density function of a vector of n random variables can be factored into a product of n functions of one variable

f X 1 , … , X n ( x 1 , … , x n ) = f 1 ( x 1 ) ⋯ f n ( x n ) , {\displaystyle f_{X_{1},\ldots ,X_{n}}(x_{1},\ldots ,x_{n})=f_{1}(x_{1})\cdots f_{n}(x_{n}),}

(where each fi is not necessarily a density) then the n variables in the set are all independent from each other, and the marginal probability density function of each of them is given by

f X i ( x i ) = f i ( x i ) ∫ f i ( x ) d x . {\displaystyle f_{X_{i}}(x_{i})={\frac {f_{i}(x_{i})}{\int f_{i}(x)\,dx}}.}

### Example[edit]

This elementary example illustrates the above definition of multidimensional probability density functions in the simple case of a function of a set of two variables. Let us call  R -> {\displaystyle {\vec {R}}} a 2-dimensional random vector of coordinates (X, Y): the probability to obtain  R -> {\displaystyle {\vec {R}}} in the quarter plane of positive x and y is

Pr ( X > 0 , Y > 0 ) = ∫ 0 ∞ ∫ 0 ∞ f X , Y ( x , y ) d x d y . {\displaystyle \Pr \left(X>0,Y>0\right)=\int _{0}^{\infty }\int _{0}^{\infty }f_{X,Y}(x,y)\,dx\,dy.}

## Function of random variables and change of variables in the probability density function[edit]

If the probability density function of a random variable (or vector) X is given as fX(x), it is possible (but often not necessary; see below) to calculate the probability density function of some variable Y = g(X). This is also called a "change of variable" and is in practice used to generate a random variable of arbitrary shape fg(X) = fY using a known (for instance, uniform) random number generator.

It is tempting to think that in order to find the expected value E(g(X)), one must first find the probability density fg(X) of the new random variable Y = g(X). However, rather than computing

E ⁡ ( g ( X ) ) = ∫ − ∞ ∞ y f g ( X ) ( y ) d y , {\displaystyle \operatorname {E} {\big (}g(X){\big )}=\int _{-\infty }^{\infty }yf_{g(X)}(y)\,dy,}

one may find instead

E ⁡ ( g ( X ) ) = ∫ − ∞ ∞ g ( x ) f X ( x ) d x . {\displaystyle \operatorname {E} {\big (}g(X){\big )}=\int _{-\infty }^{\infty }g(x)f_{X}(x)\,dx.}

The values of the two integrals are the same in all cases in which both X and g(X) actually have probability density functions. It is not necessary that g be a one-to-one function. In some cases the latter integral is computed much more easily than the former. See Law of the unconscious statistician.

### Scalar to scalar[edit]

Let  g : R -> R {\displaystyle g:\mathbb {R} \to \mathbb {R} } be a monotonic function, then the resulting density function is[5]

f Y ( y ) = f X ( g − 1 ( y ) ) | d d y ( g − 1 ( y ) ) | . {\displaystyle f_{Y}(y)=f_{X}{\big (}g^{-1}(y){\big )}\left|{\frac {d}{dy}}{\big (}g^{-1}(y){\big )}\right|.}

Here g−1 denotes the inverse function.

This follows from the fact that the probability contained in a differential area must be invariant under change of variables. That is,

| f Y ( y ) d y | = | f X ( x ) d x | , {\displaystyle \left|f_{Y}(y)\,dy\right|=\left|f_{X}(x)\,dx\right|,}

f Y ( y ) = | d x d y | f X ( x ) = | d d y ( x ) | f X ( x ) = | d d y ( g − 1 ( y ) ) | f X ( g − 1 ( y ) ) = | ( g − 1 ) ′ ( y ) | ⋅ f X ( g − 1 ( y ) ) . {\displaystyle f_{Y}(y)=\left|{\frac {dx}{dy}}\right|f_{X}(x)=\left|{\frac {d}{dy}}(x)\right|f_{X}(x)=\left|{\frac {d}{dy}}{\big (}g^{-1}(y){\big )}\right|f_{X}{\big (}g^{-1}(y){\big )}={\left|\left(g^{-1}\right)'(y)\right|}\cdot f_{X}{\big (}g^{-1}(y){\big )}.}

For functions that are not monotonic, the probability density function for y is

∑ k = 1 n ( y ) | d d y g k − 1 ( y ) | ⋅ f X ( g k − 1 ( y ) ) , {\displaystyle \sum _{k=1}^{n(y)}\left|{\frac {d}{dy}}g_{k}^{-1}(y)\right|\cdot f_{X}{\big (}g_{k}^{-1}(y){\big )},}

where n(y) is the number of solutions in x for the equation  g ( x ) = y {\displaystyle g(x)=y} , and  g k − 1 ( y ) {\displaystyle g_{k}^{-1}(y)} are these solutions.

### Vector to vector[edit]

Suppose x is an n-dimensional random variable with joint density f. If y = G(x), where G is a bijective, differentiable function, then y has density  pY:

p Y ( y ) = f ( G − 1 ( y ) ) | det [ d G − 1 ( z ) d z | z = y ] | {\displaystyle p_{Y}(\mathbf {y} )=f{\Bigl (}G^{-1}(\mathbf {y} ){\Bigr )}\left|\det \left[\left.{\frac {dG^{-1}(\mathbf {z} )}{d\mathbf {z} }}\right|_{\mathbf {z} =\mathbf {y} }\right]\right|}

with the differential regarded as the Jacobian of the inverse of G(⋅), evaluated at y.[6]

For example, in the 2-dimensional case x = (x1, x2), suppose the transform G is given as y1 = G1(x1, x2), y2 = G2(x1, x2) with inverses x1 = G1−1(y1, y2), x2 = G2−1(y1, y2). The joint distribution for y = (y1, y2) has density[7]

p Y 1 , Y 2 ( y 1 , y 2 ) = f X 1 , X 2 ( G 1 − 1 ( y 1 , y 2 ) , G 2 − 1 ( y 1 , y 2 ) ) | ∂ G 1 − 1 ∂ y 1 ∂ G 2 − 1 ∂ y 2 − ∂ G 1 − 1 ∂ y 2 ∂ G 2 − 1 ∂ y 1 | . {\displaystyle p_{Y_{1},Y_{2}}(y_{1},y_{2})=f_{X_{1},X_{2}}{\big (}G_{1}^{-1}(y_{1},y_{2}),G_{2}^{-1}(y_{1},y_{2}){\big )}\left\vert {\frac {\partial G_{1}^{-1}}{\partial y_{1}}}{\frac {\partial G_{2}^{-1}}{\partial y_{2}}}-{\frac {\partial G_{1}^{-1}}{\partial y_{2}}}{\frac {\partial G_{2}^{-1}}{\partial y_{1}}}\right\vert .}

### Vector to scalar[edit]

Let  V : R n -> R {\displaystyle V:\mathbb {R} ^{n}\to \mathbb {R} } be a differentiable function and  X {\displaystyle X} be a random vector taking values in  R n {\displaystyle \mathbb {R} ^{n}} ,  f X {\displaystyle f_{X}} be the probability density function of  X {\displaystyle X} and  δ ( ⋅ ) {\displaystyle \delta (\cdot )} be the Dirac delta function. It is possible to use the formulas above to determine  f Y {\displaystyle f_{Y}} , the probability density function of  Y = V ( X ) {\displaystyle Y=V(X)} , which will be given by

f Y ( y ) = ∫ R n f X ( x ) δ ( y − V ( x ) ) d x . {\displaystyle f_{Y}(y)=\int _{\mathbb {R} ^{n}}f_{X}(\mathbf {x} )\delta {\big (}y-V(\mathbf {x} ){\big )}\,d\mathbf {x} .}

This result leads to the law of the unconscious statistician:

E Y ⁡ [ Y ] = ∫ R y f Y ( y ) d y = ∫ R y ∫ R n f X ( x ) δ ( y − V ( x ) ) d x d y = ∫ R n ∫ R y f X ( x ) δ ( y − V ( x ) ) d y d x = ∫ R n V ( x ) f X ( x ) d x = E X ⁡ [ V ( X ) ] . {\displaystyle \operatorname {E} _{Y}[Y]=\int _{\mathbb {R} }yf_{Y}(y)\,dy=\int _{\mathbb {R} }y\int _{\mathbb {R} ^{n}}f_{X}(\mathbf {x} )\delta {\big (}y-V(\mathbf {x} ){\big )}\,d\mathbf {x} \,dy=\int _{{\mathbb {R} }^{n}}\int _{\mathbb {R} }yf_{X}(\mathbf {x} )\delta {\big (}y-V(\mathbf {x} ){\big )}\,dy\,d\mathbf {x} =\int _{\mathbb {R} ^{n}}V(\mathbf {x} )f_{X}(\mathbf {x} )\,d\mathbf {x} =\operatorname {E} _{X}[V(X)].}

Proof:

Let  Z {\displaystyle Z} be a collapsed random variable with probability density function  p Z ( z ) = δ ( z ) {\displaystyle p_{Z}(z)=\delta (z)} (i.e., a constant equal to zero). Let the random vector  X ~ {\displaystyle {\tilde {X}}} and the transform  H {\displaystyle H} be defined as

H ( Z , X ) = [ Z + V ( X ) X ] = [ Y X ~ ] . {\displaystyle H(Z,X)={\begin{bmatrix}Z+V(X)\\\X\end{bmatrix}}={\begin{bmatrix}Y\\\\{\tilde {X}}\end{bmatrix}}.}

It is clear that  H {\displaystyle H} is a bijective mapping, and the Jacobian of  H − 1 {\displaystyle H^{-1}} is given by:

d H − 1 ( y , x ~ ) d y d x ~ = [ 1 − d V ( x ~ ) d x ~ 0 n × 1 I n × n ] , {\displaystyle {\frac {dH^{-1}(y,{\tilde {\mathbf {x} }})}{dy\,d{\tilde {\mathbf {x} }}}}={\begin{bmatrix}1&-{\frac {dV({\tilde {\mathbf {x} }})}{d{\tilde {\mathbf {x} }}}}\\\\\mathbf {0} _{n\times 1}&\mathbf {I} _{n\times n}\end{bmatrix}},}

which is an upper triangular matrix with ones on the main diagonal, therefore its determinant is 1. Applying the change of variable theorem from the previous section we obtain that

f Y , X ( y , x ) = f X ( x ) δ ( y − V ( x ) ) , {\displaystyle f_{Y,X}(y,x)=f_{X}(\mathbf {x} )\delta {\big (}y-V(\mathbf {x} ){\big )},}

which if marginalized over  x {\displaystyle x} leads to the desired probability density function.

## Sums of independent random variables[edit]

See also: List of convolutions of probability distributions

The probability density function of the sum of two independent random variables U and V, each of which has a probability density function, is the convolution of their separate density functions:

f U + V ( x ) = ∫ − ∞ x f U ( y ) f V ( x − y ) d y = ( f U ∗ f V ) ( x ) {\displaystyle f_{U+V}(x)=\int _{-\infty }^{x}f_{U}(y)f_{V}(x-y)\,dy=\left(f_{U}*f_{V}\right)(x)}

It is possible to generalize the previous relation to a sum of N independent random variables, with densities U1, ..., UN:

f U 1 + ⋯ + U N ( x ) = ( f U 1 ∗ ⋯ ∗ f U N ) ( x ) {\displaystyle f_{U_{1}+\cdots +U_{N}}(x)=\left(f_{U_{1}}*\cdots *f_{U_{N}}\right)(x)}

This can be derived from a two-way change of variables involving Y = U \+ V and Z = V, similarly to the example below for the quotient of independent random variables.

## Products and quotients of independent random variables[edit]

See also: Product distribution and Ratio distribution

Given two independent random variables U and V, each of which has a probability density function, the density of the product Y = UV and quotient Y = U/V can be computed by a change of variables.

### Example: Quotient distribution[edit]

To compute the quotient Y = U/V of two independent random variables U and V, define the following transformation:

Y = U / V Z = V {\displaystyle {\begin{aligned}Y&=U/V\\\\[1ex]Z&=V\end{aligned}}}

Then, the joint density p(y,z) can be computed by a change of variables from U,V to Y,Z, and Y can be derived by marginalizing out Z from the joint density.

The inverse transformation is

U = Y Z V = Z {\displaystyle {\begin{aligned}U&=YZ\\\V&=Z\end{aligned}}}

The absolute value of the Jacobian matrix determinant  J ( U , V ∣ Y , Z ) {\displaystyle J(U,V\mid Y,Z)} of this transformation is:

| det [ ∂ u ∂ y ∂ u ∂ z ∂ v ∂ y ∂ v ∂ z ] | = | det [ z y 0 1 ] | = | z | . {\displaystyle \left|\det {\begin{bmatrix}{\frac {\partial u}{\partial y}}&{\frac {\partial u}{\partial z}}\\\\{\frac {\partial v}{\partial y}}&{\frac {\partial v}{\partial z}}\end{bmatrix}}\right|=\left|\det {\begin{bmatrix}z&y\\\0&1\end{bmatrix}}\right|=|z|.}

Thus:

p ( y , z ) = p ( u , v ) J ( u , v ∣ y , z ) = p ( u ) p ( v ) J ( u , v ∣ y , z ) = p U ( y z ) p V ( z ) | z | . {\displaystyle p(y,z)=p(u,v)\,J(u,v\mid y,z)=p(u)\,p(v)\,J(u,v\mid y,z)=p_{U}(yz)\,p_{V}(z)\,|z|.}

And the distribution of Y can be computed by marginalizing out Z:

p ( y ) = ∫ − ∞ ∞ p U ( y z ) p V ( z ) | z | d z {\displaystyle p(y)=\int _{-\infty }^{\infty }p_{U}(yz)\,p_{V}(z)\,|z|\,dz}

This method crucially requires that the transformation from U,V to Y,Z be bijective. The above transformation meets this because Z can be mapped directly back to V, and for a given V the quotient U/V is monotonic. This is similarly the case for the sum U \+ V, difference U − V and product UV.

Exactly the same method can be used to compute the distribution of other functions of multiple independent random variables.

### Example: Quotient of two standard normals[edit]

Given two standard normal variables U and V, the quotient can be computed as follows. First, the variables have the following density functions:

p ( u ) = 1 2 π e − u 2 / 2 p ( v ) = 1 2 π e − v 2 / 2 {\displaystyle {\begin{aligned}p(u)&={\frac {1}{\sqrt {2\pi }}}e^{-{u^{2}}/{2}}\\\\[1ex]p(v)&={\frac {1}{\sqrt {2\pi }}}e^{-{v^{2}}/{2}}\end{aligned}}}

We transform as described above:

Y = U / V Z = V {\displaystyle {\begin{aligned}Y&=U/V\\\\[1ex]Z&=V\end{aligned}}}

This leads to:

p ( y ) = ∫ − ∞ ∞ p U ( y z ) p V ( z ) | z | d z = ∫ − ∞ ∞ 1 2 π e − 1 2 y 2 z 2 1 2 π e − 1 2 z 2 | z | d z = ∫ − ∞ ∞ 1 2 π e − 1 2 ( y 2 + 1 ) z 2 | z | d z = 2 ∫ 0 ∞ 1 2 π e − 1 2 ( y 2 + 1 ) z 2 z d z = ∫ 0 ∞ 1 π e − ( y 2 + 1 ) u d u u = 1 2 z 2 = − 1 π ( y 2 + 1 ) e − ( y 2 + 1 ) u | u = 0 ∞ = 1 π ( y 2 + 1 ) {\displaystyle {\begin{aligned}p(y)&=\int _{-\infty }^{\infty }p_{U}(yz)\,p_{V}(z)\,|z|\,dz\\\\[5pt]&=\int _{-\infty }^{\infty }{\frac {1}{\sqrt {2\pi }}}e^{-{\frac {1}{2}}y^{2}z^{2}}{\frac {1}{\sqrt {2\pi }}}e^{-{\frac {1}{2}}z^{2}}|z|\,dz\\\\[5pt]&=\int _{-\infty }^{\infty }{\frac {1}{2\pi }}e^{-{\frac {1}{2}}\left(y^{2}+1\right)z^{2}}|z|\,dz\\\\[5pt]&=2\int _{0}^{\infty }{\frac {1}{2\pi }}e^{-{\frac {1}{2}}\left(y^{2}+1\right)z^{2}}z\,dz\\\\[5pt]&=\int _{0}^{\infty }{\frac {1}{\pi }}e^{-\left(y^{2}+1\right)u}\,du&&u={\tfrac {1}{2}}z^{2}\\\\[5pt]&=\left.-{\frac {1}{\pi \left(y^{2}+1\right)}}e^{-\left(y^{2}+1\right)u}\right|_{u=0}^{\infty }\\\\[5pt]&={\frac {1}{\pi \left(y^{2}+1\right)}}\end{aligned}}}

This is the density of a standard Cauchy distribution.

## See also[edit]

* Density estimation – Estimate of an unobservable underlying probability density function
* Kernel density estimation – EstimatorPages displaying short descriptions with no spaces
* Likelihood function – Function related to statistics and probability theory
* List of probability distributions
* Probability amplitude – Complex number whose squared absolute value is a probability
* Probability mass function – Discrete-variable probability distribution
* Secondary measure
* Uses as position probability density:
* Atomic orbital – Function describing an electron in an atom
* Home range – The area in which an animal lives and moves on a periodic basis

## References[edit]

1. ^ "AP Statistics Review - Density Curves and the Normal Distributions". Archived from the original on 2 April 2015. Retrieved 16 March 2015.
2. ^ Grinstead, Charles M.; Snell, J. Laurie (2009). "Conditional Probability - Discrete Conditional" (PDF). Grinstead & Snell's Introduction to Probability. Orange Grove Texts. ISBN 978-1616100469. Archived (PDF) from the original on 2003-04-25. Retrieved 2019-07-25.
3. ^ "probability - Is a uniformly random number over the real line a valid distribution?". Cross Validated. Retrieved 2021-10-06.
4. ^ Ord, J.K. (1972) Families of Frequency Distributions, Griffin. ISBN 0-85264-137-0 (for example, Table 5.1 and Example 5.4)
5. ^ Siegrist, Kyle. "Transformations of Random Variables". LibreTexts Statistics. Retrieved 22 December 2023.
6. ^ Devore, Jay L.; Berk, Kenneth N. (2007). Modern Mathematical Statistics with Applications. Cengage. p. 263\. ISBN 978-0-534-40473-4.
7. ^ David, Stirzaker (2007-01-01). Elementary Probability. Cambridge University Press. ISBN 978-0521534284. OCLC 851313783.

## Further reading[edit]

* Billingsley, Patrick (1979). Probability and Measure. New York, Toronto, London: John Wiley and Sons. ISBN 0-471-00710-2.
* Casella, George; Berger, Roger L. (2002). Statistical Inference (Second ed.). Thomson Learning. pp. 34–37. ISBN 0-534-24312-6.
* Stirzaker, David (2003). Elementary Probability. Cambridge University Press. ISBN 0-521-42028-8. Chapters 7 to 9 are about continuous variables.

## External links[edit]

* Ushakov, N.G. (2001) [1994], "Density of a probability distribution", Encyclopedia of Mathematics, EMS Press
* Weisstein, Eric W. "Probability density function". MathWorld.

* v
* t
* e

Theory of probability distributions

* probability mass function (pmf)
* probability density function (pdf)
* cumulative distribution function (cdf)
* quantile function

* raw moment
* central moment
* mean
* variance
* standard deviation
* skewness
* kurtosis
* L-moment

* moment-generating function (mgf)
* characteristic function
* probability-generating function (pgf)
* cumulant
* combinant

*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template