Size-biased probability generating function Created 2026-10-31 Updated 2026-11-05
For a positive integer-valued random variable with finite mean , the size-biased distribution has probabilities . They sum to one by the definition of expected value. Multiplying the differentiated probability generating function by gives the displayed identity for , with the endpoint interpreted by its limit.
Size of a statistical test Created 2026-10-03 Updated 2026-11-05
The size of a test is the supremum, over distributions in its null hypothesis, of its rejection probability. For a simple null it is just the null rejection probability; a level- test has size at most .
Skewness Created 2026-10-05 Updated 2026-11-05
For a real random variable with finite third absolute moment and positive variance , its skewness is . It is dimensionless and unchanged by positive rescaling or translation; a reflection reverses its sign. A symmetric distribution has zero skewness, but the converse fails: values with probabilities have mean zero and third moment zero without symmetry. Constant variables have no defined standardized skewness because . The cosmological reduced skewness uses a different normalization.
SLE does not hit a fixed nonzero boundary point Created 2026-09-28 Updated 2026-11-05
For a fixed , a chordal SLE trace in satisfiesFor the trace avoids the entire nonzero real boundary. For it meets a random boundary subset but misses each predetermined point. A fixed point is nevertheless swallowed almost surely in this latter range: visiting and disconnecting from infinity are different events.[ref]
The restriction is essential. At , the strict ordering threshold for SLE boundary swallowing and real-line visitation from strict SLE swallowing order give visits to every real boundary point. The SLE boundary-point logarithmic separation diffusion proves the below-eight fixed-point assertion through the probability of swallowing before a nearby point; its limiting behavior changes at eight.
Sliding diffusivity with per-step dissociation Created 2026-10-24 Updated 2026-11-05
For an unbiased one-dimensional walk with step size , diffusion coefficient fixes step interval . A small dissociation probability per step gives about steps before release. Thus lifetime depends on , while the root-mean-square net displacement before release is . Net displacement is not the cumulative distance along all backtracking steps. Dimensional consistency of the measured or assumed diffusivity is necessary before applying the estimate.
Slower-speed degeneration of a large deviation principle Created 2026-10-14 Updated 2026-11-05
Suppose a large deviation principle at speed has a good rate function with unique zero mu. At any slower speed with , its rate is zero at mu and infinity elsewhere. On a closed set excluding mu, the positive original rate gives decay faster than every exponential at speed . Neighborhoods of mu have Probability tending to one, giving the slower-speed open-set lower bound. The new rate is good because its finite sublevel set is the singleton mu.
Slow holding rates destroy positive recurrence Created 2026-09-24 Updated 2026-11-05
Even when the jump chain has invariant probability , the continuous-time invariant measure may have infinite mass if holding rates become too small, producing infinite mean return time.
Small-detuning error of a Rabi pi pulse Created 2026-10-25 Updated 2026-11-05
For the Driven two-level Rabi model at fixed resonant pulse duration , put . Its transfer probability isThe sine-squared numerator differs from one only at order , while the denominator gives . Thus the leading population-transfer error is . For a target transfer error , the frequency mismatch in cycles per second should satisfy in this small-detuning regime. This is not a complete characterization of every coherent gate error.
Small normal sample mean confidence interval 2026-10-18
Under the studentized normal sample mean assumptions, let denote the quantile at cumulative probability of the Student's t-distribution. For , rearranging the event gives a Student t confidence interval for the unknown mean with exact coverage probability . [ref]
Choose the list as an original arithmetic example, not as reported measurements or a claim that these five numbers establish a normal distribution. If such values were obtained under the assumed independent and identically distributed normal distribution model with unknown , thenThere are four statistical degrees of freedom. For a 95% confidence interval, , soUsing the standard normal quantile with the same estimated standard error would give only . That underestimates the correct margin by about 29.4%. Indeed its actual coverage probability under this normal distribution model is , rather than 0.95.
The observations, the sample mean and the confidence interval all have different meanings. The bar estimates the population mean; it is not an interval intended to contain 95% of individual observations. In repeated independent samples of size five from the assumed normal distribution, 95% of intervals constructed using the exact quantile cover the same fixed . This is not a 95% posterior probability that the fixed statistical parameter lies in this particular realized interval. Such a probability requires a separate Bayesian inference model.
For this four-degree case, the cumulative distribution function has an especially simple form:One can check the formula by differentiation: , with limits zero and one at the two ends of the real line. Solving the increasing equation by the bisection method gives the quantile used above.
Smoothing bandwidth Created 2026-10-05 Updated 2026-10-14
A smoothing bandwidth determines the scale over which a regression kernel averages data, or a kernel for density estimation spreads each observation. It has the same units as the observations. In kernel density estimation, changing changes the visible detail while preserving the total integral one. For a Gaussian density kernel, each bump has standard deviation and its individual contribution has peak height .
If the smoothing bandwidth is too small relative to the spacings in a statistical sample, the kernel density estimator shows narrow spikes tied to individual observations: apparent peaks may be sampling accidents. If it is too large relative to features of the unknown probability density function, it blurs distinct groups together and spreads fitted probability far from the observations. An intermediate smoothing bandwidth can reveal broad structure, but visual smoothness alone cannot establish accuracy.
The same sample at three Gaussian bandwidths, and leakage below zero for a separate positive sample
. Details. The first three panels use exactly with smoothing bandwidths , and , respectively. Every curve has area one; the two groups in the observed statistical sample become less distinct as increases. No true probability density function is specified in this illustration, so the middle panel is illustrative, not a certified optimal fit. The fourth panel uses and to illustrate boundary bias of a kernel density estimator.
For a fixed nonnegative kernel for density estimation with finite squared integral, a probability density function that is bounded and continuous at an interior point with , and a deterministic sequence , the pointwise sampling variance obeysThus decreasing the smoothing bandwidth increases the leading sampling variance while reducing interior smoothing bias of an estimator: this is a bias-variance tradeoff. The conditions and express two goals, increasingly fine resolution and enough observations contributing locally. Practical methods such as plug-in bandwidth selection use the data to choose ; pointwise optimal kernel bandwidth depends on local features of the unknown probability density function. The smoothing bandwidth remains a tuning choice in nonparametric statistics, and knowing the support of a probability distribution can require more than a width adjustment near a boundary.
Somenath Biswas 2026-11-05
Somenath Biswas coauthored the 2003 paper on primality testing and polynomial identity testing with Manindra Agrawal. Their randomized algorithm reduces a candidate integer's primality to a univariate polynomial identity over the integers modulo that candidate.[ref]
A polynomial can have very high polynomial degree while being represented by a small arithmetic circuit. Expanding every polynomial coefficient can then be impractical. The paper also gives randomized algorithms for multivariate polynomial identity testing with running time polynomial in the circuit representation size and an error parameter. The input representation and probability of error are consequently essential parts of the algorithmic statement.
Source redundancy in cryptanalysis Created 2026-09-24 Updated 2026-11-05
For a plaintext alphabet of size and entropy rate in bits per symbol, put . In the random-cipher approximation, the unicity distance scale iswhere is cryptographic key Shannon entropy. Uniform cryptographic keys on a finite set give . For correlated plaintext, its one-symbol Shannon entropy cannot replace the entropy rate without justification.[ref]
Communication Theory of Secrecy Systems by Claude Shannon. Sections 14–15, Figure 7 and corrections for ordinary ciphers, printed pp. 691–695
For example, a 40-bit uniform cryptographic key and redundancy two bits per symbol suggest about twenty symbols under this model. This estimate does not bound computation time or guarantee unique recovery for each ciphertext. At zero redundancy it supplies no finite threshold; a probability-preserving source symmetry can also invalidate the random-cipher uniqueness intuition.
Spatially gated myosin attachment 2026-10-24
A prescribed-velocity motor can attach only over a narrow displacement window, remain attached over a protected interval, then detach with constant rate. Converting time to displacement gives a rising attachment probability, a plateau , and an exponential tail with spatial length . Independent successive-site encounters require detachment before the next window, not merely a large geometric site separation. Earlier attachments can be retained in a periodic availability correction.
Spatial phase gradient of a Schrodinger wavefunction Created 2026-10-25 Updated 2026-10-31
Where a nonzero wavefunction can be written as , and there is no vector potential, substituting into the Schrodinger probability current gives . The direction of probability flow is determined by the phase gradient rather than the slope of the real part. A plane wave and its complex conjugate have the same real part and density but opposite currents. In a vector potential the gauge-invariant kinetic momentum replaces .
Spectral condition for a small discrete SIR outbreak Created 2026-10-14 Updated 2026-11-05
The displayed condition and the resolvent bound for a discrete SIR epidemic imply . The Markov inequality then makes in probability. A sufficient special case is a sublinear initial infected count with a fixed positive gap . The inequality at each finite population size alone does not control a shrinking gap or an initially macroscopic outbreak.
Spectrum of lazy random walk on the hypercube Created 2026-10-06 Updated 2026-11-05
For random walk on that chooses a coordinate uniformly and flips it with probability , the Walsh characters form an orthonormal eigenbasis under the uniform distribution on a finite set. Flipping a coordinate in negates , so . Hence has multiplicity , and the ordinary and absolute spectral gaps both equal .
Spin-connectivity identity for the Potts model Created 2026-10-14 Updated 2026-11-05
For integer , given a random-cluster configuration, its components receive independent uniform colors under the Edwards-Sokal coupling. Two vertices have equal Potts spins with probability if connected and otherwise. Averaging proves the identity. With a wired component fixed to color , the same argument gives normalized spontaneous magnetization in infinite volume. Thus its onset is the wired random-cluster critical probability, with dimensionless Potts model coupling in the convention of the Edwards-Sokal coupling.
For , the equal-spin probability is identically one and the first identity reduces to . The normalized magnetization expression divides by and therefore does not apply to that degenerate one-color case. The conversion to a physical Ising model inverse temperature must also account for the interaction convention.
Spin expectation value 2026-10-14
For spin one-half, choose the normalized spin eigenstates with . The spin one-half along an axis pure state in the plane isIts norm is one because the two eigenstates are orthogonal and . Applying the Born rule to a projective measurement givesConsequently the expectation value, second moment, and variance areAt , the outcome probabilities are and , the mean is , and the variance is . Every individual outcome remains . At , the mean is zero and the variance is maximal, . At either pole, one outcome has probability one and the variance vanishes.
Spin expectation value between the two possible outcomes
. Original calculated Born rule distributions at three preparation angles. Bar heights are outcome probabilities; the dashed orange line marks the expectation value, whose horizontal position is usually not an allowed outcome. Spin values are expressed in units of the reduced Planck constant. No bars represent experimental observations. Source. Details.The diagonal mixed state has the same probabilities, expectation value, and variance as . It is nevertheless a different quantum state for : the displayed pure state has , while has . A single component's mean does not reveal all relative quantum phases or establish purity of a density operator.
Spin measurement 2026-10-18
For a spin one-half system, an ideal projective measurement along a unit vector measures . Its eigenvalues are , corresponding to physical spin angular momentum components , and its orthogonal projections are . For density matrix , the Born rule and the Pauli matrix multiplication law give the displayed probabilities. Thus a spin measurement along one direction tests only that component of the Bloch vector; measurements along three independent directions determine the entire density matrix.
Spin measurement in the yz plane Created 2026-10-20 Updated 2026-11-05
For a state initially -up and precessing about , measurement along has the displayed probabilities. eigenvectors can be chosen as and . Their phases must be retained when taking inner products. Full rotation changes their signs but leaves isolated-state probabilities unchanged.


