Position uncertainty Created 2026-10-18 Updated 2026-11-05
The position uncertainty of a quantum state is the standard deviation of its measured position, provided the second moment is finite. It is computed from the position operator with the Born rule. An oscillator coherent state has independently of its mean position; translating the state changes the mean without changing this variance.
Posterior variance Created 2026-10-06 Updated 2026-10-14
A posterior variance is the variance of a parameter under its Bayesian posterior, namely when finite. It describes remaining uncertainty after observing data and is distinct from the repeated-sampling variance of a fitted estimator.
Power-law Press-Schechter stellar mass function Created 2026-10-06 Updated 2026-11-05
For a power-law matter spectrum, smoothed variance scales as with . Differentiating the Press-Schechter collapsed fraction gives a halo mass function proportional to . A constant stellar-to-halo mass ratio preserves both exponents and rescales characteristic mass and normalization.
Power spectral density 2026-10-18
A power spectral density distributes the mean square of a signal over frequency. Its integral over the specified frequency domain gives that mean square. State whether the convention is one-sided or two-sided and whether frequency is measured in hertz or as angular frequency. For a zero-mean stationary signal, the mean square is its variance; spectral density of a stationary process gives the discrete-time convention.
Power spectrum Created 2026-09-24 Updated 2026-11-05
A power spectrum resolves the second-moment strength of a stationary process or random field by temporal frequency or spatial wavenumber. For a real, mean-zero stationary process with integrable autocovariance function , use the angular-frequency convention
This form of the Wiener-Khinchin theorem makes the interpretation concrete: integrating spectral density over all frequencies recovers the variance. A nonzero mean contributes a spectral atom at zero if one transforms the uncentered correlation instead of the autocovariance function. Some stationary processes have discrete spectral lines, so an ordinary integrable spectral density need not exist.
For an Ornstein-Uhlenbeck process with , , the Fourier transform is . Its area is as required. Small concentrates power near zero and corresponds to slowly decaying fluctuations. Conventions using cyclic frequency rather than angular frequency move the factors of ; stating the convention prevents a normalization error when comparing spectra.
Prediction-risk bound for kernel ridge regression Created 2026-10-05 Updated 2026-11-05
Fix observation points and suppose , where the noise has zero expected value and covariance matrix . Use the unscaled objective with and . The kernel-ridge hat matrix is now . For ,
This is prediction error at the fixed observation points, with separate squared-bias and variance terms.
For eigenvalues of the kernel matrix,
The reproducing property and Bessel inequality represent with , including singular . Hence
The bound makes the opposing effects of the ridge explicit: it increases the displayed bias bound while reducing the variance bound.
Predictive variance Created 2026-10-25 Updated 2026-11-05
The variance of a predictive distribution quantifies spread of a future quantity conditional on the observed data and model assumptions. For a noisy future observation with fresh independent noise of variance , it is . It should therefore be distinguished from the latent-function posterior variance.
Preparation uncertainty 2026-10-18
Preparation uncertainty describes the outcome spread intrinsic to a specified quantum state preparation. Operationally, prepare many copies of the same quantum state, measure position on one group and momentum on another, and estimate the two variances. Ideal measurements still have the spreads predicted by the Born rule. No earlier position measurement need occur in the momentum group. The Heisenberg uncertainty relation constrains these two distributions belonging to the same preparation.
Measurement backaction concerns how a particular measurement in quantum mechanics changes a quantum state. Instrument resolution concerns how its reported outcomes relate to the intended observable. Those questions require a model of the instrument and its interaction with the system. Substituting an instrument error and an induced change for and in the Heisenberg uncertainty relation does not follow from its proof. The practical value of preparation uncertainty is that it bounds achievable input spreads before any such instrument model is chosen.
Present-extrapolated spherical-collapse barrier Created 2026-10-06 Updated 2026-11-05
With linear growth normalized to unity today, a collapse threshold at epoch corresponds to a present-extrapolated initial barrier . Comparing this barrier to present variance is equivalent to comparing to variance evolved to the collapse epoch. Mixing the two conventions counts growth twice.
A pressure-map information matrix quantifies which coefficients of a modeled contact pressure field are constrained by a sensor array, relative to its measurement noise. For with fixed positive-definite error covariance , define
Here is the noise-whitened pressure sensing matrix. Whitening removes the output-noise covariance from the residual metric; the primary SciPy covariance interface documents this transformation and demonstrates near-identity covariance on simulated observations.[ref]
The matrix is positive semidefinite because . Its null space is exactly the null space of : an unobserved pressure change remains unobserved after invertible row whitening. With independent Gaussian errors of known covariance, the log likelihood is a constant minus . Differentiating twice with respect to gives negative Hessian , identifying it as the Fisher information for this stated model.
If has full column rank, weighted least squares gives
This covariance follows by substituting and multiplying the error matrices. It concerns the unconstrained linear estimator with known response and covariance, not every reconstruction algorithm. Nonnegativity constraints, regularization and uncertain sensitivity kernels require additional treatment.
An original two-cell example begins with one average-pressure measurement, , with standard error. In numerical kilopascal coordinates,
Its eigenvalues are and zero: the mean is observed, but the pressure difference is not. A second independent copy doubles the information matrix while leaving the difference unobserved. More repeats of the same mixture improve precision only in the already measured direction.
Instead add a direct measurement of the first cell with the same independent error. Now
The inferred first-cell pressure has standard deviation and the second . Their errors are negatively correlated because the second pressure is reconstructed by subtracting the first from twice the measured mean.
A rank-one update of pressure-map information follows when an independent new channel has sensitivity row and error variance : its added information is . A channel aligned with a weak pressure direction can therefore be more useful than another precise copy of a strong direction. Correlated new errors cannot be added by that independent-channel formula.
A proposed characterization uses repeatable known loading patterns to estimate , independent repeats to estimate , and withheld patterns to test predicted reconstruction covariance. State the pressure basis and units: rescaling a coefficient changes the numerical information entries. A sharp reconstructed image or a large matrix determinant alone does not establish that the underlying response model or noise assumptions are correct.
For positive marginal variances, standardizing each variable to variance one converts covariance-based PCA on into correlation-based PCA on . This makes the analysis insensitive to the original measurement units but changes the optimization criterion. Standardization gives small-variance variables the same marginal weight as large-variance variables; it is a modelling choice, not an automatic improvement.
Principal component loading Created 2026-10-14 Updated 2026-11-05
Two conventions occur for principal component loadings: the unit eigenvector defining the direction, and the scaled vector . For principal component analysis on a correlation matrix and a positive eigenvalue , entries of are the correlation coefficients between each standardized variable and the component scaled to variance one. Indeed, and .
Thus , whereas . At a zero eigenvalue, the scaled vector is zero but the component has zero variance, so correlations with a unit-variance version are undefined. Reporting both the loading convention and the eigenvalue avoids conflating directions, correlations and degenerate components.
Principal component score 2026-10-14
A score is an observation's coordinate along a principal component direction. Center an observation by the fitted sample mean, apply the fitted variable scaling when using principal component analysis on a correlation matrix, then take its inner product with the unit principal component loading vector. New observations must use the training center and scaling. The score variance equals the corresponding eigenvalue when the covariance normalization is consistent.
Prior probability Created 2026-09-24 Updated 2026-10-14
Prior probability describes uncertainty before the current observations are incorporated. For a statistical parameter , a prior distribution assigns probabilities to its possible ranges, conditional on background information and a statistical model. A continuous prior density specifies these probabilities through integration:
Here the probability density function is relative to Lebesgue measure ; a discrete prior distribution instead uses a probability mass function and sums. Density at one point is not the probability of that point. A nonnegative kernel with infinite total mass is an improper prior, whose use requires a separate check of posterior propriety.
For the coin model in Bayesian statistics, the beta distribution has prior density on . Its mean is and its variance is . It favors moderate heads probabilities without ruling out values near zero or one. For example,
The prior curve in Bayesian posterior makes this preference visible; moment matching for a beta prior explains how to choose a beta distribution from a desired mean and variance.
A prior distribution lets earlier evidence or elicited knowledge contribute to statistical inference when the current sample size is limited. It also exposes assumptions that can be checked by prior elicitation and a prior predictive check. Before the same eight heads and two tails, a uniform prior would give posterior mean , compared with under : the observations do not uniquely determine a Bayesian posterior. Even a uniform prior makes a choice of parameter coordinates; its child article explains why changing coordinates can destroy uniformity.
Probability generating function of an independent random sum Created 2026-10-18 Updated 2026-10-25
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.
Probability theory Created 2026-09-24 Updated 2026-10-18
Probability theory describes uncertainty through a probability space: possible outcomes form a sample space, observable questions are events, and a probability measure assigns them numbers between zero and one. The Kolmogorov axioms make those assignments consistent. They let us combine information about several events, update it through conditional probability, and study random variables without listing every possible outcome separately.
For example, roll two dice whose results are independent random variables, each with a discrete uniform distribution on . There are 36 equally likely ordered outcomes. Only have sum seven, so that event has probability . The sum itself is not uniformly distributed: sum two has only one outcome. Choosing a probability distribution for the elementary outcomes is part of the model; equal likelihood does not follow merely from counting the named possibilities.
The subject becomes especially useful when complete outcome lists are enormous or infinite. Independence turns a joint calculation into simpler pieces, expected value summarizes a random variable, and the law of large numbers explains how averages can become predictable even when individual observations are uncertain. The central limit theorem describes the scale and shape of many remaining fluctuations. These are distinct claims: a small variance of an average does not make every observation close to its expected value.
There is a satisfying unity here: dice, hidden causes, and Brownian motion all use the same rules for events and conditional probability. A model still needs justification. Its exact deductions describe what its assumptions imply; comparison with observations belongs to statistical inference.
Probable error Created 2026-10-14 Updated 2026-11-05
The probable error is the half-width of an interval around a specified central value containing probability . For a normal distribution with , its quantile function gives
where is the standard normal cumulative distribution function and is the standard deviation. The factor is specific to the normal distribution. The centered Cauchy distribution with parameter has probable error , despite having no finite variance. Thus a central probability width need not require a finite second moment.
Product stationarity under single-coordinate Markov updates Created 2026-10-14 Updated 2026-11-05
Let be a Markov kernel with Stationary distribution on one coordinate. On coordinates, update coordinate with kernel while leaving the others unchanged. The product distribution is invariant: its updated coordinate still has law , and independent transition randomness leaves it independent of the untouched coordinates. Choosing the updated coordinate independently of the current configuration, with any fixed selection probabilities, forms a mixture of these invariant kernels and preserves the same product law.
For a two-state kernel with and , the stationary Probability of state one solves . If , then
Under the product stationary distribution, the occupied-coordinate count has binomial distribution with parameters , mean and variance . In the exceptional case , the kernel is the identity and every is stationary; the displayed fraction is undefined and must not be used.
State-dependent coordinate selection can invalidate the conclusion. On two bits, let each single-coordinate kernel refresh to a fair bit, but select coordinate one whenever its current value is zero and coordinate two otherwise. Starting with independent fair bits, the Probability that the first bit equals one after a step is , so the uniform product law is not invariant. Invariance of each coordinate-update kernel alone is insufficient when the mixture weights depend on the state.