Penetrance Created 2026-10-13 Updated 2026-11-05
Penetrance is the probability of an expressed phenotype conditional on a specified genotype. It can depend on age, sex and environment. A fully penetrant recessive model assigns disease probability one to the recessive homozygote and zero to other genotypes; incomplete penetrance or phenocopies replace these indicators by intermediate probabilities.
Percentage point 2026-10-25
A percentage point is one hundredth on a probability or proportion scale. A change from to is percentage points, while the relative increase is . These answer different questions and have different denominators.
Percentile Created 2026-10-20 Updated 2026-11-05
Percolation critical probability Created 2026-09-28 Updated 2026-10-14
For the rooted infinite model defining percolation probability, the percolation critical probability isBelow , the root has probability zero of belonging to an infinite percolation cluster. Above , that probability is positive, by the definition and the monotone coupling of Bernoulli percolation. The definition alone does not determine behavior at , or the numerical value of : these require results specific to the graph and the model.
A finite graph with edges has open/closed configurations. The probability of any connectivity event is a finite sum of terms , hence a polynomial in . The square's is an example. These finite probabilities vary smoothly, although an infinite-system limit can distinguish a whole interval with from one with . A steep finite connection curve and a mathematically proved percolation critical probability are different kinds of information.
Percolation probability Created 2026-09-28 Updated 2026-10-14
For independent bond percolation on an infinite graph with a specified root , let be its percolation cluster. The percolation probability isIt concerns the root, rather than the existence of an infinite percolation cluster somewhere else. Even above the percolation critical probability of the square lattice, an isolated root has probability , because its four incident edges can all be closed. Thus when . Positive percolation probability does not mean every vertex is connected to infinity.
On the square lattice, the events that is joined by an open path to the boundary of decrease as increases. Their probabilities converge to by continuity from above of a measure. This relates an infinite question to finite observations, without equating any one finite boundary connection with survival forever. The monotone coupling of Bernoulli percolation shows that is a monotone function of .
Percolation theory Created 2026-09-24 Updated 2026-10-14
Percolation theory asks how many local connections must be available before a large connected structure appears. Start with a graph, randomly retain some edges or vertices, and study the resulting percolation clusters. In independent bond percolation, every edge is open with probability , independently of the others. In independent site percolation, the random decisions concern vertices instead. A percolation cluster is a connected component of a graph formed by the available connections; an open path joins two vertices exactly when they belong to the same percolation cluster.
The attraction is that a local rule can produce a global change. One open edge says little about travel across a large graph. Many alternative graph paths can nevertheless make distant connections likely. The model separates the geometry of possible connections from the probability distribution of which connections are usable. This was the central perspective of Broadbent and Hammersley's 1957 paper, which discussed porous solids and disease transmission as interpretations of the same mathematical structure: [ref]
https://courses.physics.ucsd.edu/2019/Spring/physics235/Broadbent_Hammersley.pdf. Percolation processes I: Crystals and mazes, introduction
. Independent bond percolation supplies a simplified model of those systems; the physical interpretation still requires justification of its independence assumptions.For a completely calculable example, consider the four edges around a square and ask whether opposite corners and are connected. There are two graph paths, each using two edges. Each open path has probability . Their events are independent events because the paths share no edges, even though they share endpoints. The inclusion-exclusion principle therefore givesAt , the connection probability is , larger than the for either chosen graph path. Counting all sixteen equally likely edge configurations gives the same answer: two configurations with exactly two open edges, four with three, and one with four connect to . Connectivity benefits from alternative routes; adding their probabilities without subtracting their overlap would count the all-open configuration twice.
Two alternative paths increase the probability of connecting opposite corners
. Details. This finite calculation is already useful for studying redundant connections. The deeper question is what happens as the graph becomes arbitrarily large: does connectivity remain confined to finite percolation clusters, or can an infinite percolation cluster appear? The percolation probability and percolation critical probability make that question precise. A finite picture can illustrate the geometry, but cannot establish the existence of an infinite percolation cluster.
Percolation triangle condition Created 2026-10-07 Updated 2026-11-05
For independent bond percolation on , let be the critical percolation two-point connection probability. The percolation triangle condition istranslation invariance makes this a threefold discrete convolution evaluated at zero. The factors describe connections between three positions; their product is a diagrammatic weight, rather than the probability of three independent events in a single configuration.
The condition controls the intersection corrections that separate percolation clusters from a simple branching approximation. In the homogeneous setting, it implies the mean-field percolation exponents value for the divergence of percolation susceptibility. It must be established for the particular model; lace expansion provides one method in suitable high-dimensional models. The condition is therefore a useful bridge between spatial connectivity estimates and critical behaviour, rather than an assumption automatically satisfied at criticality.[ref]
Tree graph inequalities and critical behavior in percolation models by Michael Aizenman and Charles M. Newman. Triangle convergence criterion and susceptibility exponent; original paper, Journal of Statistical Physics 36 (1984), pages 107–143
Percolation two-point connection probability Created 2026-10-06 Updated 2026-10-07
The two-point percolation two-point connection probability is the probability that two fixed graph vertices belong to the same percolation cluster. On a translation-invariant lattice it depends on their displacement. Restricting the permitted connecting graph paths to a subgraph gives the corresponding confined percolation two-point connection probability. The Harris-FKG inequality implies .
Perfect secrecy of Shamir's threshold scheme Created 2026-09-29 Updated 2026-11-05
In Shamir's secret sharing, observing any shares leaves the secret's prior distribution unchanged. In particular, the posterior distribution is uniform if the prior distribution was uniform; uniformity of the secret is not required for perfect secrecy.
To prove this, fix distinct nonzero evaluation points and a candidate secret . The evaluations impose independent linear equations on the random coefficients. The evaluation matrix has rank : its first columns form a Vandermonde matrix multiplied by a nonsingular diagonal matrix of nonzero evaluation points. Every observed share tuple therefore has exactly compatible coefficient tuples. Since the coefficients were independently uniform, its conditional probability isindependent of . Thus the shares and the secret are independent random variables, which proves perfect secrecy.[ref]
How to Share a Secret by Adi Shamir. Pages 612–613: interpolation argument for fewer than the threshold number of shares
Period-two martingale corrector for a birth-death chain Created 2026-10-14 Updated 2026-11-05
For a birth-death chain on the integers with right/left probabilities depending on parity , define . It is a harmonic function for a Markov chain exactly whenequivalently . The correction is bounded. Stopping this martingale at boundaries gives a lower exit Probability tending to as , even though the original position need not be a Martingale.
// Target: markov-process.bigb
Permanent as probability of distinct independent choices Created 2026-10-14 Updated 2026-10-20
Let be independent random variables, each choosing a label from . Put their probabilities in the matrix , where . Each row sums to one. All choices are distinct precisely when their ordered list is one of the permutations of the labels. These are mutually exclusive events, and independence makes the probability of one list equal to . Adding the list probabilities gives the permanent of a matrix:In particular, this permanent lies between zero and one.
For a two-person example,The distinct outcomes and have probabilities and . ThereforeThe colliding outcomes and have probabilities and , totaling . All four outcomes are shown below; their probabilities sum to one.
The permanent adds the probabilities of distinct choices: two successful outcomes have total probability 0.65
. Details. If every choice has the uniform distribution on a finite set of labels, then and the distinct-choice probability is . For three choices and three labels it is . This counts a subset of all ordered outcomes, not independent pairwise collision events. Independence of the original choices is essential: without it, the individual rows of do not determine the joint probabilities.
Permutation-preimage quantum search Created 2026-10-06 Updated 2026-11-05
To find an input of a permutation whose output lies in a known -element subset, compute the output, apply its marked-state phase oracle, and use uncomputation. A modular-addition quantum oracle costs two forward queries per marked reflection, because modular-oracle inversion by negation supplies its inverse. Amplitude amplification then uses queries for fixed success probability. Positive-square outputs have and hence query cost .
Perplexity 2026-11-05
Perplexity measures how much probability a model assigns to observed outcomes, expressed as the inverse geometric mean of those probabilities. For a sequence evaluated by a neural language model, let be the model's conditional probability of the actually observed token given its allowed context. ThenIt is therefore exponentiated mean negative log-likelihood. If cross-entropy is expressed in bits rather than natural-log units, the equivalent expression is .[ref]
A Neural Probabilistic Language Model by Yoshua Bengio and others. §2, printed p.1141, opening definition of perplexity
A uniform predictor over possible tokens assigns each observed token probability , giving perplexity . For an unequal two-token example with assigned probabilities and ,The result need not be an integer or an actual vocabulary size. It is an effective branching measure defined by the likelihood calculation.
On a fixed evaluation representation and dataset, lower perplexity means higher geometric mean probability for the realized outcomes. Assigning zero probability to any realized outcome makes the unsmoothed sequence perplexity infinite. Correctness of the most probable token alone does not determine the metric: the probabilities assigned to all realized outcomes matter.
For an empirical example, the 2003 neural-language-model paper reports test perplexity for its MLP1 row, compared with for the five-gram back-off comparison row. These are measurements under the paper's Brown-corpus setup and token-counting conventions.[ref]
A Neural Probabilistic Language Model by Yoshua Bengio and others. §4.1, printed p.1148, token conventions; Table 1, p.1149, test-perplexity column
Changing tokenization, vocabulary, punctuation or sentence-boundary treatment changes the outcomes and the divisor . Per-word and per-subword scores therefore cannot be compared as if they measured the same event space. Perplexity is also distinct from BLEU, which compares generated text with references rather than directly averaging the probability of observed tokens.
Persistence of unsampled graph components 2026-10-07
Fix positive , and . Suppose a size band of an Achlioptas process contains at least vertices at time . For every fixed , at least of those vertices remain in unchanged graph components throughout the next steps, with high probability, where one may take . This is a deliberately nonoptimal positive constant.
For independent uniform candidate edges, an initial graph component with vertices is untouched if none of the candidate edges meets it. A uniform edge hits it with probability at most . For sufficiently large , , so the expected value of the untouched vertex mass is at least . Replacing one row of two candidate edges can change by at most , because only the initial graph components hit by an old or new endpoint can change status. The McDiarmid inequality therefore makes except on an event of probability , for a positive constant depending only on . An untouched graph component stays unchanged whichever offered edge is selected.
For candidates restricted to absent edges, generate each by an independent uniform proposal stream and reject already present edges. During any interval of steps with present edges, each proposal has rejection probability conditional on the past. The number of rejections is at most except on an event of probability smaller than any inverse power of : if there were rejections among proposals, a union bound over their positions bounds this by . The first proposals are independent and give the previous untouched-mass estimate. Extra proposals can touch at most additional initial graph components, losing only vertices for fixed . This leaves the stated bound. A union bound makes these estimates simultaneous over starting times . They hold through the entire interval, so deterministic or random stopping times within it are allowed.
Peter M. Aronow 2026-11-05
Peter M. Aronow develops statistical methods for causal inference, particularly design-based inference. Yale's institutional biography identifies research on complex experimental designs, network settings and incomplete survey data alongside appointments spanning political science and statistics.[ref]
Peter M. Aronow profile by Yale School of Public Health. Titles and Biography, design-based methodological research
His joint work with Cyrus Samii studies how to estimate sampling variance when a sampling design never observes some pairs together. A missing product cannot simply be deleted from the population variance formula: doing so can produce either sign of bias. Their construction uses Young inequality to bound unobserved products by individually estimable powers and obtain a conservative variance estimator.[ref]
Conservative variance estimation for sampling designs with zero pairwise inclusion probabilities by Peter M. Aronow and Cyrus Samii. Section2.2, Proposition1; Section3.1, Proposition2; Section3.2, quadratic special case
For an original exact illustration, choose one of two fixed values with equal probabilities. As in the single-draw variance identifiability obstruction, the Horvitz-Thompson estimator has true variance . Retaining only diagonal contributions gives , withOpposite signs therefore produce downward bias. The elementary inequality , obtained from , instead givesConsequently is a conservative variance estimator for this stipulated sampling design; its excess in expected value is exactly .
With , the true variance is16. The two possible values of are18 and2, averaging10; those of are36 and4, averaging20. Although , a realized value of can be below16. Conservativeness here is an expectation inequality, rather than a bound for every sample. By itself it also does not prove a specified confidence interval coverage probability.
Phase-known genotype Created 2026-10-13 Updated 2026-11-05
At several genetic loci, a phase-known genotype specifies which alleles occur together on each chromosome, hence its two haplotypes. An unphased multilocus genotype may be compatible with several haplotype pairs. For two heterozygous loci, and have identical unphased genotypes but different transmission probabilities when genetic linkage is present.
Phase shifter 2026-10-24
An optical element that adds a controlled wave phase to one path. On two path states, an ideal lossless phase shifter has the displayed unitary matrix. It changes their relative phase while leaving individual path probabilities unchanged; subsequent interference can turn that phase into an output-intensity change.
Phenomenological paired-pulse recovery Created 2026-10-14 Updated 2026-11-05
Choose the following original phenomenological mathematical model solely to calculate a paired-pulse readout. It is not experimental data, a fit to the teaching experiment, or a simulation of the Hodgkin-Huxley model. The conditioning action potential defines time zero. Test pulses have fixed width ; denotes their inward electric current amplitude. Impose an absolute neuronal refractory period . No finite test amplitude generates an event for . After that hold, stipulate a required amplitudewith , dimensionless and recovery time constant . Emit a test event exactly when , including equality. For this ideal event readout, assign events to pulse onset and assume the conditioning event is successfully evoked. There is no calculated membrane potential, spike waveform, response latency or stochastic success probability.
The exponential decay represents a combined recovery deficit; it is neither the Hodgkin-Huxley model's nor a measured potassium electrical conductance. One such curve cannot separately identify sodium recovery and persistent potassium electrical conductance. A constant pulse-width amplitude criterion also does not establish an equivalent rule for other pulse widths or voltage trajectories.
At the hold boundary, . At ,at ,Thus a test fails at because of the imposed hold, fails at because recovery is insufficient for that amplitude, and succeeds at . At , a pulse would instead succeed: failure of the weaker pulse was relative refractoriness.
For , solve using the logarithm. The earliest allowed delay isFor this is ; for it is . If , the imposed hold is the only delay restriction. If , no finite delay passes the rule: the required amplitude stays strictly above its asymptotic baseline. A finite experimental “fully recovered” time therefore also needs a tolerance and a readout definition.
Philip J. Boland Created 2026-10-18 Updated 2026-11-05
Philip J. Boland works on statistical and probabilistic aspects of reliability and the history of statistics. UCD's 2005–06 institutional record lists research interests in reliability theory, life testing, actuarial probability and mathematical statistics. These are historical affiliations and interests in that record, rather than a claim about his present appointment.[ref]
https://www.ucd.ie/students/t4media/2005-6%20science_pg.pdf. Printed p. 90, Philip J Boland staff entry
reliability theory connects distributions of component lifetimes to the behavior of a whole system. Statistical inference then estimates those lifetime distributions or compares designs from observed failures and surviving units. Boland also wrote the Dictionary of Irish Biography entry on William Sealy Gosset, connecting the mathematical development of small-sample inference with its industrial setting.[ref]
Institutional biographical record: www.ucd.ie/students/t4media/2005-6%20science_pg.pdf
Photon addition Created 2026-10-20 Updated 2026-11-05
Ideal conditional application of a creation operator, followed by normalization. It reweights the input number distribution as well as raising each occupied number by one. A heralded physical implementation has a success probability; the algebraic creation operator alone is not a trace-preserving deterministic quantum operation.




