Let be a nonnegative integer-valued random variable, and let be nonnegative integer-valued independent and identically distributed random variables, with common probability generating function . Require the whole sequence to be independent of , so are jointly independent. Set the random sum
with the empty sum equal to zero. Given , the probability generating function of an independent sum yields the conditional expectation . By the law of total expectation,
The composition is valid because . Merely making the independent of each other does not preserve their conditional laws when depends on them. This is the probability generating function version of transform composition for an independent random sum.
For a Poisson distribution count with mean , substitution into gives a compound Poisson distribution with
If the jumps have finite second moment, conditioning also gives mean and variance . The extra spread comes from randomness in the count as well as randomness in the jumps.[ref]
For an original example, choose and jumps taking values one and two with equal probability. Keep the independence assumptions above. Then
Here , , and . The law of total expectation and law of total variance give
Thus the aggregate is not itself a Poisson distribution, whose mean and variance would coincide.
To recover the probability mass function without repeated differentiation, use and compare coefficients:
For example, . As an independent check, expanding gives
Figure 1.
A random number of one-or-two jumps gives a compound Poisson count
. The upper diagram separates the Poisson distribution count, the independent and identically distributed jumps, and their random sum. Below are calculated coefficients of for , with the omitted tail probability reported explicitly. They are exact model probabilities evaluated numerically, not observed data; the displayed masses have not been renormalized. Details.
The plotted probability masses stop at 20, although the support of a probability distribution is unbounded. The omitted tail probability is
This model has bounded jumps and an unbounded count. Its entire probability generating function does give a finite moment-generating function at every real argument, but the general random sum composition only guarantees the stated domain.
For nonnegative integer-valued independent random variables , factor the expected value of a product:
The Cauchy product explains what this means for individual probability masses:
Every way of splitting the total contributes once. This is convolution of independent random variables; multiplying probability generating functions performs the bookkeeping automatically.
For an original example, take independent and , using the Bernoulli distribution and binomial distribution. Then
so
Direct enumeration of the six pairs gives the same probability masses. For example, total one collects and , with contributions . The coefficients sum to one. The expected value is ; since , the variance is , agreeing with .
Figure 1.
Multiplying probability generating functions accounts for every pair with the same total
. The six cells give the exact joint probability mass function for the chosen independent Bernoulli distribution and binomial distribution. Colors group equal totals; the stacked bars collect their contributions to the coefficients of the product probability generating function. These are calculated model probabilities. Details.
Uncorrelated random variables are insufficient for the product identity. For a concrete counterexample, let be uniform on and set , . Then , but , whereas . Zero covariance controls one mixed moment, not the full joint probability mass function.
Probability inequality Created 2026-09-24 Updated 2026-10-18
Probability inequalities bound event probabilities from limited information, such as moments, without requiring a complete probability distribution. Markov's inequality uses a nonnegative random variable's expected value; Chebyshev's inequality uses a variance to bound deviations from a mean. The attraction is a guarantee that applies to many possible probability distributions. Their bounds can be conservative for a particular model, and distributions attaining equality show when the available information really cannot give more.
For , put probability mass at zero and at each of and . This symmetric probability distribution has mean zero. Its second and fourth moments are both , because the nonzero outcomes have square and fourth power equal to one:
For the kurtosis is ; for it is . In the latter case of the probability mass is at zero, yet all of the fourth central moment comes from the remaining . The standard score takes values and , with variance one. Each nonzero outcome contributes
to kurtosis. At , the two rare outcomes are ten standard deviations from the mean, and their contributions are .
Figure 1. . The left panels keep the original support of a probability distribution ; the right panels use standard scores. A rare outcome can have small probability mass but a large contribution to kurtosis. Each row is a different specified probability distribution, not a statistical sample. Details.
Every member has finite support of a probability distribution, so all its moments are finite. Nevertheless, kurtosis becomes arbitrarily large as approaches zero: high kurtosis does not require an unbounded support of a probability distribution or a heavy-tailed distribution. At the variance vanishes and kurtosis is undefined. At this discrete probability distribution even has the normal distribution value and excess kurtosis zero, so those values do not establish a normal distribution.
Write , , and . Apply the Poisson size-bias identity with , and expand using the binomial theorem and independence. A finite th severity moment suffices. In particular, the aggregate expected value, variance, and third central moment are , , and , respectively; the latter two use raw severity moments.
Second moment Created 2026-10-05 Updated 2026-10-06
The second moment of a real random variable is . Its variance is when these quantities are finite.
Skewness 2026-10-05
Skewness is the standardized third central moment of a probability distribution. A symmetric distribution with finite third moment has zero skewness. Cosmology also uses the reduced skewness , which differs from the standardized skewness by a factor of .
A finite nonzero Saffman integral gives in the standard isotropic spectrum normalization. This follows by expanding the radial spectral transform at small wavenumber. A further analytic term requires additional correlation moments.
The space-time Probabilists' Hermite polynomial extends polynomially to and solves . Therefore is a martingale for a standard Brownian motion, by the Itô formula and Gaussian moments.
Square-integrable function Created 2026-10-05 Updated 2026-10-14
A measurable function is square-integrable when the integral of its squared absolute value is finite. Its equivalence class belongs to the L2 space; on a probability space, this means a finite second moment.
Statistical path 2026-10-07
A statistical path is a one-dimensional family of probability measures inside a statistical model, passing through a specified baseline . A differentiability in quadratic mean condition gives its score function, the first-order direction of the family in square-root-density coordinates. The path must respect all restrictions of the statistical model, including normalization and any fixed moments.
A function into a Banach space is strongly measurable if, outside a null set, it is a pointwise norm limit of measurable simple functions. A measurable function with values in a separable Banach space is strongly measurable: approximate values by a countable collection of balls of shrinking radii and then truncate the resulting countably valued approximants to simple functions. A strongly measurable function is Bochner integral integrable exactly when its norm is integrable. Finite second moments under a probability measure therefore imply existence of its Bochner integral expected value by the Cauchy-Schwarz inequality.
Student's t-distribution Created 2026-09-29 Updated 2026-10-20
The Student's t-distribution describes a standard normal random variable divided by an independent estimate of its scale. For any real , let have the standard normal distribution and let have the chi-squared distribution, with and independent. Then
The parameter is called the number of statistical degrees of freedom. It need not be an integer: the chi-squared distribution is a gamma distribution with shape and rate . The independence assumption is essential; specifying only the two marginal distributions does not determine the probability distribution of their ratio.
Its probability density function on the whole real line is
where is the gamma function. Every member is a symmetric distribution about zero. At it is the Standard Cauchy distribution; as it approaches the standard normal distribution. The essential shape change is the tail: at any fixed finite , decays like a constant times , much more slowly than the standard normal density's exponential decay. Thus it is a heavy-tailed distribution. [ref]
The left panel shows the centers; the right panel uses a logarithmic scale to reveal the tails that a linear plot hides. All four curves have location zero and scale one. They do not have the same variance: the curve has no finite mean or variance, whereas has variance 3 and has variance .
More generally, the absolute moment for is finite exactly when , as follows by comparing the tail integrand with . Consequently
For there is no finite mean; symmetry alone cannot supply one. For the mean exists but the variance is infinite. For even the centered definition of variance is unavailable because the mean does not exist.
A shifted and scaled version , , has probability density function . The scale is not its standard deviation: for ,
For example, and scale give standard deviation , rather than 2. The distinction matters when using a Student's t-distribution to model data with occasional extreme values, as well as when interpreting a Student t confidence interval.
Tail-sum formula Created 2026-09-24 Updated 2026-10-18
The tail-sum formula expresses an expected value as the area under a survival function. For every nonnegative random variable ,
This Lebesgue integral and the expected value may both be ; a probability density function is unnecessary. For a random variable taking values in the nonnegative integers, the corresponding sum is
The events and coincide because takes integer values. Thus the strict sum starts at zero, while the inclusive sum starts at one.[ref]
For an original example, let the probability mass function of be
Its expected value computed directly is . The strict tail probabilities at thresholds are : their sum is again . There is no probability mass at two, yet the event still has probability . The survival function has heights on the successive intervals ; each interval has length one, so its integral is the same sum.
Figure 1.
The same expected value from probability masses and survival columns
. The exact constructed probability mass function assigns to . The contribution appears in one survival column, while the contribution appears in three. Filled endpoints give the strict survival function at its jumps; open endpoints show the preceding height. The shaded area is . Details.
The indexing matters numerically. Starting the inclusive sum at zero adds , giving for this example. Starting the strict sum at one omits , giving . For a general nonnegative random variable, replacing with inside the integral is harmless: the difference is , nonzero at only a countable set of thresholds. For each positive integer , at most thresholds can have probability mass at least ; their countable union contains all thresholds with positive probability mass and has Lebesgue measure zero. This reasoning concerns an integral, not equality of the two survival function conventions at every point.
For a continuous original example, take the uniform distribution on the interval . Its survival function is for and zero for . The area is a triangle of base four and height one:
Directly integrating against the probability density function gives the same expected value, . The integral of the probability density function alone is one; it is the survival function whose area is the expected value.
Figure 2.
A uniform density has total probability one and survival area two
. Exact curves for the uniform distribution on . The probability density function has integral one, while the survival function has integral two. Splitting the survival area at gives before the cap and beyond it, the expected values of and the positive part , respectively. Details.
The proof counts layers of each outcome. For a realized value , the indicator function equals one over an interval of length , so
Tonelli theorem permits the interchange because the indicator function is nonnegative; no finite expected value is assumed. Similarly, an outcome contributes one indicator random variable for each of the events that occur:
Again Tonelli theorem applies to the nonnegative sum, or equivalently the monotone convergence theorem applies to its partial sums. This exchanges counting layers within each outcome with averaging across outcomes. The existing integer-valued hypothesis in the tail-sum formula explains what changes when the values are not integers; the tail integral formula for moments weights the layers to obtain higher moments.
For an integrable random variable that can have either sign, apply the nonnegative formula separately to its positive part and negative part :
Integrability makes both integrals finite. More generally the difference defines an extended expected value when at least one is finite; if both are infinite, subtraction does not define an expected value.[ref]
Tail probabilities are often easier to measure or bound than a whole probability density function. For a device's survival time, the survival function records the probability of still operating at each threshold; its integral gives the mean operating time. A finite observation window naturally gives the expected value of a capped nonnegative random variable. For a mathematical bound, for all implies . The tail-sum formula turns control of a whole family of events into control of an average.
Tangent of a uniform angle has a Cauchy distribution Created 2026-10-18 Updated 2026-10-20
If and has the continuous uniform distribution on , then has the Cauchy distribution with location zero and scale . The tangent function is strictly increasing on this interval, so its cumulative distribution function is
Differentiating gives the probability density function . The probability of either endpoint is zero, so including endpoints in the uniform interval does not alter this probability distribution. The slow quadratic decay makes the expected value undefined: its positive and negative parts both have infinite integrals. Its second moment is also infinite, so it has no finite standard deviation.
Let be independent random variables, each with the Bernoulli distribution of parameter , and let . Multiplying their characteristic functions and expanding by the binomial theorem gives
The coefficients are exactly the probability mass function of the binomial distribution with parameters : the sum takes with probabilities . Direct outcome counting verifies them: an outcome with ones has probability , and there are such outcomes. The coefficients sum to one, recovering .
At , . This is also : the complex exponential now records parity. The moments agree by two routes: linearity of expectation gives , while the variance of a sum of independent random variables gives . Summing gives the second moment , also recovered as .
Figure 1.
Independent products and the different limits of averages and variance-normalized sign sums
. Top: exact real parts and imaginary parts of and its cube, the characteristic function of the three-variable binomial distribution. Bottom: for independent symmetric signs, approaches one under averaging, whereas approaches under variance normalization. All curves are exact model formulas; the finite curves illustrate the two limits rather than proving a general central limit theorem. Details.
Approximate a compound Poisson distribution of positive claims by a shifted gamma distribution whose first three cumulants agree. Here are raw severity moments, while the compound cumulants are . Solve , , and to obtain the displayed parameters. The approximation captures positive skewness, but not the atom at zero. Its shift can be negative; with exponential claims of mean it is . Matching three cumulants alone supplies no general tail-error bound.
Turbulence closure 2026-10-14
A turbulence closure approximates the unclosed higher-order moments in evolution equations for lower-order turbulent statistics. For example, an equation for the velocity correlation tensor involves triple correlations, whose evolution involves fourth-order correlations and pressure. A closure must be checked against conservation laws, realizability and boundary conditions; matching an energy spectrum alone does not establish all these properties.
Stipulate an original Gaussian mixture distribution with mixture weights , , component means , , and component variances both equal to one. These are chosen statistical parameters, with no observed sample or fitting. If is the standard normal distribution probability density function, then
In the figure, the two colored curves are weighted probability density functions, with areas and . Adding their heights at every gives the black curve. Neither colored curve stops at a dividing line.
Figure 1.
Stipulated two-Gaussian mixture: weighted component densities and their sum
. Original analytic curves for component means and , component variances one, and mixture weights and . No observed points, histogram, or fitted parameters are used. Details.
The law of total expectation and law of total variance give the total mean and variance:
All of the extra variance comes from variation between component means. Equivalently, the second moment is , so the variance is .
A mixture distribution is different from a deterministic linear combination of random variables. If independent and are drawn and , then has a normal distribution with the same mean but variance , rather than . Every draw of uses both random variables. A draw from the mixture distribution instead uses , where the mixture allocation indicators are independent of and select exactly one of them. The expression for adds densities, not simultaneous random outcomes.
Uniform order statistic Created 2026-09-28 Updated 2026-10-14
For independent and identically distributed random variables with the continuous uniform distribution on , the th order statistic has Beta distribution
Its probability density function, mean, and variance are
The probability density function is zero outside ; values assigned to its endpoints do not change any probability. Peter Kempthorne's MIT lecture notes derive the uniform order statistic law and these moments. [ref].
For , the minimum, sample median, and sample maximum correspond to . Their probability density functions are , , and , respectively. The sample median therefore has Beta distribution , mean , and variance . Its cumulative distribution function is
For instance, . The mean of the minimum is , and the mean of the sample maximum is . The fixed observed sample median in the order statistic example is one possible outcome; is the average over repeated statistical samples from this uniform distribution.
Figure 1.
Minimum, median, and maximum densities for five independent uniform observations
. Details.
Each curve has area one. The extreme order statistics favor the ends, while the sample median favors the center. The endpoint density height is legitimate: the probability density function gives area per unit length, rather than point probability. In particular, a continuous uniform distribution has zero probability of producing an endpoint.
For a short proof, the binomial distribution counting identity under order statistic gives . Taking its derivative cancels consecutive terms, leaving the displayed probability density function. Recognize its normalizing factorial coefficient as that of the Beta distribution, then substitute , into the Beta distribution mean and variance formulas. Although the original observations are independent, their order statistics generally are dependent; see the positive covariance of two uniform order statistics.