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.
Surrogate Hamiltonian Monte Carlo uses an auxiliary smooth probability density function to generate trajectories but applies a Metropolis–Hastings acceptance probability using the intended target . For Gaussian momenta and an involutive Metropolis proposal generated by flipped leapfrog integration, the acceptance probability is . Only the surrogate gradient is required during the trajectory; target density evaluations are still required at the endpoints.
In the classical risk model with premium rate and claim Poisson process rate , the first-claim decomposition for survival probability implies the displayed equation for ultimate survival probability. Change the first-claim integral to an integral over available capital and differentiate its lower limit. The bounded survival probability function convolved with the integrable claim probability density function is continuous, so this also establishes the needed differentiability. In particular .
A switching-current distribution of a Josephson junction records the bias electric current at the first detected transition to a sustained nonzero electric potential difference. Interpret it using a stipulated monotone ramp , a reproducible initial trapped state, and an instantaneous escape hazard function . Neglect retrapping and readout delay. The survival function obeys , so changing variable from time to electric current gives
Here is a probability density function per unit electric current, not a rate per unit time. Division by the surviving population is essential: only trials still trapped can escape. A typical switching current is consequently not identical to the noiseless superconducting critical current.
Figure 1.
From trapped phase to a voltage event and an escape probability
. Original functional readout model and chosen constant-rate calculation. Boxes represent functions rather than historical wiring. The plotted survival function and switching probability density function assume and with perfect event detection and no retrapping; they are not experimental traces. Details.
For an independent illustrative check, choose constant and . Then
Half the trials have switched after , corresponding to of ramp. Doubling doubles the mean increment without changing the underlying escape rate. Real junction rates vary sharply with bias; this example isolates the statistical conversion.
Repeating the preparation, measuring the ramp, resolving the voltage onset, and allowing cooling after each dissipative event are prerequisites for this interpretation. Missed events, finite detection delay, changing temperature and retrapping alter the measured distribution. Even a correctly reconstructed rate needs the independent thermal and spectral checks before identifying its escape mechanism.
Tail probability Created 2026-10-03 Updated 2026-10-14
For a real random variable , an upper-tail probability has the form and a lower-tail probability has the form . Each is the probability of an event lying beyond a chosen threshold in one direction. A tail probability need not be small: the threshold determines how much of the probability distribution it includes. A concentration inequality bounds such probabilities, often for deviations from an expected value.
Endpoint conventions matter. Write for the cumulative distribution function and . The complement rule of probability gives four distinct formulas:
The strict upper-tail convention is the survival function . Its value differs from the inclusive upper tail probability by exactly the probability mass at the threshold:
A singleton with positive probability mass is an atom of a measure. Thus excludes an atom of a measure at , whereas includes it. These endpoint identities follow directly from the cumulative distribution function properties in Kyle Siegrist, Distribution and Quantile Functions: endpoint probabilities and right tails.
As the threshold increases, both upper tail probabilities are nonincreasing functions. The strict survival function is a right-continuous function; the inclusive upper tail probability takes the upper endpoint value at a downward jump, equal to the left limit of the survival function. Both tend to zero as for a real random variable, but the speed of that decay differs across probability distributions. The cumulative distribution function properties and their proof from continuity of probability measures are given in MIT 6.436J, Lecture 4: random variables and cumulative distribution function properties.
For a fair six-sided die , the discrete uniform distribution assigns probability mass to each of . At threshold four,
Between four and five, both upper tail probabilities equal . At the largest possible outcome the distinction is especially visible: , but . The diagram shows exact probabilities for this mathematical model; its dots specify which endpoints belong to each step function.
Figure 1.
Exact fair-die probabilities: including or excluding a threshold changes the tail by one atom
. Details.
If a probability distribution has a probability density function , then every singleton has zero probability mass and
For an exponential distribution of rate two, for and zero otherwise, so for and for . Hence . This tail probability is an integral of the probability density function, not its height . A mixed probability distribution retains endpoint jumps even with a smooth component: give zero probability mass and choose this exponential distribution with probability . Then , , and for .
A two-sided tail probability can measure the absolute value of displacement from a specified center . For , the two extreme events are disjoint events, so
For strict displacement , replace the last expression by . The condition prevents overlap; at adding inclusive tails double-counts any probability mass at . For a uniform distribution on , take and : the two tail probabilities are each and their sum is . Equal tails follow from this symmetric probability distribution, not from the phrase two-sided alone; for a uniform distribution on with , the two tail probabilities are zero and .
The tail-sum formula for expectation turns a whole curve of tail probabilities into an expected value. For any nonnegative random variable , without assuming a probability density function or a finite expected value,
For a proof outline, write pointwise and exchange the expected value and Lebesgue integral using Tonelli theorem; is an indicator function. The inclusive version has the same Lebesgue integral: positive probability masses occur at only a countable set of thresholds, which has Lebesgue measure zero. For a nonnegative integer-valued random variable , the tail-sum formula instead gives . The integer hypothesis is essential for these sums. The integral identity, its indicator function proof, and the integer version appear in Kyle Siegrist, Additional Properties of Expected Value: integration and summation of right tails.
For the fair die, this tail-sum formula yields , equal to the direct weighted arithmetic mean . For the rate-two exponential distribution, the area under the survival function is , its expected value. The first panel below shades an integral of the probability density function for a single threshold; the second shades an integral of the survival function across all nonnegative thresholds. These are analytical illustrations, with the displayed curves truncated at three; their exact total areas use an infinite integration range.
Figure 2.
Exponential model: one tail probability is density area, while expectation is total survival area
. Details.
Nonnegativity is essential to interpreting the upper tail probability area as : for a general real random variable that area equals the expected value of its positive part. An integrable random variable satisfies , subtracting the expected value of its negative part; infinite terms cannot be canceled. Even when is finite almost surely, its expected value can be infinite. For the shape-one Pareto distribution on , on and for , so the area is . The finite versus infinite expected value distinction is illustrated in Kyle Siegrist, Definitions and Basic Properties: exponential and Pareto expected values.
Why are tail probabilities useful? They answer threshold questions directly, and a concentration inequality can bound them without knowing the full probability distribution. For nonnegative with finite expected value, Markov inequality gives for : a large threshold relative to the expected value forces rarity. The quantile function reverses the question by choosing a threshold for a prescribed cumulative level. If with , then ; an atom of a measure may prevent equality. For the die, , with strict upper tail probability zero and inclusive upper tail probability .
A tail probability describes rarity under a specified probability distribution; it is not automatically a conditional probability after extra information. For with ,
because the threshold events are nested. Thus the die has but . Conditioning changes the sample space and renormalizes its probability measure; the same extreme outcomes can become common in that restricted population.
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.
A bead in a liquid keeps undergoing Brownian motion even when an optical trap holds its average position fixed. For a stationary harmonic optical trap in thermal equilibrium at absolute temperature , the equipartition theorem assigns mean potential energy to this one quadratic coordinate. With the Boltzmann constant and at equilibrium,
At the same temperature, quadrupling the spring constant divides the position variance by four and the standard deviation by two. The Boltzmann factor gives the complete equilibrium probability density function, a Gaussian distribution:
The prefactor makes ; its second moment is . The probability density function has units of inverse length, and its area gives probability. This density is exact for the ideal quadratic model. In a finite optical trap it approximates the occupied well when thermal excursions remain within the harmonic region and escape is negligible during observation. Driven motion, appreciable nonconservative forces or laser heating need not give this equilibrium density.
Figure 1.
Thermal force calibration model: exact Gaussian position densities for relative trap stiffnesses 1, 2 and 4 at a common temperature
. Details.
Here , and . The plotted density per unit is . Each curve has total area one; their dimensionless standard deviations are , and . The curves are exact model densities, not noisy experimental data.
Brownian motion becomes a measuring tool: a calibrated position measurement supplies , and the known temperature supplies . Once is known, a slowly applied constant external force shifts the mean by , so in the same harmonic range. Fluctuations therefore calibrate the conversion from displacement to force. Svoboda and Block used this equipartition theorem method when calibrating their bead traps. [ref].
For the example stiffness and , and . Using a variance measured in uncalibrated detector units would not determine that physical stiffness. Measurement noise, finite exposure time, drift and insufficient sampling of the correlated Brownian motion can bias the estimate; record positions over many optical trap relaxation times and account for the detector response. The deterministic relaxation curve above describes relaxation without thermal forcing; an individual thermal trajectory continues to fluctuate.
Suppose a probability density function and its third derivative are bounded. A square-integrable unit-integral kernel for density estimation with first two moments zero and has bias of a kernel density estimator at most , by Taylor theorem with Lagrange remainder and moment cancellation. Independence gives variance at most . The Cauchy-Schwarz inequality bounds the expected centred absolute deviation by the square root of this variance. Adding the bias proves the inequality uniformly in . The choice gives expected absolute error .
Combine the two massless neutrinos in into . In the parent rest frame, four-momentum conservation gives
The lower bound follows from the nonnegative Minkowski norm of the sum of two future-directed null four-vectors; the upper bound follows from . Substituting gives the displayed energy bounds. They are kinematic: they do not specify the weak interaction decay amplitude or the probability density function inside the interval.
If the charged daughter is also massless, put . A parent with Lorentz factor and speed in natural units produces
Here is the daughter angle relative to the boost direction in the parent rest frame. Two opposite parent momenta therefore need not produce two opposite visible daughter momenta: the invisible system can recoil differently in each particle decay.
Consider the probability mass functions and on the finite set . Their difference is . Thus
The event attains this difference: and . Combining and gives the same absolute discrepancy with the opposite sign. Adding to either event changes nothing, because its probability mass agrees under both probability distributions.
Figure 1.
Total variation distance as the largest event discrepancy
. An illustrative four-outcome example. The positive and negative excesses each total ; summing both without the factor counts the same redistribution twice. Details.
The factor is necessary because : every unit of excess probability mass must match a unit of deficit. For any event, including a negative term cannot increase its signed discrepancy, while omitting a positive term cannot increase it either. Therefore attains the positive maximum. This is a short way to compute an apparent optimization over subsets using one pass through .
For probability density functions relative to the same measure , the corresponding identity is . Such densities can always be taken as Radon-Nikodym derivatives relative to . Beware the notation: the total variation norm of a measure applied to the signed measure equals . A formula using that norm without its factor is using a different normalization.
To minimize over models with different parameter dimensions, sample from a target proportional to and cool . A dimension-matching proposal augments the smaller model by auxiliary variables, transforms them bijectively into the larger parameter vector, and includes the proposal probability density function and absolute Jacobian determinant in the Metropolis–Hastings acceptance probability. For a positive Poisson mean and normal parameters , one convenient transformation is
Its absolute Jacobian determinant is one. If the forward and reverse model-jump selection probabilities are and , the Poisson-to-normal ratio is
The reverse ratio is its reciprocal at the inverse map. This enforces detailed balance. When the target is proper and the annealing chain explores it adequately, the low-temperature laws concentrate on the minimum Akaike information criterion, rather than the maximum marginal model evidence. Likelihoods compared across models must describe the same observed data with a compatible reference measure.
Transition density 2026-10-25
A probability density function for the conditional future state of a Markov process given its current state. Integrating over a measurable region gives its transition probability. A transition kernel need not admit a density; discrete or partly atomic transition laws require a different reference measure or a separate atomic part.
Triangular distribution 2026-10-14
A triangular probability density function rises linearly from zero at to its mode , then falls linearly to zero at . Its peak is . Its inverse transform sampling rule is for , and otherwise.
For nonoverlapping triangular sea-ice pressure ridges with a common along-track side slope , a ridge whose peak exceeds contributes of track length in a draft interval . Summing over peaks proves the identity. Above the cutoff of an exponential ridge-draft model, with . This draft occupation is not the normalized peak probability density function; level ice and shallower parts supply the remaining probability.
Condition an exponential distribution of rate on falling below . Normalizing its probability density function gives the displayed density. Integration gives expectation . As , the density tends to the uniform distribution on and the expectation tends to .
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 distribution with an atom at zero Created 2026-10-18 Updated 2026-10-20
For and , this mixed probability distribution has probability mass at zero and ordinary probability density function on . That ordinary density integrates to , not to one; conditioned on , the law is the uniform distribution on . Its cumulative distribution function is zero for , for , and one for .
For each positive integer , integration gives . Thus the expected value is and the variance is . The nonzero atom contributes to normalization even though it contributes zero to positive moments. At , conditioning on positive delay is undefined because the conditioning event has probability zero.
For , the maximum of on occurs at . If one parameter is one, the maximum is attained at the corresponding endpoint; if both are one, is constant. Let . Accept an independent uniform distribution proposal when another uniform draw is at most . The accepted probability density function is the beta distribution, and acceptance probability is .
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.