Stern-Gerlach spin measurement 2026-10-25
The ideal projective measurement of a spin-one-half component along a unit axis . The two outcomes have Born rule probabilities . For an input with Bloch vector , they are . This model distinguishes a mathematical spin measurement from engineering a literal free-electron beam splitter.
Stochastic computation graph Created 2026-10-24 Updated 2026-11-05
A stochastic computation graph is a directed acyclic graph combining deterministic transformations, random choices and costs. The changing probabilities of random choices contribute score-function gradient estimators, while differentiable deterministic paths contribute pathwise gradients. This accounts for both sources of a parameter's effect on an expected cost.[ref]
Stochastic continuity Created 2026-09-24 Updated 2026-11-05
Stochastic domination of probability measures Created 2026-10-06 Updated 2026-11-05
On a finite partially ordered state space, means for every real-valued order-preserving function . Equivalently, every increasing subset has no larger probability under than under . A coupling supported on pairs with proves this relation. This concerns order of probability laws, rather than stochastic asymptotic order notation.
Stochastic matrix 2026-10-14
A row-stochastic matrix has nonnegative entries and each row sums to one. For a time-homogeneous Discrete-time Markov chain, its transition matrix has entriesIf a state has zero probability at time , this row is specified by the model's Markov kernel, rather than recovered by conditioning on that zero-probability event. Rows index departure states and columns arrival states. Writing the current probability distribution as a row vector givesThe row-sum condition ensures that matrix multiplication preserves total probability. Under a column convention the evolution uses the transpose; the convention must accompany the formula.
For the sunny/rainy transition matrix, direct matrix multiplication givesIn particular, . The two terms sum the disjoint paths and . Requiring both subsequent days to be sunny has probability ; requiring only the second day to be sunny permits the extra path through rain.
Generally is the -step transition probability. The identity is the discrete-time Chapman-Kolmogorov equation: sum over the intermediate state. This makes matrix powers useful for forecasting many steps without enumerating every path individually.
Stochastic process Created 2026-09-24 Updated 2026-10-14
A stochastic process describes uncertainty about a whole history: not just the probability distribution of a measurement now, but how measurements at different times fit together. It is a family of random variables on one probability space, with index set . Time is the usual index: for successive observations or for continuous time. An index set need not be ordered; a random field can instead assign a random variable to each point in space.
There are two complementary views. Fix a time and is a random variable; fix a sample space outcome and is one sample path. A model specifies the probability distribution of these histories. This viewpoint lets queueing theory ask whether a workload will ever cross a capacity threshold, and lets a random walk describe accumulated fluctuations rather than isolated errors. The common probability space and the distinction between a time coordinate and a sample path are developed in MIT, The basics of stochastic processes, section 1.
A concrete construction starts with a Bernoulli process of independent fair bits . Keeping records the next trial; adding the signs gives a simple random walk on the integer line, and . Every increment of this random walk is , yet the positions are dependent: contains all the previous increments. Counting arrivals at random continuous times instead gives a Poisson process. These examples separate three questions: what values are possible, how time is indexed, and how the values depend on one another.
For the fair simple random walk on the integer line, the expected value is and the variance is . At time four, returning to zero requires exactly two positive steps, so . A rate-two Poisson process instead has . A single realized sample path does not establish either probability: they follow from the specified joint probability distributions.
The most revealing feature is often dependence. Two stochastic processes can have identical marginal distributions at every time while one forgets everything at the next step and the other repeats its first value forever. Their finite-dimensional distributions and covariance functions distinguish them. That extra structure is what makes a stochastic process useful for prediction.
Stoquastic acceptance floor Created 2026-10-06 Updated 2026-11-05
If the output of a stoquastic circuit is with nonnegative amplitudes, its plus-outcome probability is . Basis quantum witnesses with zero and plus ancilla qubits always have this property. A soundness threshold below one half cannot hold for every such input.
Stratified sampling 2026-10-07
Stratified sampling partitions a population into strata and samples separately within each. It guarantees specified representation and can improve precision when the strata describe population variation. Equal sampling fractions give equal unit inclusion probabilities; unequal fractions require appropriate weighting for population summaries.
Stratonovich integral Created 2026-10-05 Updated 2026-10-06
For continuous semimartingales, the Stratonovich integral is defined by , where the first term is an Itô integral and the correction is quadratic covariation. It obeys the ordinary chain rule and is the limit in probability of symmetric endpoint sums.
Stress generation Created 2026-10-25 Updated 2026-11-05
A process in which symptoms or related characteristics increase the probability of subsequent stressful experiences. It differs from sensitization, which concerns a changed response to psychological stress, although the two can participate in a feedback loop.
For , an intersection inside a disk requires at least two lines to meet that disk. The latter count is Poisson with mean , giving the non-strict bound first. It is strict because two lines with nearby normal angles but separated perpendicular distances can both hit the disk while intersecting outside. Choose two positive-measure parameter boxes forcing this configuration; the event of exactly one line in each box and no other disk-hitting line has positive probability. This also yields a void probability too large to equal that of a Poisson point process with the intersection process's intensity measure.
Suppose is a nonzero separable Banach space, the Cameron-Martin space of a Gaussian random variable in a Banach space is a dense subset of , and every centered ball of positive radius has positive probability. Then is strictly increasing on . For , choose in that Cameron-Martin space of a Gaussian random variable in a Banach space with and . The closed ball of radius centered at lies in the annulus and has positive probability by the symmetric Gaussian translation lower bound. The nonzero assumption is necessary: on the distribution function equals one everywhere.
Strictly proper scoring rule Created 2026-10-07 Updated 2026-10-14
A strictly proper scoring rule is a proper scoring rule for which the true probability distribution is the unique optimizer of the expected value. Equivalently, any different admissible probability distribution gives strictly larger expected loss. For probability density functions, two densities that agree almost everywhere represent the same probability distribution. Ordinary propriety permits ties: the constant reward is a proper scoring rule, because every report ties, but it is not a strictly proper scoring rule and elicits no information.
Strict propriety concerns expectation, not guaranteed success on each observation or each realized dataset. With the stipulated Bernoulli distribution , suppose the outcome is . The honest report then has Brier score loss , while has loss . The logarithmic loss similarly gives losses and . The honest forecast loses this comparison on that draw, which occurs with probability in the stipulated statistical model.
Individual outcomes can favor a different report even though the expected Brier score and logarithmic loss are uniquely minimized at
. Details. The loss curves favor , and the loss curves favor . Their weighted average, with weights and , favors . Choosing a report after observing would use information unavailable at forecast time. Even an average loss on a finite dataset can rank an honest forecast below a competing forecast through outcome variation; strict propriety guarantees the ranking in expected value under the specified information and true predictive distribution.
Strict positive covariance with an increasing payoff Created 2026-10-06 Updated 2026-11-05
Let be a nondegenerate real random variable and a strictly increasing function. Assume , and are integrable. For an independent copy ,The product is positive whenever and zero otherwise. Nondegeneracy gives positive probability of unequal copies, proving strict positivity. The same argument applies to a conditional distribution when that conditional law is nondegenerate and has the required integrability.
For a market with one trading period, suppose an increasing terminal payoff is replicated by a risk-free asset holding and a stock holding: . Under current information , let be -measurable and . ThenThis is a conditional one-period statement. General dynamic attainability alone does not specify the affine representation used in this calculation.
Strict record 2026-11-05
A strict record in a sequence occurs at index when . The first observation is conventionally a strict record. A tie with the previous maximum is excluded: the observations have strict records at indices .
If the observations are independent and identically distributed with a continuous cumulative distribution function, their maximum among the first observations is unique almost surely. By exchangeability, each of the positions has the same probability of containing that maximum. Thus the probability of a strict record at is , and linearity of expectation gives an expected number of strict records up to . Ties or dependence can change the calculation; identical marginal probability distributions alone do not justify the symmetry argument.
Strong classical simulation of a quantum circuit Created 2026-09-24 Updated 2026-11-05
A strong classical simulation computes a quantum circuit's specified output probabilities in classical polynomial time to the requested polynomial precision. This is stronger than weak simulation, which only samples from the output distribution.
Strong law of large numbers Created 2026-09-24 Updated 2026-10-14
Let be real independent and identically distributed random variables with , and let be their expected value. Their sample mean satisfiesThis is almost sure convergence: with probability one, an entire infinite sequence of observations has averages that eventually stay within every prescribed positive tolerance of . The variance need not be finite. The strong law of large numbers implies the weak law of large numbers, which asserts convergence in probability at each increasing sample size.
For independent trials with a Bernoulli distribution of parameter , is one for success and zero for failure. Then is the observed success proportion, and the strong law of large numbers says almost surely. This turns a theoretical probability into a quantity one can estimate by repetition. It does not say that each new trial improves the estimate: a long string of failures can move the proportion away from before later observations bring it back.
The strong law of large numbers gives the limiting location of the sample mean, while the central limit theorem describes its fluctuations when the variance is finite and positive. The two assertions can hold together:The first error shrinks to zero; the second has been enlarged enough to retain a nontrivial probability distribution. The second assertion is convergence in distribution, not a claim that the enlarged error along one sequence approaches a particular normal random variable.
The assumptions make a practical difference. If every observation repeats the same nonconstant Bernoulli random variable, , then for all : identical probability distributions alone do not make repeated observations informative. For independent observations with a Standard Cauchy distribution, the Cauchy sample mean has an unchanged distribution, so it does not concentrate around a constant. Its expected value is undefined, and ; neither example contradicts the stated strong law of large numbers.
A brief proof outline in the case of finite variance uses the Kolmogorov maximal inequality for the centered partial sums. The probability that their maximum up to exceeds is at most . These bounds are summable, so the Borel-Cantelli lemma controls all sufficiently large such blocks and hence every intermediate sample size. The general case requires truncation to control large observations; the argument using finite variance alone does not prove that full version.
Strongly universal hash family 2026-10-13
A strongly universal hash family makes every ordered pair of outputs equally likely: for distinct inputs and arbitrary specified outputs ,Thus the two outputs are independent random variables, each with the uniform distribution on a finite set. Adding the equal ordered pairs gives collision probability , so the family is also a universal hash family.
Here is a completely enumerable example. In the finite field , take the affine functions , using modular arithmetic modulo . Choose and as independent random variables, each with the uniform distribution on a finite set of all five finite field elements , including . There are equally likely hash functions. For , the ordered pair is . For instance gives ; gives . Every prescribed occurs exactly once, at .
Enumerating all affine hash functions over the finite field with five elements
. Each cell shows the unique coefficient pair (a,b) producing the displayed outputs at 0 and 1. Removing a = 0 deletes the diagonal and leaves dependent outputs despite uniform individual values. Details.Each row contains five choices, so each individual output has probability . Each cell has probability , and the five diagonal cells give collision probability . For any distinct , the same conclusion follows from and : a nonzero finite field element has a unique inverse. This is the beauty of the construction: two small random coefficients provide exact pair balance without choosing five unrelated values.
The example uses equal-sized input and output sets to make every choice visible; it illustrates the family definitions rather than compression. In a larger input set, a hash function cannot avoid all collisions into five buckets. What a universal hash family controls is the fraction of its members that collide on each fixed pair, rather than the existence of any collision anywhere.
Restricting to leaves permutations with zero collision probability for distinct inputs. Individual outputs remain uniform, but given , the four values other than each have conditional probability and has zero. Hence these outputs are not independent random variables: this is a universal hash family but not a strongly universal hash family. Finally, the full -member example contains five constant functions, with immediately visible collisions. Its pair guarantee concerns a random choice of hash function, and makes no claim of cryptographic collision resistance.
Strong plan 2026-10-24
A plan or policy that reaches a goal after finitely many steps under every permitted outcome sequence. In a finite state space with finite outcome sets, a terminating finitely branching plan tree has bounded depth. Strong planning winning-set iteration constructs exactly the states from which such finite guaranteed-success plans exist. A repeated state cannot be accepted merely because repeated attempts might eventually succeed: without a fairness or probability assumption, an unfavorable outcome can recur forever.
Studentization of the generalized covariance measure statistic Created 2026-09-28 Updated 2026-11-05
Suppose the scaled mean residual product in the generalized covariance measure statistic converges in distribution to , with , and its empirical variance converges in probability to . Then the Slutsky theorem gives . It is the square root of the variance estimate that belongs in the denominator. Under the null and suitable regression conditions, for the two true regression residuals. This is a calibration argument; it does not remove the conditions needed for the numerator limit or variance consistency.[ref]



