Weak selection 2026-11-05
Weak selection is a regime of an evolutionary model in which the focal trait or interaction changes biological fitness only slightly relative to a baseline. It permits calculations close to neutral evolution. In one common evolutionary game theory convention, a payoff changes biological fitness according to
where controls the contribution of the game. Weak selection requires the payoff-dependent change to be small on the scale of baseline biological fitness.[ref]
For example, take and two competitors with payoffs and . Their fitnesses are and . If their chances to fill a vacancy are proportional to biological fitness, the second competitor wins with probability
only slightly above the neutral value . This invented calculation shows the meaning of a small selective bias. A small numerical would not ensure the same approximation if the payoffs were made enormously larger. Weak selection is also distinct from small biological population size: the strength of genetic drift and the cumulative effect of selection depend on additional features of the model.
Weighted graph Created 2026-09-24 Updated 2026-11-05
An edge-weighted graph assigns a numerical weight to each graph edge. The meaning depends on the model: a weight can be a length, a cost, or an electrical conductance. Arbitrary weights do not automatically define transition probabilities.
For the random walk convention used here, take a locally finite undirected graph with symmetric nonnegative electrical conductances , and optional nonnegative killing weights . Assume
The Markov chain moves from to with probability and goes to a cemetery state with probability . These probabilities sum to one. With no killing, detailed balance holds with respect to the measure ; normalization gives a stationary distribution when its total mass is finite.
For example, electrical conductances and on the two edges incident to an graph vertex give outgoing probabilities and . Treating the same weights as electrical resistances would require reciprocal electrical conductances and reverse these preferences. The distinction is essential in the electrical network interpretation.
For two configurations , the weighted Hamming distance for the noisy voter model is , where is the stationary distribution of the copying walk. On a connected undirected graph, . Positive weights make this a metric, with values between zero and one.
Couple two chains using the same uniformly selected vertex, refresh decision, fresh bit and copied neighbor. If the refresh probability is , stationarity gives . Copying redistributes disagreements without increasing their stationary-weighted total in expectation; refreshes remove them. The factor belongs to the single-vertex update convention, not a simultaneous update of every vertex.[ref]
Wild bootstrap 2026-10-14
For independent mean-zero errors in a fixed-design regression, form , where the independent multipliers have mean zero and variance one, and refit. Rademacher multipliers taking the values and with equal probability are a simple choice. Conditional on the data, the bootstrap errors have mean zero and preserve observation-specific residual variances, supporting heteroscedasticity rather than imposing a common residual distribution. Appropriate leverage corrections and regularity assumptions are required for accurate studentized inference.
Wilson's algorithm Created 2026-09-24 Updated 2026-11-05
For a finite connected graph, Wilson's algorithm starts with a chosen root as the current tree. Choose an unvisited vertex, run a random walk until it hits the current tree, erase loops in chronological order, and attach the resulting simple path. Repeat until every vertex belongs to the tree.
Each attached path has no repeated vertices and first meets the old tree at its endpoint, so attachment preserves connectedness and cannot create a graph cycle. Finiteness and connectedness make each hitting time finite almost surely. The output is a uniform spanning tree, and its law does not depend on the order in which starting vertices were chosen.
For positive electrical conductances , use transition probabilities . The output then has probability proportional to . The proof uses cycle popping: independent stacks of prospective outgoing edges can be exposed and cyclic choices discarded in any order without changing the final rooted tree.[ref]
Winning probability 2026-10-06
A winning probability is the probability that a specified participant receives the prize, conditional on the submitted efforts and the allocation rule's randomization.
Wired random-cluster boundary condition Created 2026-10-06 Updated 2026-11-05
All boundary vertices are identified into one vertex for component counting. This is the most wired random-cluster boundary condition on a fixed boundary, and maximizes increasing-event probabilities when by boundary monotonicity of the random-cluster measure.
WKB tunnelling exponent 2026-10-20
For an opaque barrier between simple turning points, the leading transmission probability is , where over the forbidden interval. The exponent for probability is twice that for amplitude. Matching determines prefactors and the domain where this approximation applies.
The drive can supply or extract work while the quantum state stays approximately fixed. For a differentiable bounded Hamiltonian operator, the Schrödinger equation gives
The state-evolution terms cancel, leaving the external drive's power. For a finite ideal step the change in mean energy is . Thus conservation of energy for a closed system with a time-independent Hamiltonian operator does not assert conservation of the driven subsystem's energy during switching.
Specify work operationally by two energy measurements: one before the switch and one after. For the prepared initial ground state, the first outcome is definite; the second samples the new Born rule probabilities. This protocol gives a distribution of measured energy differences, rather than generally the measurement distribution of the single operator .[ref]
and hence
For and , the work is or , with probabilities and ; its expectation is and its variance is . The initial mean energy becomes . Using different initial and final scalar offsets would also shift the measured work; the displayed Hamiltonian operators fix that convention explicitly.
Zero-event binomial upper confidence bound Created 2026-10-14 Updated 2026-11-05
If and is observed, the maximum-likelihood estimate of is zero. A one-sided upper confidence bound solves , so . For large , , giving approximately at 95% confidence. This describes uncertainty after no observed events, rather than proving that the underlying probability is zero. It assumes independent observations with a common event probability; clustered data require a different uncertainty calculation.
Zero-flow steady gyrotactic orientation distribution Created 2026-10-14 Updated 2026-11-05
For aligning rate , positive rotational diffusivity and , the zero-current steady Fokker-Planck equation gives . Normalization over the unit sphere gives the displayed density per unit solid angle. Its mean direction is , the Langevin function. As , it concentrates weakly into a point mass at the upward pole; the limit is not an ordinary bounded probability density.
Zero-flux boundary condition Created 2026-09-28 Updated 2026-11-05
A Zero-flux boundary condition sets the normal probability current to zero. It conserves total probability inside the domain and represents reflection for a confined diffusion.
Zero-inflated Poisson regression Created 2026-10-06 Updated 2026-11-05
A zero-inflated Poisson regression specifies a structural-zero probability and a susceptible-component Poisson distribution mean . In this parametrization,
The mean is . Logistic predictors for and logarithmic predictors for allow covariates to affect component membership and count intensity differently. A susceptible individual can still generate a zero count; susceptibility is not equivalent to an observed positive response.
At fixed odd , the zero-temperature canonical ensemble equally weights the ground states of an antiferromagnetic Ising ring. The single frustrated bond in an antiferromagnetic Ising ring lies on a chosen -bond path with probability . The Ising spin product is if the path excludes that bond and if it includes it, proving the displayed two-point correlation function. The loss of staggered alignment upon averaging persists at zero temperature and is caused by geometric frustration, rather than a positive density of thermal defects. The expression remains symmetric under for odd .
Zero-truncated binomial distribution Created 2026-10-14 Updated 2026-11-05
The zero-truncated binomial distribution has probabilities for . Its natural parameter is and its cumulant is . mean and variance are and , where . The conditional normalizer depends on , so its likelihood is not proportional to the untruncated likelihood even after a positive observation. At and , its likelihood supremum is at rather than at .
Zero-truncated claim-count distribution Created 2026-10-06 Updated 2026-11-05
For a nonnegative integer claim count with , the conditional law given has masses for . Its probability generating function is . Truncation at zero is meaningful only when the positive-count event has positive probability.