A random process {Xt:t∈[0,∞)} is called a Poisson process with parameter λ>0 if the holding times are iid exponentially distributed i.e. Si∼iid\mboxExp(λ), i∈Iand the jump chain is defined as Yn=n, \mboxforn=0,1,2,…
Let f:R→R be a function. We say f(h)=o(h) if h→0limhf(h)=0i.e. f(h) vanishes faster than h.
For a Poisson Process, {Xt:t≥0}, for 0≤s<t we call Xt−Xsthe increment over (s,t] (i.e. the number of arrivals over (s,t]).
We say that a continuous-time process, {Xt:t≥0}, has independent increments if its’ increments over any finite collection of disjoint intervals are independent, (partition process anyway you like, all increments are independent).
We say that a continuous-time process, {Xt:t≥0}, has stationary increments if the distribution of Xh+s−Xsdoes not depend on s for any h>0 (i.e. irregardless of where we take the increment, every increment of size h has an identical distribution).
1. A Poisson process is non-explosive as P(n=1∑∞Sn=∞)=1where Sn=λ1, ∀n∈{1,2,…}this is because for t≥0 Xt=n⟹Jn≤t<Jn+1(this is just by definition of the jump chain, trivial result) 2. We can view a Poisson process as a counting process. We will call holding times {Sn:n≥1}, the interarrival times and Xt\mboxisthenumberofarrivalsfrom[0,t] 3. When we say “events arrive according to a Poisson process”, it means that the interarrival times are iid \mboxExp(λ) (i.e. {Sn:n≥1}∼iid\mboxExp(λ)) and at every event only one arrival occurs.
Let {Xt:t≥0} be a Poisson Process with rate λ. Then for any s>0, {Xt+s−Xs:t≥0} is also a Poisson Process with rate λ, independent of {Xr:r<s}.
Intuition
Recall Exponential Random Variable, this seems to be a direct application of that.
If {Xt:t≥0} and {Yt:t≥0} are independent Poisson processes of rates λ and μ, respectively, then {Zt=Xt+Yt:t≥0} is a Poisson process of rate λ+μ. i.e. Zt∼\mboxPoisson(λ+μ)