The intensity measure of a point process is its expected counting measure:
It may take the value .[ref] Countable additivity follows by applying the monotone convergence theorem to the counts of finite unions of pairwise disjoint observation windows. If is locally finite and absolutely continuous with respect to Lebesgue measure, its Radon-Nikodym derivative is the intensity function of a point process :
This is an expected number per unit volume, not a probability density function for a randomly selected point. For example, a single deterministic point has , a Dirac measure, and no Lebesgue measure density. The density representation requires its own assumption.[ref]
For a bounded Borel set , , but local finiteness alone does not ensure that this expected value is finite. Conversely, implies almost surely, even when is unbounded. A constant finite intensity function of a point process on all of has infinite total intensity measure, although every bounded window has finite expected value.
The intensity function of a point process is positive and continuous inside the interval, so its measure is finite on every compact subinterval. Consequently the Poisson point process is locally finite there. Its nonatomic intensity makes it simple and gives no point at almost surely. At the endpoints,
Both half-intervals therefore have infinite intensity. More explicitly, exhaust either half by increasing compact intervals with means . For any fixed integer ,
Taking the countable union over proves infinitely many points on each side almost surely.
Local finiteness excludes accumulation in the interior, including at . Hence there is a largest negative point and a smallest positive point. For example, given any negative point, the compact interval between it and contains finitely many points and therefore a largest one. Call it ; call the smallest positive point , and enumerate consecutively in both directions. Infinite counts give every integer index, and the lack of interior accumulation implies as and as . Thus the specified two-sided labeling exists almost surely.
Use the cumulative-intensity transformation
It has , positive derivative, and limits at the two endpoints, so it is an increasing bijection onto . One explicit expression is
For any bounded interval in the target, its preimage has intensity
Disjoint target sets have disjoint preimages, so their counts are independent. This proves directly, or by the Poisson mapping theorem, that the transformed points form a unit-rate Poisson process on the real line.
Put . On the positive half-line, the successive spacings are independent exponential random variables of mean , so . The strong law of large numbers gives almost surely. On the negative half-line, independently, the reflected points satisfy , because is the first point to the left of zero. Thus , or also as . The shift by one has no effect on these limits.
From the explicit formula, or by integrating the endpoint intensity asymptotics,
Substitute and use the strong law for Poisson arrival times. At the right endpoint,
so
At the left endpoint the corresponding result is
Equivalently . The different powers of reflect the different endpoint singularity orders, an instance of power-law boundary accumulation of a Poisson point process.
For every Borel set , let
be its random point count. A Non-homogeneous Poisson point process with intensity function of a point process is characterized by:
Because has a density with respect to Lebesgue measure, it is atomless, so the process is simple: almost surely no location occurs more than once.
A Non-homogeneous Poisson point process with intensity function is a random counting measure such that, for every finite family of pairwise disjoint bounded Borel sets , the counts are independent random variables and
The assumed local integrability makes each Poisson parameter finite. This count law and independence characterize the process.
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]
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 . Thus
These 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.
Figure 1.
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 is
This 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.
If an intensity function of a point process has at a finite endpoint, with and , the cumulative intensity satisfies . The Poisson mapping theorem turns into unit-rate arrivals. The strong law for Poisson arrival times gives almost surely, hence the displayed accumulation rate. Reversing the coordinate gives the same argument at a left endpoint. Different singularity exponents produce different powers of the index.
Stationary point process 2026-10-14
A point process on is stationary if every translation preserves its probability law. If its mean count in a unit cube is finite, its intensity measure is for some , where denotes Lebesgue measure. This follows because stationarity makes the mean measure invariant under translations. A constant intensity function of a point process describes only these mean counts, and by itself asserts neither stationarity of the entire law nor independence.[ref]