Cox process 2026-10-14
A counting process which, conditional on a random nonnegative locally integrable intensity , is an Inhomogeneous Poisson process. For , conditioning gives and . Thus finite-variance counts are never underdispersed. Randomness of the intensity may induce dependence between increments which are independent conditionally.
For a rate- Poisson process, keeping every second arrival gives a renewal process with independent interarrival times equal to sums of two exponential waiting times. Put . Its count mean and variance are and . The variance is strictly smaller than the mean for : sixteen times their difference has derivative and is zero at zero, because . Therefore this process is not a Cox process.
Poisson maximal concentration bound 2026-10-14
For a unit-rate Poisson process, gives the displayed maximal deviation bound for . Poisson exponential martingales and the Ville inequality control upper and lower deviations; the upper-tail rate also bounds the lower-tail probability. Since and , the rate is strictly positive for every positive deviation level.
Poisson exponential martingale 2026-10-14
For a unit-rate Poisson process and real , the displayed process is a nonnegative martingale with initial value one. Independent increments give , proving its conditional mean property. The Ville inequality turns this exponential moment into a maximal tail bound.
Strong law for Poisson arrival times 2026-10-14
For a homogeneous Poisson process of rate , almost surely: unit-time increments are independent Poisson variables and the strong law of large numbers applies, then monotonicity fills the intervals between integers. At its th point , simplicity gives . Consequently . Rate and mean interarrival time are reciprocals.
A Poisson process observed for a fixed duration has likelihood proportional to . Complete independent exponential distribution gaps observed until a fixed event count have likelihood . Both give count divided by exposure, but the exposure is random in the second design. Under fixed exposure the total count is sufficient: conditional on it, the event locations are independent of the rate, so exact timestamps add no rate information to interval counts. Gap estimates and fixed-horizon estimates should not be compared without distinguishing their stopping rules and any final censored gap.
Poisson interarrival times Created 2026-10-14 Updated 2026-10-25
Let be the th arrival time, and set . In a Homogeneous Poisson process of rate , the gaps are independent and identically distributed random variables with an exponential distribution:Here uses the rate convention. Under the scale convention , the same probability density function is ; a simulation function accepting a scale must receive . Conversely, summing independent rate- exponential random variables to form and counting those sums constructs a Homogeneous Poisson process.[ref]
The first-gap formula follows immediately from and the Poisson distribution. Independence of all successive gaps is the additional interval-theorem assertion; deterministic-time independent increments alone should not simply be substituted at random arrival times without justification. The memorylessness of the exponential distribution givesAt the toy rate of two per minute, the mean gap is half a minute, the median is minutes, and the probability of waiting longer than half a minute is . Here is the natural logarithm. Already having waited a minute without an arrival leaves this same conditional probability of waiting another half minute. The exponential distribution describes a model with no aging of the remaining wait; a scheduled arrival with a fixed gap has no such property.
Mapping theorem (point process) Created 2026-10-14 Updated 2026-11-05
Let be a Poisson point process with intensity measure and let be measurable. If the pushforwardis locally finite, then the image counting measure is Poisson with intensity . If one requires a simple point process, the pushforward must also be diffuse, so distinct source points do not produce coincident image points with positive probability.
Campbell's theorem Created 2026-10-14 Updated 2026-11-05
Let be a Poisson point process with intensity measure , and let be a real-valued measurable function. For the ordinary Poisson sum , the condition givesIf also , thenExpand the square: equal-index terms contribute , while the Poisson factorial moment measure makes distinct-index terms contribute . Subtracting the squared expected value proves the variance formula. The Campbell first-moment formula also holds for general point processes; this variance identity uses the Poisson assumption.[ref]
Lectures on the Poisson Process by Günter Last and others. Proposition 2.7 and equation 4.26; ordinary second moments require both L1 and L2 integrability
Square integrability alone is insufficient for the ordinary sum on an infinite-intensity space. Take intensity on and . Then , but the sum is infinite almost surely: the ordered points satisfy by the strong law for Poisson arrival times, so comparison with the harmonic series proves divergence.
For this same , the compensated Poisson integral exists as a mean-zero limit under convergence in Lp with and has variance . Its definition is the L2 construction of compensated Poisson integrals, rather than subtraction of two infinite ordinary integrals. When the total intensity is finite, Cauchy-Schwarz inequality makes L2 imply L1, explaining why the shorter variance statement works in that special case.[ref]
Lectures on the Poisson Process by Günter Last and others. Section 12.1, Lemma 12.2 and Proposition 12.4: compensated-integral isometry and L2 extension
Poisson germ-grain model 2026-10-14
A Poisson germ-grain model assigns a measurable region to each point of a Poisson point process and takes the union of those regions. A location remains uncovered exactly when no Poisson point has a region containing it, so its coverage probability is determined by the intensity of the corresponding set of germs and marks.
Place equal masses at points of a homogeneous Poisson point process of intensity on the line, and truncate their signed inverse-power forces symmetrically at radius . For force , with , the characteristic exponent tends to . The cosine integral for a symmetric stable exponent evaluates it as displayed. Thus the weak limit is a symmetric stable distribution. Symmetric truncation is important when the far-field force series is not absolutely summable.
Poisson mapping theorem 2026-10-14
For a measurable map and a Poisson random measure of intensity , image counts in disjoint sets equal original counts in their disjoint preimages. They are therefore independent Poisson variables with the pushforward intensity. The result is a Poisson random measure even if images collide; diffuse pushforward intensity gives a simple point process.
Poisson factorial moment measure Created 2026-10-14 Updated 2026-11-05
For a Poisson point process of intensity measure , its th Poisson factorial moment measure is . Writing its counting measure as , the identity means that for nonnegative measurable function ,The indices select distinct point occurrences. Their locations need not be different when has an atom of a measure. For a simple point process, the locations are different as well.[ref]
Lectures on the Poisson Process by Günter Last and others. Section 4.4, Corollary 4.10: Poisson factorial moment measure is the tensor power of its intensity
For example, if all intensity is concentrated at one point , with , then has Poisson distribution. There are ordered pairs of distinct occurrences there, with expected value , even though both locations equal . Counting only pairs of different locations would give zero and fail the identity.
For , separating equal-index terms from distinct-index terms gives the second-moment calculation in Campbell's theorem. Dividing the distinct-pair sum by two instead counts unordered pairs, as in the intersection point process of a Poisson line process.
Poisson line process Created 2026-10-14 Updated 2026-11-05
Identify an unoriented line not through the origin by , with . A Poisson point process on this parameter space is a random collection of lines. The measure is invariant under rotations and translations; signed coordinates , give the same measure . The number of lines meeting a disk of radius is Poisson with mean .
Poisson equation on a disk with angular forcing Created 2026-10-14 Updated 2026-10-18
For the Poisson equation on the unit disk with zero Dirichlet boundary condition, separation of variables in polar coordinates gives . For , boundedness at and select . The resonant mode is . For discontinuous angular data, the Poisson equation is interpreted in its weak formulation; its Dirichlet energy gives uniqueness. Orthogonality of the angular Fourier modes gives , with the resonant case obtained directly or by the limit .
Gibbs updates for a Poisson count change point Created 2026-10-14 Updated 2026-11-05
The full conditional distributions are and , in shape-rate notation. Conditional on the two rates, has weights . A Gibbs sampler cycles through these three draws. Each update preserves the joint posterior distribution; subtracting the largest log weight before exponentiation stabilizes the categorical draw. Averages of estimate the posterior probability of no observed change.
Marginal posterior weights of a Poisson count change point Created 2026-10-14 Updated 2026-11-05
Integrating the two rates out of the Poisson count change-point model with gamma priors gives these weights up to a common factor, by the defining Gamma function integral. Normalizing across the finitely many possible indices gives the exact marginal posterior distribution of , providing a check on Markov chain Monte Carlo estimates. One can also draw from these weights and then draw both rates from their conditional Gamma distributions, producing independent exact joint posterior samples.
Start with and conditionally let . The mean generation size is . The log-likelihood is plus a parameter-free term, where and . Expected negative curvature gives the displayed Fisher information, bounded as the horizon grows. Extinction makes the observations eventually all zero, so one longer observed family does not supply indefinitely increasing information.
// Target: convergence-of-random-variables.bigb
Poisson bracket from a central deformation parameter Created 2026-10-14 Updated 2026-11-05
Let be central and a non-zero-divisor in an associative algebra, with commutative quotient modulo . Dividing commutators by and reducing modulo is independent of the lifts, since changing a lift by changes the quotient by a commutator, zero modulo . Antisymmetry, the Leibniz rule and the Jacobi identity descend from the corresponding commutator identities. For the order filtration of a Weyl algebra, the convention is , with the opposite sign for .
Optical transfer function 2026-10-14
The optical transfer function is the Fourier transform of the normalized intensity point spread function for incoherent imaging with translation invariance, using spatial frequency in cycles per unit length. It has . For an ideal circular pupil it is the normalized pupil autocorrelation, with cutoff in object coordinates: no overlap remains when two pupil copies are shifted apart by more than one pupil diameter.[ref]
There are unlisted articles, also show them or only show them.