Series reliability system 2026-11-05
A series reliability system works only when every required component works. With component lifetimes , its lifetime is . For independent component survival events,
Two independent components each reliable with probability therefore give system reliability . A pump that requires both a motor and a controller is a functional series system even if its wiring is not literally in series. For independent exponential distributions of lifetimes with rates , : adding required components adds failure rates. Shared causes of failure require a joint probability distribution rather than this product.[ref]
Sex-linked cousin kinship 2026-10-14
For otherwise outbred opposite-sex first cousins, the probability that the mother's randomly transmitted X copy matches the father's X by descent depends on which of their parents are siblings. It is zero when the male cousin is related through his father, when the female cousin is related through her father and the male through his mother, and when their mothers are sisters. Daughters can be X-autozygous; sons have one X and a Y and are not homozygous for a paired X chromosome. Recombination and pseudoautosomal regions require a locus-based formulation instead of whole-chromosome blocks.
Shannon-Fano-Elias code 2026-10-31
For positive source probabilities in a fixed order, let and . The Shannon-Fano-Elias code uses the first binary digits of the midpoint , using the terminating-zero expansion at dyadic rationals. Its dyadic interval contains and has width at most , so it lies inside the probability cell . These cells are disjoint, whereas a codeword that is a prefix of another has a dyadic interval containing the other interval. The code is therefore a prefix code. Since , averaging proves . This is a direct cumulative construction and does not require sorting the probabilities or constructing a Huffman tree.
For a finite source alphabet with at least two symbols and strictly positive weights, every ternary prefix code minimizing weighted codeword length has all internal vertices of outdegree three, except possibly one of outdegree two whose tree children are deepest tree leaves.
To prove this, let be the greatest tree leaf depth. A missing tree child at any depth would permit moving a deepest tree leaf into that vacant branch, strictly reducing its positive weighted cost. Thus all internal vertices above depth have three tree children. Tree parents at depth have only tree leaves as tree children; one tree child would permit contraction and strict improvement. If two such tree parents each had two tree children, move one tree child of the second into the first tree parent's third slot, preserving its depth, and contract the second tree parent's remaining tree child. This again strictly improves cost. There is therefore at most one binary tree parent. If the number of symbols is an odd number, the leaf-count formula for a full ternary tree forces to be an even integer; since , there is no binary tree parent.
Strict positivity matters. For probabilities , the prefix code minimizes expected codeword length at one trit, yet has unary vertices and a deepest tree leaf without a sibling codeword. Removing or rearranging zero-weight branches can select a reduced minimizer, but arbitrary minimizers need not have the positive-weight shape.
Shapley value 2026-10-06
The Shapley value averages each player's marginal contribution over uniformly random player orderings. Exactly orderings have immediately before player , giving the formula. The values sum to by telescoping each ordering. In a simple cooperative game this is the probability of being pivotal. For a convex cooperative game, Shapley value belongs to the core of a convex game guarantees a stable allocation as well.
Suppose the distinct required runway lengths are , with users of type , constant cost per unit length, and suffix counts . Then every type- user has the displayed Shapley value. For layer , exactly users require it. The first of them in a uniformly random permutation contributes its entire cost . Each requiring user has probability of being first. Linearity of the Shapley value sums these expected marginal contributions across the layers that user needs.
The allocation lies in the cost core. Its payments sum to the full runway cost. For any coalition , its total payment toward layer is , where is the set of users requiring that layer. This is zero if needs no such layer, and at most the full layer cost otherwise. Summing gives . Suffix counts followed by prefix sums compute all distinct type payments in arithmetic operations.
In a uniformly random player permutation, edge contributes to 's marginal contribution exactly when precedes , which occurs with probability . Sum these expected contributions over incident graph edges to obtain the displayed Shapley value. This proof works for arbitrary real edge weights; nonnegativity is not required.
An entrepreneur is indispensable and a coalition containing the entrepreneur and of workers earns ; a coalition without the entrepreneur earns zero. A worker's marginal contribution is nonzero only when the entrepreneur precedes them. The probability that the entrepreneur and exactly other workers precede that worker is , giving the displayed common Shapley value wage. The entrepreneur receives . Convex nondecreasing makes all marginal contributions increase with predecessor sets, so the whole Shapley value allocation belongs to the core.
Draw one random variable , taking values zero and two with equal probabilities. Conditional on , generate a Poisson point process on the real line with constant rate . This is a Cox process directed by the random measure : the same rate is shared by every window. It is a locally finite simple point process and a stationary point process. The law of total expectation gives ; the law of total variance and law of total covariance give, for bounded Borel sets with ,
The conditional covariance vanishes by independence, but the shared conditional means fluctuate together. This distinguishes conditional from unconditional independence.[ref]
For a window of length , the exact probability mass function is
In particular, its void probability functional is , compared with for the unit-rate Poisson point process. Whole realizations can be empty or comparatively crowded, while their mean density remains one. This example demonstrates shared-rate statistical dependence, rather than a model of short-range offspring clusters.
Choose one random variable with the continuous uniform distribution on , and reuse it in every event:
Each probability is , so their harmonic series diverges, just as in summable and harmonic event probabilities. But the events are decreasing: . For every outcome , all indices with fail. Only finitely many events occur on that outcome. The limsup of events is exactly , a zero-probability event. This is a concrete closed-interval version of the shrinking-interval dependence example.[ref]
The missing assumption is visible already in two events. For , their intersection is , hence
Moreover, the whole tail union is just , with probability . This calculation explains directly why divergence alone fails: overlapping events keep spending their individual probabilities on the same outcomes.
Let be the total number of occurrences, a sum of indicator random variables. Although almost surely, Tonelli theorem gives . More explicitly, for : very small positive values of give very long, but finite, initial runs. Infinite expected value does not imply a positive probability of an infinite count.
Figure 1.
Equal harmonic event probabilities with fresh independent inputs or one shared input
. Each row is one finite simulation of the indicator random variables of for ; a dot means the event occurred. Fresh independent random variables allow scattered returns; a shared uniform random variable yields an initial run followed by zeros. The horizontal axis uses a logarithmic scale to show early runs clearly. These finite simulations illustrate the two models and cannot prove infinitely many occurrences or eventual stopping. Details.
Sharp threshold Created 2026-10-14 Updated 2026-11-05
For a sequence of nontrivial increasing events on finite product measures, write for the parameter at which the success probability is . An additive sharp threshold means that for every fixed . When the threshold parameter itself tends to zero, relative sharpness instead compares this window with ; additive sharpness alone is then a weaker assertion. The Friedgut-Kalai sharp threshold theorem provides an explicit additive bound for transitive increasing events.
Shifted-exponential Poisson mixture Created 2026-10-07 Updated 2026-11-05
When the random intensity is with having an exponential distribution of rate , the mixed count is the sum of independent Poisson distribution and support-zero geometric distribution counts. The Poisson parameter is and the geometric success probability is . At the law is geometric.
Shot noise counting model Created 2026-10-18 Updated 2026-10-20
Let be the magnitude of each transferred electric charge, and let arrivals form a Homogeneous Poisson process of rate . Extend the stream over past and future times when considering stationary filtering. For electrons, , the elementary charge. Choose the positive electric current direction to follow these transfers, so is its mean magnitude. If counts arrivals in a gate of duration , then
The gate's transferred electric charge is , and its average electric current is . Scaling the expected value and variance gives
More arrivals increase the absolute fluctuation but decrease its size relative to the mean. For an original count example with , the mean count and its variance are both , the standard deviation is , and the relative standard deviation is . The probability of no transfer is ; the probability of four is . A constant arrival rate does not prescribe four arrivals in every gate.
These are fluctuations of a time average, not the variance of an ideal instantaneous electric current. A model of point transfers has arbitrarily sharp impulses; it acquires a finite measured variance only after specifying a gate or linear filter. Actual collection pulses have finite duration and electrical circuits have finite response times.
The Fano factor compares count variance with its mean over a specified gate. For a stationary unidirectional stream with fixed charge , finite count second moments, and a generalized autocovariance with finite integral so that the long-gate limit exists,
The zero-frequency relation concerns the continuous fluctuation spectrum, excluding the mean spectral line. It follows by writing as the double integral of the current autocovariance; for long , its leading term is . A finite-gate , a frequency-dependent ratio , and a factor inferred from one filtered variance are not interchangeable. The last is weighted by the instrument's .
Two original counting counterexamples show why electric charge discreteness is insufficient. In independent time slots, transfer one charge with probability in each slot: the binomial distribution gives mean , variance and Fano factor . A random common origin for the slots removes a preferred time origin; the long-gate factor remains . Alternatively, if independent Poisson process bursts each transfer exactly two charges, then gives and factor . Both count individual charges; only the first model allows at most one per slot, and the second groups them in pairs.
Consequently is a reference for independent unidirectional arrivals, not a universal noise law for all electrical conductors. Correlations, charge multiplication, and bidirectional transfer require a more specific model. For example, independent opposite streams with positive current magnitudes and have net mean but one-sided fluctuation spectrum . Using would miss their fluctuations when the net current is small. At thermal equilibrium, the full transport model must also respect thermal electrical noise; adding unrelated phenomenological formulas can double count the same underlying transfers.
Sibling IBD ascertainment under multiplicative penetrance Created 2026-10-13 Updated 2026-11-05
For full siblings in an outbred pedigree, condition on both being affected under multiplicative diallelic penetrance and on residual disease outcomes being independent given their genotypes. The usual Mendelian IBD sharing of full siblings probabilities are weighted by , respectively, giving the displayed conditional sharing probabilities. Since , , strictly for a polymorphic locus with a nontrivial effect.
Sibling recurrence risk Created 2026-10-13 Updated 2026-11-05
Sibling recurrence risk is the conditional probability that another child has the disease, given an affected sibling. For unaffected parents, complete penetrance and a single recessive disease allele, the affected child identifies both parents as genetic carriers. Independent Mendelian segregation then gives recurrence probability , whether or not the parents are related. Incomplete penetrance, phenocopies, different causal loci or affected parents change this calculation.
// Target: biology.bigb
Let a random vector have a finite actual range of values. Its nonempty fibres partition the sample space, and every event in is a union of those fibres. Thus each fibre is an atom of a sigma-algebra and has exactly elements. This assertion concerns the actual range; additional values attained only on null sets must still be counted when working with an uncompleted sigma-algebra literally.
To verify the claim, the fibres belong to as preimages of singleton Borel sets. Their unions form a finite sigma-algebra making measurable, so minimality of the generated sigma-algebra gives the reverse inclusion. Distinct subcollections have distinct unions because the fibres are nonempty and disjoint.
Consequently a finite history of finite-valued observations generates a finite natural filtration at each fixed time. It may be strictly smaller than the filtration of its driving continuous observations: a single uniform random variable already generates infinitely many distinct events with different probabilities.
Significance level Created 2026-09-24 Updated 2026-11-05
The significance level is the chosen upper bound on a test's probability of rejecting the null hypothesis when it is true.
A result is statistically significant when its calibrated p-value falls below this chosen threshold.
Simes inequality Created 2026-10-05 Updated 2026-11-05
For independent valid null p-values, the displayed inequality follows by applying the Benjamini-Hochberg procedure with all nulls true. Its false discovery rate then equals the probability of at least one rejection. Valid means for ; independence is a sufficient hypothesis, and arbitrary dependence is not covered by this proof.
Simple cooperative game 2026-10-06
A simple cooperative game is a monotone transferable utility game in which each coalition either loses, with value zero, or wins, with value one. In the usual nontrivial convention the empty coalition loses and the grand coalition wins. The Shapley value is then the probability that a player changes a losing coalition into a winning one when players enter in uniformly random order.