Dependence in Poisson thinning 2026-10-14
Independent marking is the hypothesis that guarantees the Poisson thinning theorem. Equal marginal retention probabilities do not guarantee it. Consider one Bernoulli random variable with success probability , independent of a Poisson process, and retain every arrival when and none when . Each arrival is retained with probability , but the marks share the same coin. In an interval whose original count has Poisson distribution of mean , the retained count is and the rejected count is , soThe extra variance shows that is not Poisson distributed; the negative covariance proves dependence. Its no-arrival probability is , rather than . For the toy values , both rules have retained mean , but the common-coin rule has variance and no-arrival probability , compared with variance and no-arrival probability for independent marking. These formulas follow by conditioning on and using the law of total variance.
An arrival-dependent or adversarial retention rule can change the law just as strongly. Keeping every second arrival gives . Its successive retained gaps are sums of two independent exponential random variables, hence have the Erlang distribution of shape two and rate , not an exponential distribution. The resulting renewal process and its count variance are analyzed in Every second Poisson arrival has underdispersed counts, and the two dependent streams in alternating split of a Poisson process. As an even more restrictive rule, keeping only the first arrival ever gives , a Bernoulli distribution at each , so it cannot have a positive-mean Poisson distribution. A thinning rule must specify how decisions depend on arrivals and on one another; the independent-marking conclusion cannot be applied automatically to arbitrary deletion.
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 39 1 Solution Created 2026-10-03 Updated 2026-10-14
Equip with a sigma-algebra . A Poisson random measure with intensity measure of a point process is a random counting measure such that, for every measurable with ,and the counts on every finite collection of pairwise disjoint measurable sets are independent. Thus . For a sigma-finite measure , sets of infinite intensity contain infinitely many points almost surely: exhaust such a set by increasing finite-intensity sets and use the Poisson count tails as their means tend to infinity. The count is a measurable random variable for every measurable , which is part of saying that is a random measure.
Under the usual point representation write , counting multiplicities. If is a non-atomic measure, this is a simple Poisson point process; if has atoms, several point occurrences can have the same location, and each occurrence is counted separately. In a topological setting, local finiteness requires that the intensity be finite on compact sets.
Sufficient existence conditions are that is a standard Borel space and is a sigma-finite measure. This gives existence of a Poisson random measure on a standard Borel space. If a simple locally finite configuration is desired, additionally take a non-atomic, locally finite intensity on a locally compact second-countable Hausdorff space. These conditions are sufficient, not claimed necessary. In particular sigma-finiteness suffices for a countable family of occurrences that can each be independently coloured.
Let and be the red and green counting measures. The marking assumption means that, conditional on , the colours of all point occurrences are independent, with the same red probability . For a measurable set of finite intensity , condition on its total count. To obtain red and green points the total must be , so direct multiplication gives the joint red and green Poisson count formulaThus the two counts are independent Poisson variables with respective means and . This computation includes zero intensity with the usual convention for the probability of zero counts.
For disjoint finite-intensity sets , the original counts are independent. Conditional marking in different sets uses disjoint collections of independent colours. Repeating the preceding calculation therefore givesThis proves the disjoint-count definition for each coloured Poisson point process and independence of their two count vectors.
To obtain independence of the whole processes, take any finite list of red test sets and any finite list of green test sets, initially all of finite intensity. Refine their union into the disjoint cells given by their membership patterns. Every test-set count is the sum of the counts of its cells. The entire red cell vector is independent of the entire green cell vector by the product formula, hence so are the corresponding test-set count vectors. For arbitrary measurable test sets, intersect first with a finite-intensity exhaustion of and pass to the increasing count limits. The count cylinder events generate the two evaluation sigma-algebras, and independence extended from generating pi-systems gives independence of those sigma-algebras. ConsequentlyThis is a direct count proof of the Poisson thinning theorem; no general marking or thinning result has been used to deduce it.
Past exam of the mathematics course of the University of Cambridge 2007 ii Paper 1 26J e Solution Created 2026-09-24 Updated 2026-10-14
Assign each arriving car independently to a uniformly chosen lot. The Poisson thinning theorem gives three independent Poisson processes, each of rate . For an interval of length , their joint probability generating function isThe factorization proves independence of the counts in that interval; independence over disjoint intervals proves independence of the processes.
Past exam of the mathematics course of the University of Cambridge 2015 ii Paper 3 23K ii Solution Created 2026-09-24 Updated 2026-10-06
The Poisson thinning theorem, or its multinomial marking version, makes the bin counts at time independent Poisson variables with mean . Independence is more than is needed for the following union bound. Fix and put . ThenSincethe logarithm of the upper bound is . Thus . The estimate handles the noninteger threshold directly, since the supplied Poisson tail bound holds for real .
Past exam of the mathematics course of the University of Cambridge 2015 ii Paper 3 23K i Solution Created 2026-09-24 Updated 2026-10-06
In an interval of length , condition on the Poisson process count . Independently marking its points gives . The joint probability generating function of kept and discarded counts isIt factors into the generating functions of independent Poisson variables of means and . The same calculation applies to any interval, and counts and marks in disjoint intervals are independent. Hence is a Poisson process of intensity , and and are independent. This is the Poisson thinning theorem.
Past exam of the mathematics course of the University of Cambridge 2023 ii Paper 4 27J c Solution Created 2026-09-24 Updated 2026-09-25
For one visitor, letand defineA visitor arriving at time is in room at time exactly when its independent service-time mark satisfies . Thus it receives mark with probability ; a further mark records that it has already left the gallery.
The Independent marking theorem for Poisson point processes makes the point processes carrying the different room marks independent. Consequently are independent, and Poisson thinning givesEquivalently,
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 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.
