Poisson point process Created 2026-09-24 Updated 2026-11-05
A Poisson point process is a point process with independent Poisson distribution counts on disjoint measurable sets. Its intensity measure specifies those counts: for ,Thus both the expected value and variance of are . The independence requirement concerns disjoint test sets; overlapping sets can share points and have dependent counts.[ref]
Lectures on the Poisson Process by Günter Last and others. Definition 3.1, Poisson count and disjoint-set independence requirements
For a homogeneous Poisson point process in Euclidean space, , with constant intensity and volume . For example, intensity on the real line gives expected count and empty-interval probability in a unit interval. Counts in two disjoint unit intervals are independent.
The counting measure formulation records multiplicity. A non-atomic intensity measure gives a simple point process, with no coincident points; an atom of a measure can instead carry a random multiplicity. Poisson random measures make that counting formulation explicit, while Poisson thinning theorem and the Superposition theorem for Poisson point processes explain useful ways of constructing related processes.
Poisson process Created 2026-09-24 Updated 2026-10-14
A Homogeneous Poisson process models arrivals at a constant rate . Its counting process counts arrivals in , with . Its paths are right-continuous nondecreasing functions, take nonnegative integer values, and have unit jumps almost surely. The defining Poisson distribution of each increment isIt has stationary increments: the probability distribution above depends on the duration , not the starting time . It also has independent increments: counts in any finite collection of disjoint time intervals are independent random variables. Together these conditions specify the joint count laws, not merely the Poisson distribution at a single time.[ref]
Poisson Processes (Chapter 2). pp. 78-79: counting-process definition and its equivalence to exponential interarrival times
The rate has units of arrivals per unit time; is dimensionless. The Poisson distribution givesFor a toy rate per minute and a duration of minutes, the expected value and variance of the count are both . The probability of no arrival is , and the probability of exactly three is . In two consecutive one-minute intervals, the probability of exactly two arrivals in the first and exactly one in the second is , using independent increments. These are exact model calculations with rounded decimals, not measured frequencies.
Synthetic arrival times and their right-continuous counting path, compared with the exact mean at two arrivals per minute
. Details. The diagram's nine hand-chosen arrivals illustrate a path; the line is an expected value, not a prescribed trajectory. Constant rate does not imply evenly spaced arrivals. Poisson interarrival times connect the count description to waiting, while Poisson thinning explains how independently routing arrivals produces separate streams. This makes the Poisson process useful as a simple arrival model for a queue, provided constant rate and independent increments are plausible. For a deterministic changing rate, use an Inhomogeneous Poisson process; bunching or history-dependent arrivals need additional assumptions. Conditional on , the arrival times are the order statistics of independent uniform distributions on , as developed in Poisson process conditional arrival times.
Poisson thinning Created 2026-09-24 Updated 2026-10-14
Poisson thinning splits a Poisson process by independently marking each arrival as retained or rejected. Let the original Homogeneous Poisson process have rate , and let be a deterministic measurable function of time. Attach independent uniform distributions on , independent of the entire original Poisson process. At arrival time , retain the arrival if . Given all arrival times, these decisions are independent and have the specified retention probabilities. Define the two counting processes using an indicator function:The Poisson thinning theorem gives independent retained and rejected Inhomogeneous Poisson processes. Their rates are and , respectively, in the sense of the intensity function of a point process. In particular, for ,The independence is of the two whole processes: every finite collection of retained counts is independent of every finite collection of rejected counts. It is not merely zero covariance for one interval. For constant , the streams are Homogeneous Poisson processes of rates and ; the endpoints include the identically zero stream.[ref]
Lectures on the Poisson Process by Günter Last and others. Definition 5.7, Proposition 5.5, Theorem 5.8 and Corollary 5.9, printed pp. 42-44: location-dependent independent marking, intensities, and independence of the split processes
For an exact toy calculation, take per minute and retain with on and on . In the first two minutes, the retained and rejected expected values are and . In the next two minutes they are and . Over all four minutes, are independent Poisson distributions with mean each, and their sum has mean . ThusThese probabilities and expected values describe the model, not empirical measurements. In the diagram, the original nine synthetic arrivals split into five retained and four rejected arrivals; those realized counts need not equal their expected values.
Independent marks split a synthetic Poisson arrival path, with exact expected counts for two time-dependent retention probabilities
. Details. The mechanism explains why mutually exclusive labels can yield independent counts: randomness of the original total offsets the dependence from allocating a fixed total. For constant and an interval with original mean , the conditional retained count has a binomial distribution given . The joint probability generating function isThis factorization proves the two independent Poisson distributions; disjoint original intervals give independent pairs. For varying , the Independent marking theorem for Poisson point processes gives the same conclusion with the two integrated intensities. The joint red and green Poisson count formula gives the corresponding direct calculation with probability mass functions.
Independence here is unconditional. After conditioning on , the identity gives covariance for constant . Thus the retained and rejected counts are dependent for and , even though their unconditional covariance is zero. Poisson thinning can model independent routing of arrivals, or independent detection of arrivals with a known efficiency schedule; using only a retention fraction without checking the marking mechanism can give a wrong count law.
Poisson thinning theorem Created 2026-09-24 Updated 2026-11-05
Independently retaining a point at with probability thins a Poisson point process of intensity to one of intensity ; retained and rejected processes are independent.
For independent standard normal random variables , put , , with and . The polar coordinates Jacobian determinant is , so the joint probability density is on . It factorizes into a Rayleigh distribution density for and a continuous uniform distribution density for . Consequently the radius and angle are independent. The change of variables for probability densities gives for , the exponential distribution of rate , also the chi-squared distribution with two degrees of freedom. Measurable transformation preserves independence, giving . The angle at is arbitrary on an event of probability zero.
Thus a sector with angular length has probability , independently of any radial restriction. For instance occupies a sector of angle and has probability .
Polarization CHSH count model Created 2026-10-18 Updated 2026-10-25
Let be orthogonal linear polarizations, and prepare the Bell state . The analyzer vector is ; its orthogonal companion has outcome . Direct inner products with the Bell state give and . Thus the expectation value of the outcome product is . These are physical polarizer angles; their corresponding Bloch sphere angles are doubled.
For a stipulated isotropic admixture, use the density matrixThe maximally mixed state contributes zero correlation, so for . Each local marginal is , independently of the other setting, illustrating quantum no-signalling. In this model is the interferometric visibility of the coincidence fringe; other noise models need not have one common visibility for every basis.
Choose , , and . The four correlations in the displayed CHSH inequality are . Consequently , exceeding the local bound exactly when . Perfect correlation at a single common setting would not yield this comparison between incompatible quantum measurements.
To connect probabilities with expected counts, stipulate emitted pairs per setting pair and independent detection efficiencies , independent also of settings, outcomes and hidden variables. The expected joint counts are . Their normalized correlation isFor original teaching inputs , , and , the expected counts are and . They total and give , hence . Fractional expected counts are not measured data. Efficiency cancels here because the loss model was specified to be independent; this algebra supplies no justification for discarding failures in an arbitrary Bell test with a detection loophole.
Ideal CHSH visibility threshold and expected detection counts
. Original model predictions, not experimental data. The first panel shows the visibility needed to exceed the local bound. The second uses 1000 emitted pairs, efficiencies 0.8 and 0.75, and visibility 0.8; each bar is an expected joint count. Details. Polarized beta-decay angular distribution Created 2026-10-18 Updated 2026-10-20
Consider a parent atomic nucleus at rest. Write its signed nuclear polarization along a fixed axis as , where is its maximal spin component. Let be the angle of the emitted electron momentum to that axis and let . Use for the parity operator, so it is not confused with .
For an axially symmetric leading-dipole model, retain a constant and the term linear in the polarization vector . Rotational symmetry makes the directional term proportional to . Define its dimensionless coefficient as . At fixed electron energy the relative intensity and normalized probability density function per solid angle are thereforeThe factor is the conventional separation of the speed dependence; rotational symmetry alone does not determine that dependence or . The coefficient contains the decay dynamics. This leading model omits higher angular terms and detailed recoil and radiative effects. A partially oriented higher-spin ensemble can also have alignment that is not specified by its vector nuclear polarization alone.
The unit-integral condition follows without any model of a detector:Thus has unit angular average, while the probability density function in the polar angle alone contains the Jacobian determinant factor:In particular, itself is neither a normalized probability density function in nor a detector count. Positivity on gives .
Under full spatial reflection, but . The latter follows already for orbital angular momentum from ; spin has the same axial vector transformation. Hence is a pseudoscalar, and . If parity conservation held for this model, equal probabilities for the inverted process would force . Conversely, in an unpolarized sample proves nothing about .
Integrating over the two hemispheres gives a useful original check:Choose , , and , so . Then the forward and backward hemisphere probabilities are and , and their counting asymmetry is . These are chosen teaching values, not measured values from the Wu experiment. At a single energy, the angular shape determines the product ; it cannot separately determine without a polarization calibration.
Chosen angular probabilities and detector-efficiency cancellation
. Original model with . The angular probability is distinct from a detector count; opposite hemispheres average the cosine to . Unequal efficiencies and exposures distort individual detector ratios, while a reversal cross-ratio recovers the chosen hemispheric asymmetry. All counts are constructed. Details.For independent lengths with the uniform distribution on , the probability of forming a nondegenerate polygon is . The necessary and sufficient condition is that every length is less than the sum of the others. The failure events are disjoint except on sets of probability zero. The sum of lengths has probability density function on , by repeated convolution of probability densities. A specified rod is too long with probability ; summing over the rods proves the formula. For three and four rods the probabilities are and .
Polynomial critical one-arm upper bound Created 2026-10-06 Updated 2026-11-05
At for independent bond percolation on the square lattice, there exist and with . The Russo-Seymour-Welsh theorem and the Harris-FKG inequality give a uniform positive probability of a closed dual graph cycle around each geometrically spaced square ring. The independent annular barriers for percolation give the polynomial bound and imply zero critical percolation probability. This does not determine the exact critical exponent.
Work in the finite field , using modular arithmetic modulo five. Consider the two original polynomial examplesThe distributive property gives , so all coefficients of cancel: is identically zero. In contrast, in this finite field, with nonzero leading coefficient. Its roots of a polynomial are exactly one and two: a product in a field is zero only if a factor is zero.
The complete polynomial evaluations, displayed as representatives modulo five, areIn particular, is a nonzero witness, which disproves identity without examining other points. At one or two, a zero value fails to reveal that is nonzero. A random variable with a uniform distribution on a finite set hits those two polynomial roots with probability .
A crucial limit appears with . Its coefficients make it a nonzero polynomial of polynomial degree five in , yet direct polynomial evaluation gives zero at all five field elements: the values before reduction are , all divisible by five. Thus induces the same polynomial function as the zero polynomial. Any number of trials restricted to will falsely accept this identity. This is compatible with the Schwartz-Zippel lemma: the ratio of polynomial degree to sampling-set size is , which gives no useful guarantee.
When a polynomial's representation permits polynomial evaluation over a larger field extension, a larger sampling set can restore the useful degree ratio. Access only to the induced polynomial function on the original finite field cannot distinguish from zero.[ref]
Lecture 9: Polynomial Identity Testing by the Schwartz-Zippel Lemma. CPSC 536N: Randomized Algorithms; Lecture 9: Polynomial Identity Testing by the Schwartz-Zippel Lemma, §1.4: formal nonzero polynomials can vanish everywhere on a finite field; extension-field evaluations need a suitable representation
Polynomial method for quantum query lower bounds Created 2026-10-07 Updated 2026-10-25
After input-bit queries, every probability amplitude is a polynomial of degree at most , because the bit-query matrix entries are affine in the input bits. An acceptance probability is a sum of squared absolute amplitudes and has polynomial degree at most . Multilinear reduction on the Boolean cube does not increase degree. Exact acceptance therefore implies . For bounded error the acceptance polynomial only approximates the Boolean function; its exact representing degree is not the relevant bound.
Population geneticist Created 2026-10-20 Updated 2026-11-05
A population geneticist studies variation in allele frequencies, its evolutionary causes and the ancestry of sampled genetic material. The work combines genetics, probability and empirical data to investigate processes including natural selection, genetic drift and gene flow. For example, comparing alternative demographic models can test whether an observed pattern is better explained by biological population separation or continuing exchange, subject to the model assumptions. [ref]
A weakly structured stem for human origins in Africa by Aaron P. Ragsdale and others. 2023, contrasting demographic models of human origins
Portmanteau theorem Created 2026-09-24 Updated 2026-11-05
The Portmanteau theorem gives equivalent formulations of weak convergence, including inequalities on open and closed sets and convergence of expectations for every bounded measurable function whose discontinuity set has zero limiting Probability.
Position measurement Created 2026-10-14 Updated 2026-11-05
An ideal position measurement of a normalized wavefunction assigns a probability to each spatial region through the Born rule: . This specifies outcome statistics; it does not by itself specify the post-measurement state. A physical detector has finite spatial resolution, which must be included in its measurement model.
Positive common intersection from pair-intersection probabilities Created 2026-10-14 Updated 2026-11-05
For , the intersection of all pairwise intersections is . Apply the union bound to the complements of the pairwise intersections and then take the complement to obtain the displayed lower bound. A sum exceeding therefore forces positive common probability without any independence assumption.
Positive covariance 2026-11-05
Two random variables have positive covariance when their centered product has positive expected value:Assume throughout that their second moments are finite. Outcomes where the centered values have the same sign contribute positively; opposite signs contribute negatively. The sign describes their average balance, rather than requiring every outcome to have matching signs.[ref]
Covariance and Correlation by Jeremy Orloff and Jonathan Bloom. §§2–2.1, definition and properties of covariance
A shared group effect can produce positive covariance even when the relation inside each group runs in the opposite direction. For an exact original example, let and be independent random variables with the Rademacher distribution: each takes the values with equal probability. Define and . Both expected values vanish, and independence givesTheir Pearson correlation coefficient is consequently . The four equiprobable outcomes are , , and .
For either fixed value , however, . Thus the conditional covariance is , and the conditional Pearson correlation coefficient is : the two points inside each group lie on a descending line. The law of total covariance identifies exactly where the positive pooled value comes from:The first term averages the conditional covariances; the second measures how the two conditional expectations move together across groups. Here the between-group contribution outweighs the negative within-group contribution. This is a covariance form of Simpson's paradox.
The dashed linear regression line has slope , but that slope does not give the direction of the relation at fixed . Nor does positive covariance by itself establish a causal effect: in the specified model the common variable supplies the positive component. Choosing which variables to condition on is a question about the model and the intended comparison, beyond computing one number.
Positive covariance is also weaker than requiring one variable to be an increasing function of the other. Under appropriate integrability assumptions, strict positive covariance with an increasing payoff supplies a useful sufficient condition; the grouping example shows a different route to the same sign.
Positive difference of independent exponential waiting times Created 2026-10-18 Updated 2026-11-05
Let be independent random variables with exponential distributions of respective positive rates . Condition on and use the survival function of :At this is . Dividing by that probability proves that the positive difference conditional on again has an exponential distribution with rate . The memorylessness of the exponential distribution persists after an independent competing event has already occurred. Replacing the difference by a negative sentinel when adds an atom of a measure of mass at that sentinel without changing the positive tail.
Positive operator-valued measure Created 2026-09-28 Updated 2026-10-14
A positive operator-valued measure is a family of positive operators satisfying . Each is called an effect and determines a probability for input density operator . The effects need not be orthogonal projections or commute. This permits measurements with more outcomes than the dimension of the Hilbert space, such as the trine qubit POVM. Coupling to a quantum ancilla and measuring the larger system supplies a physical route to generalized measurements. [ref]
https://www.preskill.caltech.edu/ph229/notes/chap3.pdf. Preskill, Quantum Information, §§3.1.2–3.1.4
.For an elementary unsharp example on a qubit, takeOn the eigenstate , ; at they are and . At the outcome is a fair coin independent of the input, and at these effects specify a sharp projective measurement. Choosing specifies one quantum instrument, but for outcome-dependent unitary operators has the same effects and different state updates. Thus POVM does not determine the post-measurement state.
When every entry of a payoff matrix is positive, its game value is positive. Setting converts the row player's probability vector and guaranteed value into the displayed linear program, whose optimum is . Conversely normalizing a feasible gives a mixed strategy guaranteeing . The dual maximizes under , and recovers the column strategy by normalization. Adding a constant to every payoff preserves Nash equilibria and lets this positive-payoff formulation handle general finite zero-sum games.
Positive predictive value Created 2026-10-25 Updated 2026-11-05
For a binary classifier, the conditional probability of the target condition given a positive classification. If its base rate is , its true-positive probability is , and its false-positive probability is , Bayes' theorem gives . The denominator is positive whenever a positive classification can occur.





