Simple random sampling Created 2026-10-07 Updated 2026-10-14
Here simple random sampling means a random unordered subset of exactly distinct labels from , with every size- subset equally likely. The sample size is fixed in advance, , and sampling without replacement prevents duplicate units. This is SRSWOR; some texts also use "simple random sampling" for independent uniform draws with replacement, which is a different design.[ref]
Chapter 2: Simple Random Sampling. Sampling Theory, Chapter 2, Simple Random Sampling, PDF pp. 1–4: replacement conventions and ordered versus unordered sample probabilities
Every label has inclusion probability , but equal inclusion probabilities alone are insufficient. For example, from six labels choose either or with probability . Each label is included with probability , yet eighteen of the twenty size-three subsets are impossible: this is a two-group cluster sampling design. Unequal probability sampling deliberately changes inclusion probabilities, often to improve precision for a particular estimand, and generally requires an appropriately weighted estimator rather than the plain sample mean.
Consider the original mathematical population with labelled values , and let . The fifteen equiprobable subsets, followed by their sample means, areTheir sample means sum to , giving expected value . Their squared deviations from sum to , giving variance . This is an enumeration over hypothetical selections from six stipulated numbers, not measured survey data.
All fifteen size-two subsets and all thirty-six ordered replacement outcomes from six labelled values
. Details. With independent uniform sampling with replacement, the ordered outcomes each have probability . The two orders and are distinct outcomes, and is now possible. Forgetting order does not make the resulting unordered multisets equiprobable: has probability but has probability . The thirty-six sample means still have expected value , but their squared deviations sum to , giving variance . Avoiding duplicate labels improves precision for this fixed population.
Simple random walk Created 2026-09-24 Updated 2026-10-14
A simple random walk on a locally finite graph chooses each vertex in the current vertex's graph neighbourhood with equal probability, assuming there is at least one available neighbour. On the integer line there are two choices, one unit left or right, so each has probability . This is the one-dimensional simple symmetric random walk. Terminology varies: a simple random walk on the integer line is also often allowed unequal step probabilities, with “symmetric” specifying the fair case.
For a simple symmetric random walk starting at , each increment has the Rademacher distribution, with expected value zero and variance one. Thus linearity of expectation and the variance of a sum of independent random variables giveFor example, after steps the expected value is zero, the variance is , and the standard deviation is . Doubling the typical distance scale takes four times as many steps. This square-root growth explains why a random walk can wander far even when there is no preferred direction.
Four fair and two biased unit-step random-walk paths, with their expected values and bands one standard deviation wide on either side.
Details. The colored curves are illustrative sample paths, not averages over all possible walks. The dashed curves show the expected values; the shaded bands show the expected value plus or minus one standard deviation at each time. These bands are a scale of spread, not confidence intervals, and give no guarantee that an entire sample path stays inside them.
Zero expected value does not make this a stationary process: its one-time probability distribution changes with , as the increasing variance already proves. It does have stationary increments and independent increments, because blocks of fresh steps have the same probability distribution at any starting time and disjoint blocks use independent random variables. This separation of position from increment is one reason the random walk is such a useful first example of a stochastic process.
Simple random walk on the integer line Created 2026-09-24 Updated 2026-10-14
A simple random walk on the integer line starts at and takes independent and identically distributed random variables as unit increments, withThe simple symmetric random walk has ; a biased random walk has . At or every step is deterministic, giving or respectively.
Count the rightward steps using indicator functions:Thus the endpoint is a shifted and rescaled random variable with a binomial distribution. For a worked example, at the endpoint means exactly three rightward steps and one leftward step. There are possible orders, so its probability is , equal to in the fair case. More generally the binomial coefficient counts the orders, giving the exact probability mass functionIn particular, the endpoint must have the same integer parity as : . For the support of a probability distribution is exactly . At only even integers in are reachable; at only odd integers are reachable. This restriction is easy to lose if one draws a smooth curve instead of discrete probability masses. The fair-walk counting argument is also presented in Grinstead and Snell, Introduction to Probability, section 12.1.
Exact binomial endpoint probabilities for fair walks of 20 and 80 steps and a biased walk of 80 steps; only even endpoints are possible.
Details. The endpoint identity and the binomial distribution give the expected value, variance, and standard deviationA short direct check gives and , hence . Then apply linearity of expectation and the variance of a sum of independent random variables.
The absolute width and the width relative to the number of steps answer different questions. In the fair case the standard deviation grows from to , while shrinks from to . At , the standard deviation is , or times the fair width, and . Centering and dividing by each walk's own standard deviation gives, for ,This rescaling equalizes the variances, not the entire probability distributions. The spacing between reachable endpoints is two, so its rescaled spacing is : approximately for the fair -step walk, for the fair -step walk, and for the biased -step walk.
The positions themselves are dependent. For , , where the second term is independent of . Their covariance is thereforeFor example, in the fair case allows or , whereas allows or . Nevertheless the position process is a Markov chain: given its current position, the next fresh increment has no dependence on its past. Its transition probabilities areThese transition probabilities are the same at every time and every integer position: shifting both and by the same integer leaves unchanged. Thus the Markov property and independent increments coexist with dependent positions.
Simulated annealing Created 2026-10-14 Updated 2026-10-18
Simulated annealing accepts worse feasible solutions to escape a local minimum. Minimize an objective function , analogous to energy. Effective temperature has the same units as , absorbing the Boltzmann constant; it controls exploration, rather than a material's thermodynamic temperature.[ref]
Optimization by Simulated Annealing by Scott Kirkpatrick and others. Printed pp. 672–673: effective temperature and cost as energy
Given current feasible point , draw from a proposal distribution . For a symmetric proposal distribution, , use the Metropolis–Hastings acceptance probabilityAccept with this conditional probability; on rejection retain . Every downhill or equal-cost proposal is accepted. Draw a fresh uniform random variable on and accept if . The off-diagonal transition probability includes proposing .[ref]
Optimization by Simulated Annealing by Scott Kirkpatrick and others. Printed p. 672: acceptance rule and rejected proposals
For a maximization problem with objective function , set : every improving proposed neighbor is accepted, and a worsening move of loss has conditional probability of acceptance, under the same symmetry assumption. Likelihood-power annealing uses precisely this sign convention for a log-likelihood. Retain the best feasible solution seen, since the current state can worsen even after a global minimum has been visited.
If the proposal distribution is asymmetric, use the full Metropolis–Hastings acceptance probability, for ,A missing reverse proposal gives zero acceptance. Even a downhill proposal need not be accepted with probability one in this case. Choosing uniformly among a variable number of neighbors is generally asymmetric: and give the correction , where is vertex degree.[ref]
The useful idea is to separate exploring from insisting on improvement: an uphill move can open a route to a better feasible solution. Its usefulness depends on the proposal distribution, the scale of the objective function, and the cooling schedule for simulated annealing. Finite practical schedules carry no general guarantee of finding a global minimum.
Fix a failure probability and assume an independent and identically distributed statistical sample. A finite-sample confidence band for its population cumulative distribution function isHere is the natural logarithm. The DKW inequality impliesThis is simultaneous coverage over the whole real line, valid at each fixed sample size.[ref]
To obtain the band, solve for the positive . Outside a failure event of probability at most , for every . Since a cumulative distribution function already lies in , clipping the endpoints to this interval preserves the coverage event. The guarantee is at least , and need not equal it.
Choose , giving at least simultaneous coverage under the stated model. For , respectively, the half-widths before clipping areFor the chosen five observations, the band at is , while at it is approximately . At the unclipped band would be , so clipping gives . The broad uncertainty is informative: five observations give a precise description of themselves, but a coarse bound for an unknown population cumulative distribution function.
Finite-sample simultaneous uncertainty around an empirical distribution function
. Left: the chosen five observations give and its band clipped to , using . Right: theoretical half-widths for , with no additional samples constructed. The confidence band has coverage at least under independent and identically distributed sampling; the drawing illustrates the procedure and does not establish its coverage. Details.A collection of pointwise confidence intervals only promises coverage separately at each preselected threshold; it does not promise coverage of an entire cumulative distribution function. Here the one simultaneous event permits inspecting any threshold after seeing the data. The probability refers to repeated sampling of the entire statistical sample, with fixed. It does not assign probability to a fixed after observing this particular band, and it is not a prediction interval for a future observation. The displayed comparison gives a guarantee for each fixed separately, not simultaneous validity over all sample sizes or an optional stopping rule. The chosen observations are an illustration; the coverage claim follows from the DKW inequality, not from their appearance or a simulation. Dependence or observations with different sampling laws require another argument.
At fixed , multiplying by divides the half-width by . Conversely, a desired half-width is ensured by , rounded up to an integer. For and , this sufficient sample size is . This makes the confidence band useful for planning how many observations are needed before estimating threshold probabilities to a chosen simultaneous accuracy.
Offer independent uniform edges of the complete graph per row and permit any one to be selected from each row. If a chosen graph has no graph component of order at least , the balanced component cut provides an empty cut whose sides both have at least vertices. Each candidate edge crosses that cut with probability at least , so a row can avoid crossing with probability at most . The union bound over at most cuts gives failure probability at most . Any fixed integer with suffices. The guarantee is simultaneous even for choices made after seeing every offered edge.
Simultaneous returns of independent simple random walks Created 2026-09-24 Updated 2026-11-05
For independent symmetric walks on , the probability that all are at the origin at time isThe Borel-Cantelli lemmas therefore show that simultaneous returns occur only finitely often almost surely when .
Simultaneous wavelet coefficient noise bound Created 2026-10-14 Updated 2026-11-05
For coefficient weights and independent mean-zero sub-Gaussian random variables of parameter , put . Multiplying moment-generating-function bounds shows that the weighted noise has parameter . The exponential Markov inequality, optimized in its parameter, gives tail bound . At the displayed thresholds, a union bound over coefficients gives simultaneous control with probability at least . No coefficient independence is required. Integrated wavelet weights satisfy . Finite variance alone only supports the weaker Chebyshev choice .
For N independent equivalent ion channels with open probability and approximately Ohmic open-state electrical conductance , the mean electric current is . A numerical Electrical conductance cannot be inferred without the relevant reversal potential or driving voltage.
Single-channel current-voltage relation 2026-10-14
For an ideal open ion channel with constant electrical conductance , membrane potential and reversal potential , define outward electric current as positive:This is an Ohm's law model of the open state, not a universal channel law or a rule for opening probability. In the synthetic figure, and . Because , the open-state electric currents at and are and . Zero electric current at the reversal potential does not imply a closed ion channel. Real ion channels can have nonlinear responses, so the straight line is an explicit idealization.
Single-offer reward-effort ambiguity 2026-10-25
Consider a logistic choice rule with and fixed noise scale. At one positive offer , changes satisfying leave utility and acceptance probability unchanged. One offer therefore cannot identify reward gain and effort cost separately.
For example, and both give at . Their predictions differ at other offers. Independently varying reward and effort can identify the two coefficients within this model when the design has rank two and choice data are informative. If noise scale is also unknown, its tradeoff with the coefficients requires additional constraints.
Single-photon source Created 2026-10-18 Updated 2026-11-05
A single-photon source prepares light with strongly suppressed simultaneous two-photon emission. One useful implementation repeatedly excites one discrete emitter and collects a selected radiative transition. Photon antibunching, measured through the zero-delay second-order correlation , tests the multiphoton suppression; a weak coherent beam retains Poissonian number fluctuations. Collection efficiency and multiphoton probability are distinct properties.
Single-photon state Created 2026-10-24 Updated 2026-11-05
A single-photon state lies in the one-excitation sector of the quantized electromagnetic field. It can be a quantum superposition over spatial ports or temporal modes while its total photon number remains one. Squared coefficients give exclusive event probabilities only when the corresponding wavepacket modes are orthonormal; overlapping temporal histories must be added coherently.
Single-qubit interference with conditional environment states Created 2026-10-14 Updated 2026-11-05
Prepare a qubit in , apply a phase gate , and correlate its computational basis states with normalized environment states . Write . After a final Hadamard gate, the environment amplitude accompanying output zero is . Its squared norm is . Thus is the interference visibility, while shifts the fringe. This quantum decoherence map commutes with the phase gate, so placing it immediately before that gate gives the same probabilities.
Single-sample distribution in Simon's algorithm Created 2026-09-29 Updated 2026-11-05
If the hidden string is zero, one oracle-Hadamard run samples every with probability . If the hidden string is nonzero, it samples every satisfying with probability and every other string with probability zero. Pairing with makes the forbidden amplitudes cancel.
Singular continuous distribution Created 2026-10-31 Updated 2026-11-05
A probability distribution is singular continuous if it has no point masses and assigns probability one to a set of zero Lebesgue measure. Its cumulative distribution function is continuous, but the distribution has no probability density function with respect to Lebesgue measure. This distinguishes continuity of the cumulative distribution function from an absolutely continuous probability distribution, whose probabilities are integrals of a probability density function.
Singular obstruction to normalized quantum matrix multiplication Created 2026-10-06 Updated 2026-11-05
If lies in the kernel of , then has no normalized quantum state. A request to produce that normalized vector with positive probability is consequently undefined. For example, on one qubit has distinct dyadic eigenvalues, but annihilates . The corrected filtering assertion requires ; it cannot be repaired by assigning a positive success probability to this input.
Site percolation Created 2026-09-24 Updated 2026-10-14
In independent site percolation with parameter , each vertex of a graph is open with probability , independently of the others. Retain those vertices and every original edge whose two endpoints are retained. This gives an induced subgraph, whose connected components of a graph are the percolation clusters. A closed vertex is absent from the usable network, whereas bond percolation keeps all vertices and instead removes individual edges.
A specified simple graph path of edges has distinct vertices. Its probability of being entirely open is therefore , including the starting vertex. Conditional on that vertex being open, it is by independence. For a two-edge graph path at , the unconditional probability is , compared with in bond percolation. This comparison concerns a fixed route; percolation critical probabilities require analysis of all possible routes on the specified infinite graph.
Size bias Created 2026-10-31 Updated 2026-11-05
Reweight probabilities proportionally to the nonnegative value being observed, then divide by its positive finite expected value. This produces a size-biased distribution. Values twice as large receive twice the original relative weight; this is a change in the sampling law rather than a deterministic multiplication of the sampled value.
Size-biased geometric distribution Created 2026-10-31 Updated 2026-11-05
For the positive-support geometric distribution with success probability , size bias gives . The sum of two independent copies has positive-integer decompositions at value , so its shifted probability is exactly this expression. Its probability generating function is , also obtained by the size-biased probability generating function identity.



