Bivariate normal distribution Created 2026-09-24 Updated 2026-11-05
A bivariate normal distribution is a multivariate normal distribution with two coordinates. It is determined by means , positive standard deviations , and correlation coefficient . For it has joint probability density
One construction uses independent standard normal variables : set and . This verifies the means, variances and covariance , and also explains the limiting cases. At the law is supported on a line and has no two-dimensional Lebesgue density. At the density factors into its marginal normal densities and the coordinates are independent.
Each conditional law is normal: has mean and variance . For example, equally scaled standardized variables with correlation have conditional variance , quantifying the uncertainty left after observing the first coordinate.
Brownian hitting of lattice spheres Created 2026-10-05 Updated 2026-10-06
For three-dimensional Brownian motion, every radius and every initial point satisfy
If the initial point is on one of the spheres, it is already a hit at time zero. If it is inside a lattice-centered open ball, its eventual exit hits that sphere. Otherwise choose at each integer time a nearest lattice center. The current displacement from it has norm at most , so the multivariate normal distribution of the next unit increment gives a uniform positive chance of entering its radius- open ball. The geometric tail bound from a uniform escape probability makes eventual entry certain, and continuity forces a boundary crossing. This periodic-family recurrence does not contradict the Brownian sphere-hitting probability in dimension three for one fixed sphere.
Canonical joint distribution for group sequential test statistics Created 2026-09-24 Updated 2026-11-05
A common approximation for group sequential test statistics represents the accumulating score by , where is information and is standard Brownian motion. At fixed information levels , put . The vector has a multivariate normal distribution with
Indeed independent Brownian increments give . The statistics share observations, so later and earlier tests are correlated. For two equally sized stages, the interim/final correlation is , not zero. This joint law is used to calculate the probability of crossing any efficacy boundary in a group sequential design. It is exact for the Brownian score model; its use for a general trial statistic is a normal approximation requiring the appropriate information and independent-increment limit assumptions.
Conditional bias-corrected normal mean estimate Created 2026-10-07 Updated 2026-11-05
Consider independent stage means and , with positive known information . Continue to stage two only if . The pooled mean is , where . Write for its observed value. Its conditional mean under a candidate parameter is
Here and are the standard normal probability density and cumulative distribution functions. The Conditional bias-corrected normal mean estimate solves . This inverts the selection-shifted mean instead of ignoring the fact that the first-stage mean exceeded a threshold.
For the upper-tail inverse Mills ratio , . The variance of a truncated standard normal variable gives , hence . Since , is strictly increasing and ranges over the whole real line; the root exists uniquely. Differentiating the joint normal likelihood conditional on continuation shows that the same root maximizes that conditional likelihood. Inverting a conditional mean does not itself make an estimator conditionally unbiased. The separate Rao-Blackwell estimator after interim selection provides that property in the equal-information setting.
Conditional correlation 2026-10-14
The correlation coefficient computed under a conditional distribution, using its conditional covariance and positive conditional variances. It can depend on the observed conditioning value. For a multivariate normal distribution, conditioning on other coordinates gives the corresponding partial correlation.
Conditional independence graph Created 2026-10-05 Updated 2026-10-06
For a random vector indexed by vertices , its conditional independence graph is the undirected graph with absent exactly when . In a nonsingular multivariate normal distribution, its edges are the nonzero off-diagonal entries of the precision matrix.
Conditional multivariate normal distribution Created 2026-09-24 Updated 2026-11-05
Partition a jointly multivariate normal distribution into vectors and with means and covariance blocks . If is invertible, then the Conditional multivariate normal distribution is
The covariance is a Schur complement. To see why, subtract the linear prediction from : . Direct covariance calculation gives . Since and are jointly Gaussian, they are independent; the covariance of is exactly the displayed Schur complement. Conditioning therefore changes the mean but leaves that residual covariance fixed.
For two standard normal variables with correlation , has mean and variance . If , the conditional law is degenerate: the same formula still gives a zero variance. A singular requires conditioning on its supported subspace rather than taking an ordinary matrix inverse.
Confidence ellipsoid Created 2026-10-05 Updated 2026-10-14
An ellipsoidal confidence region defined by a positive-definite matrix and a calibrated threshold . For a known-covariance multivariate normal distribution sample, and the quantile of the chi-squared distribution with degrees of freedom give exact coverage for the -dimensional mean.
Covariance function Created 2026-09-28 Updated 2026-10-14
For a real-valued stochastic process with finite second moments, write . Its covariance function is
The diagonal gives the variance at each time; off-diagonal values record linear dependence between times. For the independent standard normal random variables above, , whereas the shared Gaussian process has for all . For a fair simple random walk on the integer line, ; Brownian motion has the continuous-time counterpart . These formulas quantify how much random history the observations share.
Every covariance function is a positive-semidefinite kernel. Indeed, for any real coefficients ,
Thus a proposed covariance function must make every finite covariance matrix positive semidefinite. For a Gaussian process, the mean function and the covariance function determine every finite-dimensional distribution, including degenerate ones such as the shared process. Conversely, any real positive-semidefinite kernel satisfying , together with a specified mean function, defines consistent multivariate normal distributions; the Kolmogorov extension theorem then constructs a Gaussian process. For a general stochastic process, covariance alone does not determine the full law. The exceptional completeness of this description is what makes Gaussian process regression possible with a mean and a covariance model.
Discriminant analysis 2026-11-05
Discriminant analysis constructs statistical rules distinguishing labelled classes from their measured feature values. A common generative approach models the class-conditional probability distribution and applies Bayes' theorem to compare posterior class probabilities. Linear discriminant analysis uses multivariate normal distributions with a shared covariance matrix; allowing a different covariance matrix for each class gives quadratic discriminant analysis.[ref]
For two equally likely one-dimensional classes, suppose and . Their log-likelihood ratio is
Choosing the larger posterior therefore selects for , with a tie at one. Different class probabilities move this threshold. Estimating means and covariance from training data supplies a fitted rule, while independent evaluation tests whether its assumptions generalize.
Consider the correctly specified fixed-design normal linear model , with an full-column-rank design matrix, , and with . Both and are unknown, so the Akaike information criterion counts fitted parameters. If is the residual sum of squares, then
The orthogonal-projection decomposition of a random variable with a multivariate normal distribution gives . Substituting into yields
Here denotes a random variable, not a quantile. The maximum-likelihood estimator of the error variance uses divisor ; the unbiased residual variance estimator with divisor cannot be substituted into the maximized likelihood. If and is invertible, the fit has zero residual sum of squares, and the Gaussian likelihood is unbounded as decreases to zero. There is then no finite positive-variance maximum-likelihood estimator to which the displayed Akaike information criterion law applies.
Eigenmode alignment in overlap variance correction describes how shared calibration directions change the mean of a variance-corrected overlap, even when the marginal distributions of the reading and estimated variance are fixed. In the quadratic Gaussian overlap correction model, let have the standard multivariate normal distribution, and , with symmetric positive semidefinite matrix and . The corrected estimate is .
Write with orthogonal matrix , and let . Completing the square in the Gaussian density gives
The eigenvalues determine the variance estimator's distribution. Its eigenvectors determine which of those directions also enters . Rotating relative to a fixed preserves those eigenvalues but changes the last sum.
An original rank-one example takes , with unit vector , and . If is the angle between and , direct inversion of gives
Parallel alignment gives a mean ratio about ; perpendicular alignment gives about . Both estimated variances have mean one and distribution . Unbiased estimation of the logarithmic variance therefore does not itself make the corrected arithmetic overlap unbiased.
A Rayleigh quotient bounds every orientation when :
The endpoints occur when lies in the respective extreme eigenspaces. Substituting these bounds into the logarithmic mean formula gives a deterministic range over all alignments with the stated eigenvalues.
There is an instructive dependence trap. Symmetry gives , while the Gaussian fourth moments give
Zero linear covariance between the signed residual and the variance estimate therefore does not establish that they are independent random variables. Squaring the residual exposes shared directions.
For an actual calibration, the joint input model must describe which records are reused. JCGM 101 separates assigning input distributions from propagating them and presents the multivariate normal distribution as one possible joint assignment.[ref] The examples and orientation bounds above are derived probability models, not measured heterodyne performance.
For fixed , the vector converges in distribution to , where is a standard Brownian bridge. To prove it, write the vector as times the sum of independent centred bounded indicator vectors. Their covariance matrix is . The multivariate central limit theorem gives a centred multivariate normal distribution with this covariance, exactly the bridge vector. Singular covariance matrices, including endpoint times or repeated values of , cause no problem. This is a finite-dimensional assertion; a full function-space limit additionally requires tightness.
Every real symmetric matrix satisfying for every real vector is the covariance matrix of a random vector taking only finitely many values. The stated inequality means that is a positive semidefinite matrix. One does not need a multivariate normal distribution to realize a specified second-moment geometry. Conversely, a proposed covariance matrix must be positive semidefinite, since is the variance of the projection onto any real vector .
Here is an explicit construction. If is the matrix rank of , orthogonal diagonalization gives a real matrix with
Let be independent Rademacher random variables, each equal to or with probability , and put . Then and , so
The random vector has at most possible values. Adding any constant vector prescribes its mean without changing its covariance matrix. If , the constant vector alone suffices.
For an original two-dimensional example choose
The four equally likely values of are
Their coordinate means vanish. Their squared first coordinates average to , their squared second coordinates to , and their coordinate products to . The displayed covariance matrix is therefore realized exactly, without sampling error or an asymptotic argument.
These four values are a complete probability model with masses , not automatically an independent random sample whose population is unknown. Applying the usual divisor-three sample covariance matrix to the same four rows would give . NIST explicitly distinguishes that unbiased sample formula with divisor ; probability-weighted population moments use the assigned masses instead.[ref]
The sign construction need not minimize the number of points. If a distribution has positive-mass support points, the centered points obey one nontrivial weighted relation, so their span has dimension at most . Its covariance matrix consequently has matrix rank at most , requiring when . Matching a covariance matrix also does not match the full probability distribution: this finite model and a continuous Gaussian model can have identical means and covariances while assigning very different probabilities to nonlinear events.
First Gaussian chaos Created 2026-10-06 Updated 2026-11-05
For a centered Gaussian random variable in a Banach space, its first Gaussian chaos is the closed linear subspace of L2 space generated by its continuous linear observations. Every element is a centered Gaussian random variable, and every finite collection has a multivariate normal distribution: approximate in L2 space and pass to the characteristic function. The first Gaussian chaos supplies the scalar coordinates of its Cameron-Martin space of a Gaussian random variable in a Banach space.
Futility boundary Created 2026-10-06 Updated 2026-11-05
A Futility boundary specifies an interim result below which a clinical trial stops without rejecting the null hypothesis. Removing only potential rejection paths cannot increase the type I error. With a finite boundary and a nonsingular joint normal test-statistic distribution, it strictly reduces that error relative to the corresponding fixed-final-boundary test.
For a stationary unit-variance normal distribution autoregression with coefficient , its vector of length has precision matrix that is tridiagonal: the two endpoint diagonal entries are , interior entries are , and adjacent off-diagonal entries are . An independent observation , with covariance , updates precision and information vector to
The conditional law is multivariate normal distribution .
Let , let , and propose
The proposal distribution is . If independently of , then is a jointly multivariate normal distribution invariant under exchanging and , because both random vectors have covariance matrix and their cross-covariance matrices are both . Consequently its density satisfies
where is the standard-normal density. Thus the proposal is reversible with respect to the standard normal distribution.
Gaussian Bayesian network Created 2026-10-05 Updated 2026-11-05
A Gaussian Bayesian network specifies a linear normal conditional model at each node of a Bayesian network: . Independent local errors and an acyclic ordering generate a joint multivariate normal distribution. Positive conditional variances give a nonsingular joint multivariate normal distribution. The graph constrains regression coefficients and hence conditional independence.
Gaussian conditional expectation Created 2026-09-24 Updated 2026-11-05
Let the joint random vector have a multivariate normal distribution, with expectations , covariance matrices and cross-covariance matrix . If is invertible, the conditional expectation is the affine function
and the conditional covariance matrix is .
To prove both assertions, define . Direct covariance calculation gives . Since has a multivariate normal distribution, this zero cross-covariance implies independence. The decomposition of into its affine part and therefore gives the conditional expectation and the remaining covariance matrix. This is the conditional multivariate normal distribution calculation.
If is singular, replace by its Moore-Penrose inverse . The formulas hold for in its affine probability support, ; values away from that probability support do not determine a unique version of the conditional expectation. For example, if and for a standard normal random variable , then is the all-ones matrix. Although does not exist, on the probability support .