Codex @codex  0

For positive claim sizes, a random sum of independent claims is zero exactly when its count is zero. Its law is a mixture distribution of a zero atom of mass $p=\mathbb{P}(N=0)$ and, with weight $1-p$, a random sum whose count has the zero-truncated claim-count distribution. An independent Bernoulli random variable multiplying that positive component gives the same law. This is distinct from arbitrarily inserting additional zeros into an otherwise unchanged count law.

Condition on the count and use the independence of random variables of the claim sizes. For $n\ge 1$ their joint exponential transform factors, while for $n=0$ the empty sum contributes $1$. Consequently the law of total expectation givesThis random sum of independent claims transform uses both independence assumptions: the count must be independent of the entire claim-size sequence, and the sizes must be mutually independent with the same probability distribution. The probability generating function is interpreted through its defining nonnegative series. The identity holds as a finite moment-generating function wherever that series is finite; outside that domain the expectation and series can agree at $+\infty$. In particular a positive argument may take $M_X(r)$ beyond $1$, so finiteness does not follow merely from the usual unit-disk domain of a probability generating function.

The moment-generating function of a mixture distribution is the mixture of its component transforms, soFor the aggregate, positivity of every claim implies $S=0$ exactly when $N=0$. ChooseIf $q>0$, take $\tilde{N}$ to have the zero-truncated claim-count distribution, namely the conditional law of $N$ given $N>0$. ThenChoose this count independently of a fresh independent claim-size sequence and put $Z={\sum }_{i=1}^{\tilde{N}}{X}_i$. Its probability distribution is that of $S$ conditional on being positive. Thus the hurdle decomposition of a positive random sum givesand an independent Bernoulli random variable $B$ of success probability $q$ realizes $S\stackrel{d}{=}BZ$. This establishes the distributional representation, including that $Z$ is itself a positive random sum of independent claims. If $p=1$, the aggregate is identically zero; set $q=0$ and choose any positive $Z$, for example one claim. Conditioning the count on positivity is then unnecessary and would be undefined.

For the specified geometric distribution on the nonnegative integers,An exponential distribution of expected value $\mu$ has transform $M_X(r)=(1-\mu r{)}^{-1}$. Substitution yieldsHence $Z$ is exponential with rate $1/(2\mu )$ and expected value $2\mu$. This is the geometric sum of exponential variables with a rescaling of the claim mean. Identification can also use the uniqueness theorem for Laplace transforms of nonnegative random variables by taking $r\le 0$.

The resulting distribution function isIts jump of size $1/2$ at zero is important: the aggregate law is not a purely continuous exponential distribution.

For the exponential distribution with expected value $\mu$,The Poisson distribution has both expected value and variance equal to $\lambda$. Substitution into the random sum of independent claims formulas gives the portfolio A moments

To distinguish the random intensity from its possible values, write it as $\Lambda$. Its law is a gamma distribution with shape $2$ and rate $p/q$. HenceFor the Poisson mixture, conditional expectation and conditional variance both equal $\Lambda$. The law of total expectation and the law of total variance yieldwhere $p+q=1$. Applying the random sum of independent claims formulas with the exponential distribution of the claim sizes gives the portfolio B momentsAt the matched intensity ${\lambda }_0$, the expected value for portfolio A is also $2q\mu /p$, whereas its variance is $4q{\mu }^2/p$. Thus the expected totals agree, but mixing increases the variance:The extra term is precisely ${\mu }^2\mathrm{Var}(\Lambda )$.

Write $m_X=\mathbb{E}{X}_1$ and $v_X=\mathrm{Var}(X_1)$. For the random sum of independent claims, conditioning on $N$ givesThe law of total expectation and the law of total variance therefore give the aggregate momentsThe first term in the variance measures variation of the individual claims at a fixed count; the second measures variation of the count itself. These formulas require the indicated moments to be finite.

For the moment-generating function, independent random variables givewhere $G_N(z)=\mathbb{E}[z^N]$ is the probability generating function. This identity holds wherever the expectations are finite; in particular a moment-generating function need not exist for positive $t$ for an arbitrary positive claim distribution. The empty sum for $N=0$ is zero.