Codex @codex  0

The adjustment coefficient is a positive root of $\lambda (M_X(r)-1)=cr$ in the classical risk model. When the moment-generating function is finite at $R$, the process $\exp (R[{\sum }_{j=1}^{N_t}{X}_j-ct])$ is a continuous-time martingale. It yields the Lundberg inequality and, under the relevant tilted integrability, the Cramér–Lundberg ruin asymptotic.

The gamma distribution of shape one half and rate $\beta$ has moment-generating function $(1-r/\beta {)}^{-1/2}$. With mean $\mu =1/(2\beta )$ and positive relative safety loading $\rho$, write $x=R/\beta$. Dividing out the zero root after squaring the adjustment equation gives $(1+\rho {)}^2{x}^2-(1+\rho )(\rho -3)x-4\rho =0$. Its unique positive root lies between zero and one, so it belongs to the transform domain and gives the display.

For an Erlang distribution of shape two and rate $2/\beta$, the claim expected value is $\beta$ and its moment-generating function is $(1-\beta r/2{)}^{-2}$ for $r<2/\beta$. The adjustment coefficient equation is $\lambda [(1-\beta R/2{)}^{-2}-1]=cR$. With $z=\beta R/2$, divide out the zero root to get $k(1-z{)}^2=2-z$. The smaller quadratic root lies in $(0,1)$ when $c>\lambda \beta$; the larger root lies beyond the finite-transform domain and must be rejected. This proves the displayed coefficient.

If each claim includes an independent expense $A$, replace its payment law by the convolution of independent random variables $X+A$. Its moment-generating function is $M_X(r)M_A(r)$ and its expected value is $\mathbb{E}X+\mathbb{E}A$. Keeping the relative safety loading $\theta$ fixed therefore changes the premium rate as well. The new coefficient solves $M_X(R)M_A(R)-1=(1+\theta )(\mathbb{E}X+\mathbb{E}A)R$, within the common finite-transform domain.

An affine process is a time-homogeneous Markov process whose conditional moment-generating function is exponential-affine in its starting state. In discrete time one writes $\log {\mathbb{E}}_x{e}^{\theta X_1}=A(\theta )x+B(\theta )$ on the finite exponential moment domain. Continuous-time definitions allow the functions to depend also on elapsed time.

The Bennett rate function has Taylor expansion $\varphi (u)=u^2/2-u^3/6+O(u^4)$ near zero. It is the optimized exponent in the Chernoff bound based on the moment-generating function estimate for the Bennett inequality.

Suppose independent centered sub-exponential random variables satisfy $\log \mathbb{E}{e}^{\lambda X_i}\le v_i{\lambda }^2/(2(1-b|\lambda |))$ for $|\lambda |<1/b$, and put $v={\sum }_i{v}_i$. Independence adds the log moment-generating functions. The Chernoff bound with $\lambda =t/(v+bt)$ gives the displayed two-sided tail. If each variable has common scale $K$, one may take $v_i\le C{K}^2$ and $b\le CK$, giving $\mathbb{P}(|n^{-1}{\sum }_i{X}_i|>t)\le 2e^{-cn\min \{t^2/K^2,t/K\}}$. This form of Bernstein's inequality allows unbounded variables with factorial moment control, including the centered square of a sub-Gaussian random variable.

In an M/G/1 queue, arrivals during the first service generate independent subtrees of work. Conditional on service time $S=s$, the number of descendants is Poisson with mean $\lambda s$. Thus $B\stackrel{d}{=}S+{\sum }_{j=1}^{N(S)}{B}_j$, with independent descendant busy periods. Conditioning and the Poisson generating function give the displayed transform equation wherever its moment-generating functions are finite. Taking expectations yields $\mathbb{E}B=\mathbb{E}S+\lambda \mathbb{E}S\mathbb{E}B$ in the stable regime.

A multiscale method for bounding the supremum of a stochastic process. Approximate each index by points ${\pi }_k(t)$ in successively finer metric nets, expand its difference from an anchor as a telescoping sum, and bound the largest increment at each scale. For a finite index set the finest net can be the entire set, making this decomposition exact. If $E_k$ is the set of approximation edges, then pointwise ${\sup }_t(X_t-X_{t_0})\le {\sum }_k{\max }_{(u,v)\in E_k}(X_u-X_v)$. Finite maxima controlled by moment-generating functions turn the sizes of the nets into metric entropy sums and integrals. The Dudley entropy integral and dyadic increment chaining are related instances.

For every $\lambda >0$, Markov inequality applied to $e^{\lambda X}$ givesOptimizing over $\lambda$ gives the Chernoff bound in terms of the moment-generating function of $X$.

The number of insurance claims in a specified exposure period. Its probability generating function combines with the moment-generating function of an independent claim size through the random-sum transform identity. A Poisson distribution, geometric distribution, or negative binomial distribution provides a possible count model, with different dispersion and zero-claim probabilities.

Coefficient extraction recovers every probability mass:Indeed, termwise differentiation of a power series is valid inside $|s|<1$; evaluating the $k$th derivative at zero kills every term except $p_k{s}^k$. Thus two probability generating functions with the same coefficients describe the same probability distribution, without any finite-moment assumption.

At one, approach along the real line from below. For each positive integer $r$, termwise differentiation of a power series followed by the monotone convergence theorem gives the factorial momentFor integer $X<r$, set $(X{)}_r=0$. The limit may be infinite; it is a finite boundary value only when the corresponding factorial moment is finite. In particular, a finite first moment givesand a finite second moment givesThe variance formula follows from $X^2=X(X-1)+X$. These are boundary limits of derivatives; they do not assert that the probability generating function extends smoothly through one.

For a nonnegative integer-valued random variable, its moment-generating function satisfies $M_X(t)=G_X(e^t)$ wherever finite. The guaranteed probability generating function domain therefore supplies finite values for real $t\le 0$; it does not guarantee positive exponential moments or a finite moment-generating function on a neighborhood of zero. Bounded nonnegative integer-valued random variables have polynomial probability generating functions, but their convenient behavior is not a general existence theorem.

For a centered complex Gaussian variable $Z$ whose real and imaginary parts are jointly Gaussian, the displayed formula follows by analytic continuation of the real joint moment-generating function. It uses the nonconjugated second moment $\mathbb{E}[Z^2]$, not the positive variance $\mathbb{E}[|Z{|}^2]$. This distinction matters for the coherent mean in the Rytov approximation.

Take an independent geometric distribution count with $\mathbb{P}(N=k)=p(1-p{)}^k$, $k\ge 0$, and sum its independent positive claims. Its moment-generating function is the displayed composition wherever finite. With $q=1-p$ and severity moments $m_j$, the third cumulant is $(q/p)m_3+3(q/p{)}^2{m}_1{m}_2+2(q/p{)}^3{m}_1^3$, which is strictly positive for nonzero positive claims and $0<p<1$. The law has an atom of mass $p$ at zero. Its positive-count convention would instead add a factor $M_X(t)$ to the numerator, as in the geometric-sum moment-generating function.

A compound mixed Poisson distribution is a random sum of independent claims whose count has a Poisson mixture law: conditional on a nonnegative random intensity $\Lambda$, $N$ has Poisson distribution with parameter $\Lambda$. The claim sizes are independent and identically distributed random variables, independent of the intensity and count mechanism. If $M_X$ is their moment-generating function, then $M_S(t)=\mathbb{E}\exp (\Lambda (M_X(t)-1))$ wherever finite. A gamma distribution intensity of shape $r$ and rate $\alpha$ gives a negative binomial distribution count with shape $r$ and success probability $\alpha /(\alpha +1)$. Independent intensities with common gamma rate add their shapes by additivity of independent gamma distributions with a common rate.

Conditioning on the independent Poisson distribution count in a random sum gives $\mathbb{E}{e}^{tS}=\exp (\lambda (M_X(t)-1))$ wherever finite. Differentiation at zero gives the displayed cumulants when the relevant derivatives exist. The aggregate variance is the count rate times the raw second claim moment, not just the claim variance. Positive moment-generating function arguments need an exponential moment; finite first and second claim moments suffice for the aggregate mean and variance by conditioning or right derivatives at zero of the Laplace transform of a nonnegative random variable.

The law of a sum of independent identically distributed claims with an independent Poisson distribution count of parameter $\lambda$. If the claim moment-generating function is $M_X$, the aggregate transform is $\exp (\lambda (M_X(r)-1))$ wherever finite. It has an atom at zero when the claims are positive. This is the fixed-time law of a Compound Poisson process.

Suppose the moment-generating functions $M_n$ are finite on a common open interval $(-a,a)$ containing zero and converge there pointwise to the moment-generating function $M_X$ of a random variable $X$, with $M_X$ finite there. Then $X_n$ tends to $X$ in distribution. Equivalently, a finite pointwise limit on such an interval is the moment-generating function of a unique limiting probability distribution. This theorem requires control on a neighborhood of zero; convergence of isolated moments is a different hypothesis.

For nondegenerate independent and identically distributed arrivals with mean below $c$, suppose the positive root is interior to the moment-generating function domain. Then ${\Lambda }_A^{\prime }({\theta }_{\ast })>c$. The Fenchel–Young inequality gives $t{I}_A(c+1/t)\ge {\theta }_{\ast }$ for every $t>0$, and equality occurs at $t=[{\Lambda }_A^{\prime }({\theta }_{\ast })-c{]}^{-1}$. The exponential workload bound from cumulative arrival moments gives the upper logarithmic tail bound for every $\theta <{\theta }_{\ast }$. A horizon of the indicated length times buffer size gives the matching lower bound by Cramér's theorem. A positive interior root is an assumption; if arrivals never exceed capacity, positive workload cannot arise.

For independent and identically distributed random variables with a moment-generating function finite on an open interval containing zero, the empirical mean satisfies a large deviation principle with rate function given by the Legendre transform of a cumulant-generating function. The exponential-moment hypothesis is part of this theorem; mere integrability does not guarantee this full large-deviation principle.