Compound Poisson process
   HOME

TheInfoList



OR:

A compound Poisson process is a continuous-time (random) stochastic process with jumps. The jumps arrive randomly according to a
Poisson process In probability, statistics and related fields, a Poisson point process is a type of random mathematical object that consists of points randomly located on a mathematical space with the essential feature that the points occur independently of one ...
and the size of the jumps is also random, with a specified probability distribution. A compound Poisson process, parameterised by a rate \lambda > 0 and jump size distribution ''G'', is a process \ given by :Y(t) = \sum_^ D_i where, \ is a counting of a
Poisson process In probability, statistics and related fields, a Poisson point process is a type of random mathematical object that consists of points randomly located on a mathematical space with the essential feature that the points occur independently of one ...
with rate \lambda, and \ are independent and identically distributed random variables, with distribution function ''G'', which are also independent of \.\, When D_i are non-negative integer-valued random variables, then this compound Poisson process is known as a stuttering Poisson process which has the feature that two or more events occur in a very short time.


Properties of the compound Poisson process

The expected value of a compound Poisson process can be calculated using a result known as Wald's equation as: :\operatorname E(Y(t)) = \operatorname E(D_1 + \cdots + D_) = \operatorname E(N(t))\operatorname E(D_1) = \operatorname E(N(t)) \operatorname E(D) = \lambda t \operatorname E(D). Making similar use of the
law of total variance In probability theory, the law of total variance or variance decomposition formula or conditional variance formulas or law of iterated variances also known as Eve's law, states that if X and Y are random variables on the same probability space, and ...
, the
variance In probability theory and statistics, variance is the expectation of the squared deviation of a random variable from its population mean or sample mean. Variance is a measure of dispersion, meaning it is a measure of how far a set of numbe ...
can be calculated as: : \begin \operatorname(Y(t)) &= \operatorname E(\operatorname(Y(t)\mid N(t))) + \operatorname(\operatorname E(Y(t)\mid N(t))) \\ pt&= \operatorname E(N(t)\operatorname(D)) + \operatorname(N(t) \operatorname E(D)) \\ pt&= \operatorname(D) \operatorname E(N(t)) + \operatorname E(D)^2 \operatorname(N(t)) \\ pt&= \operatorname(D)\lambda t + \operatorname E(D)^2\lambda t \\ pt&= \lambda t(\operatorname(D) + \operatorname E(D)^2) \\ pt&= \lambda t \operatorname E(D^2). \end Lastly, using the
law of total probability In probability theory, the law (or formula) of total probability is a fundamental rule relating marginal probabilities to conditional probabilities. It expresses the total probability of an outcome which can be realized via several distinct eve ...
, the
moment generating function In probability theory and statistics, the moment-generating function of a real-valued random variable is an alternative specification of its probability distribution. Thus, it provides the basis of an alternative route to analytical results compare ...
can be given as follows: :\Pr(Y(t)=i) = \sum_n \Pr(Y(t)=i\mid N(t)=n)\Pr(N(t)=n) : \begin \operatorname E(e^) & = \sum_i e^ \Pr(Y(t)=i) \\ pt& = \sum_i e^ \sum_ \Pr(Y(t)=i\mid N(t)=n)\Pr(N(t)=n) \\ pt& = \sum_n \Pr(N(t)=n) \sum_i e^ \Pr(Y(t)=i\mid N(t)=n) \\ pt& = \sum_n \Pr(N(t)=n) \sum_i e^\Pr(D_1 + D_2 + \cdots + D_n=i) \\ pt& = \sum_n \Pr(N(t)=n) M_D(s)^n \\ pt& = \sum_n \Pr(N(t)=n) e^ \\ pt& = M_(\ln(M_D(s))) \\ pt& = e^. \end


Exponentiation of measures

Let ''N'', ''Y'', and ''D'' be as above. Let ''μ'' be the probability measure according to which ''D'' is distributed, i.e. :\mu(A) = \Pr(D \in A).\, Let ''δ''0 be the trivial probability distribution putting all of the mass at zero. Then the probability distribution of ''Y''(''t'') is the measure :\exp(\lambda t(\mu - \delta_0))\, where the exponential exp(''ν'') of a finite measure ''ν'' on Borel subsets of the real line is defined by :\exp(\nu) = \sum_^\infty and : \nu^ = \underbrace_ is a
convolution In mathematics (in particular, functional analysis), convolution is a mathematical operation on two functions ( and ) that produces a third function (f*g) that expresses how the shape of one is modified by the other. The term ''convolution'' ...
of measures, and the series converges weakly.


See also

*
Poisson process In probability, statistics and related fields, a Poisson point process is a type of random mathematical object that consists of points randomly located on a mathematical space with the essential feature that the points occur independently of one ...
*
Poisson distribution In probability theory and statistics, the Poisson distribution is a discrete probability distribution that expresses the probability of a given number of events occurring in a fixed interval of time or space if these events occur with a known co ...
*
Compound Poisson distribution In probability theory, a compound Poisson distribution is the probability distribution of the sum of a number of independent identically-distributed random variables, where the number of terms to be added is itself a Poisson-distributed variable. ...
* Non-homogeneous Poisson process * Campbell's formula for the
moment generating function In probability theory and statistics, the moment-generating function of a real-valued random variable is an alternative specification of its probability distribution. Thus, it provides the basis of an alternative route to analytical results compare ...
of a compound Poisson process {{DEFAULTSORT:Compound Poisson Process Poisson point processes Lévy processes de:Poisson-Prozess#Zusammengesetzte Poisson-Prozesse