Rademacher distribution Created 2026-09-24 Updated 2026-11-05
Random affine recursion 2026-10-31
A random affine recursion updates a real random variable by . Assume the coefficient pairs are independent and identically distributed random variables, independent of the initial value. The two coordinates within a pair may be dependent. Fresh coefficients make the recursion a time-homogeneous Markov process: its next conditional distribution depends on the current value alone.
The competition between the random multiplier and the fresh input determines whether initial conditions are forgotten. A synchronous coupling makes this particularly visible by using the same coefficient sequence for two initial values.
Random element Created 2026-10-14 Updated 2026-10-14
A random element is a measurable function from a probability space to a measurable space . Its law is the pushforward measure for . Real-valued random variables and vector-valued random variables are examples; a stochastic sample path can also be a random element when its path-space sigma-algebra is specified. For a Polish space , the usual choice is its Borel sigma-algebra. A large deviation principle concerns the laws of a family of such random elements.
Random field Created 2026-10-14 Updated 2026-11-05
A Random field is a family of random variables indexed by points of a spatial domain, or more generally by a multi-dimensional parameter set. When second moments are finite, its componentwise covariance function and spectral tensor describe second-order dependence. A Gaussian random field has jointly Gaussian finite-dimensional distributions; a general Random field need not be Gaussian.
Random matrix Created 2026-10-07 Updated 2026-11-05
A random matrix is a matrix whose entries are random variables. Its eigenvalues form a random configuration, and its empirical spectral measure records their distribution with equal mass on each eigenvalue. Entry assumptions and normalization determine the spectral regime.
Random measure 2026-10-05
A random measure assigns a measure to each outcome so that is a random variable for every measurable . A finite-variation process gives pathwise signed random measures through Lebesgue–Stieltjes integration.
Random sum 2026-10-14
A random sum has a random number of summands, usually with a nonnegative integer-valued random variable. The empty sum is zero. The dependence between and the summands must be stated; independent summands do not by themselves imply independence from .
Random variable Created 2026-09-24 Updated 2026-10-14
A real-valued random variable is a measurable function from a probability space to the real numbers with their Borel sigma-algebra. More general targets give random elements. For every Borel set , measurability ensures that is an event, so the question "does the observed value lie in ?" has a defined probability.
The function is fixed; its input outcome is uncertain. This separates what we measure from how the uncertainty is modeled. A probability distribution is the resulting pushforward measure, . A cumulative distribution function, probability mass function, or probability density function describes that measure in an appropriate setting. The random variable and its probability distribution are different objects: the former also retains its relationship to other measurements on the same sample space.
For two independent uniform dice, let record their results and define and . The 36 ordered pairs are equally likely, but the resulting probability mass functions differ:For the sum, count the diagonal of the outcome grid having total . For the maximum, subtract the pairs with both results below from the pairs with both results at most . These examples show how a deterministic function transforms a simple input probability distribution into a nonuniform output one.
The corresponding expected values are and . The first follows immediately from linearity of expectation; the second follows from . Neither number must be an attainable result. An expected value describes an average under the probability measure, not a prediction that the next observation will equal it.
The distinction between a random variable and its probability distribution matters for dependence. and have the same discrete uniform distribution and are independent random variables. and a second copy of also have that same marginal probability distribution, but they always agree. Their joint probability distribution is concentrated on the diagonal; the marginals alone cannot say which relationship holds. This is why a model for several measurements must specify their joint law or an appropriate independence assumption.
Indicator random variables turn events into numbers: equals one on and zero elsewhere, and . This connects event counting with expected value and variance, and lets tools for random variables answer questions about probabilities. More complicated functions of observations can describe totals, waiting times, or estimation errors using the same framework.
Random vector Created 2026-09-24 Updated 2026-11-05
A random vector is a measurable map from one probability space to , equivalently a tuple of real random variables defined on the same space. Its joint probability distribution contains their dependence information. For example, if is a fair Bernoulli random variable, takes only and , whereas two independent fair Bernoulli coordinates take all four pairs. Both have identical coordinate marginal distributions. A mean vector and covariance matrix summarize the first two moments when finite but generally do not determine the whole law.
Take independent random variables equal to and with probability each, and otherwise equal to one. Their first absolute deviations are , so in L1 convergence. The same triangle-inequality argument gives convergence in of their arithmetic averages to one. For , however, .
The exceptional jumps occur infinitely often almost surely by the Borel-Cantelli second lemma, since . If the arithmetic averages converged to any finite value along a sample path, then would tend to zero. At each exceptional jump its magnitude is at least one. Thus the averages have no finite almost sure limit. Independence and convergence of first-moment averages do not alone give a strong law of large numbers.
Raw moment 2026-10-20
Rayleigh distribution Created 2026-10-06 Updated 2026-10-18
The Rayleigh distribution is the probability distribution of the Euclidean norm of a two-dimensional random vector with independent zero-mean normal random variables of equal variance as components. If are independent, thenHere is the standard deviation of each component, not of the radius . At this gives the unit-scale probability density function .[ref]
The Rayleigh Distribution. Random: Probability, Mathematical Statistics, Stochastic Processes by Kyle Siegrist; The General Rayleigh Distribution, Definition and Distribution Functions: independent equal-scale centered normal components and radial density
This geometry turns two signed errors into one nonnegative distance. For example, suppose horizontal and vertical positioning errors are independent random variables. Their means both vanish, but the distance from the intended point is usually positive. The Rayleigh distribution with gives the probability of landing inside any centered disk. These are chosen model assumptions, rather than measurements of a particular instrument.
An apparently paradoxical feature is that the most likely location per unit area is the origin, while the radial mode is . A narrow annulus farther out has more area. Near zero that growing circumference outweighs the falling planar density; farther out the exponential function wins. Distinguishing densities measured against different elements of area or length resolves the paradox.
Recycling a uniform random variable after discrete sampling Created 2026-10-06 Updated 2026-11-05
For positive mixture weights summing to one, set and choose when , where has a uniform distribution. Then has a uniform distribution independently of : for , . This permits exact finite mixture model sampling with a recycled continuous random variable.
Regular conditional distribution Created 2026-10-14 Updated 2026-10-25
A regular conditional distribution of a random variable given is a Markov kernel such that, for all measurable sets ,For each , is a probability measure; for each , is measurable. Thus it assigns an actual probability distribution to a specified observation even when . Such kernels exist for standard Borel state spaces, including real-valued variables, and their uniqueness is only up to -null sets. With a joint density and positive marginal density, the ratio of the two densities defines the usual conditional density kernel. Values outside the marginal support or on a null set are not uniquely determined by the joint law.
Relative variance 2026-11-05
For a random variable with finite variance and nonzero mean, its relative variance is . It equals the square of the coefficient of variation under the usual positive-mean convention. Multiplying by a nonzero constant leaves unchanged; adding a constant generally does not.
For an average of independent identically distributed observations with mean and variance , the relative variance is . Chebyshev's inequality gives , explaining its role in self-averaging. At zero mean the ratio is undefined, so another reference scale is needed.
Reparameterization gradient Created 2026-10-06 Updated 2026-10-25
A reparameterization gradient differentiates an expected value by representing the simulated random variable as a differentiable transformation of parameter-independent noise. For , the identity requires justified differentiation under the integral sign. For a normal distribution, use with drawn from the standard normal distribution.
Reverse Fatou lemma 2026-10-31
If are random variables bounded above by an integrable function , with all relevant expectations well defined, Fatou's lemma applied to the nonnegative variables gives . In particular, bounded indicator random variables that tend almost surely to zero have probabilities tending to zero.
Sample path Created 2026-10-06 Updated 2026-10-14
For a stochastic process and a fixed sample space outcome , its sample path is the function . One row of observed fair bits, one trajectory of a random walk, or one staircase of Poisson process arrival counts is a sample path. Fixing instead gives a random variable ranging across possible histories. The same two-variable object therefore describes both observations across outcomes and evolution within an outcome.
Statements about continuous, càdlàg or Hölder continuous function sample paths concern these functions simultaneously in time. They differ from assertions made at each fixed time separately. For example, take with a uniform distribution on and set . For every fixed , almost surely, but every sample path has a single spike. Thus this process is a modification of a stochastic process that is identically zero, while the two are not indistinguishable stochastic processes. Continuity of both sets of sample paths rules out this discrepancy: equality at a countable dense set then implies equality everywhere. This is why path regularity is an additional part of constructing a continuous-time model.
Sample space Created 2026-10-14 Updated 2026-10-14
The sample space is the set of outcomes represented by a probability model. One elementary outcome specifies a complete result at the level of detail the model keeps. An event is a subset belonging to the model's sigma-algebra ; it occurs when the actual outcome lies in that subset. Together with a probability measure , these form a probability space , with .[ref]
Introduction to Probability, Statistics, and Random Processes by Hossein Pishro-Nik. §1.3.1 Random Experiments: definitions of outcome, sample space, and event; three-toss example
Choosing a sample space means deciding which distinctions matter. For two tosses, recording the ordered head-or-tail sequence distinguishes from ; recording only the number of heads merges them. Neither representation is automatically wrong, but the second cannot answer a question about which toss was heads. Keeping a detailed sample space and defining a random variable for the desired observation lets several questions share one model.
A sample space alone assigns no probabilities. Even writing as a Cartesian product does not establish independence: that requires a condition on the probability measure. On a finite sample space with all subsets admitted as events,Only when all elementary probabilities are equal does this become , where the bars denote cardinality. This is the uniform distribution on a finite set, an additional modelling choice.
Sample spaces can also be infinite. For example, take , its Borel sigma-algebra, and the continuous uniform distribution. Then for , so each singleton has probability zero while . Thus an elementary outcome need not carry positive probability, and a continuous model cannot be understood by counting equally likely points. The distinction is developed in zero-probability event and countable additivity.
Satoshi Watanabe (physicist) Created 2026-10-13 Updated 2026-11-05
Satoshi Watanabe analyzed dependence among many random variables using information theory. The total correlation compares the sum of individual Shannon entropy values with the joint entropy, measuring information stored in their dependence: independent variables give zero difference, while correlated variables can share information. The multivariable construction goes beyond checking one pair at a time, helping distinguish a collective statistical structure from a collection of unrelated observations.[ref]
Information Theoretical Analysis of Multivariate Correlation by Satosi Watanabe. 1960 paper, entropy-based analysis of multivariate dependence
Portrait of Satoshi Watanabe
. Asahi Shimbun; Asahi Graph, 4 May 1949. Public domain in Japan and United States, as file states (old Japanese photograph; copyright expired before 1970; no URAA restoration). Source and usage information on the linked Wikimedia file page. Source.
