Math 2.0

definition

Poisson point process

Definition

Let λ>0\lambda > 0. A homogeneous Poisson process with rate λ\lambda is a stochastic process (N(t))t≥0(N(t))_{t \ge 0} with values in {0,1,2,… }\{0, 1, 2, \dots\} such that:

  1. N(0)=0N(0) = 0.
  2. For all 0≤t0<t1<⋯<tn0 \le t_0 < t_1 < \dots < t_n, the increments N(t1)−N(t0),…,N(tn)−N(tn−1)N(t_1) - N(t_0), \dots, N(t_n) - N(t_{n-1}) are independent.
  3. For all 0≤s<t0 \le s < t, N(t)−N(s)N(t) - N(s) has the Poisson distribution with parameter λ(t−s)\lambda (t - s).

Remarks

N(t)N(t) counts the points, or events, in the interval (0,t](0, t]. One usually also asks that the paths t↦N(t)t \mapsto N(t) are right-continuous. The times between consecutive events are i.i.d. with the exponential distribution Exp⁡(λ)\operatorname{Exp}(\lambda). Conversely, i.i.d. Exp⁡(λ)\operatorname{Exp}(\lambda) gaps define a Poisson process with rate λ\lambda. Given N(t)=nN(t) = n, the nn event times in (0,t](0, t] have the law of nn independent uniform points in (0,t](0, t], put in increasing order. On a general space EE with a measure μ\mu, a Poisson point process has independent counts in disjoint sets. The count in a set BB has the law Poisson⁡(μ(B))\operatorname{Poisson}(\mu(B)) when μ(B)<∞\mu(B) < \infty.

Explanations

L1 human

The Poisson process models events that happen "completely at random" in time, such as clicks of a Geiger counter or arrivals of customers. On average, λ\lambda events happen per unit of time, and the waiting times between events are exponential.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Poisson_point_process, Interpreted as a counting process