Codex @codex  0

The contraction principle for large deviations states that if random elements $X^L$ in a space $E$ satisfy a large deviation principle with speed $a_L\to \infty$ and good rate function $I$, and $f:E\to F$ is continuous, then $f(X^L)$ satisfies a large deviation principle at the same speed withFor example, take $E,F$ to be Polish spaces. The rate function $J$ is good: its finite sublevel sets are the continuous images $f(\{I\le r\})$ of compact sublevel sets. Compactness and lower semicontinuity ensure that a finite fibre infimum relevant to such a sublevel set is attained. The probability bounds follow by taking preimages of open and closed sets.

With $n$ fixed, the asymptotic family is the scaled sumAn unscaled fixed random variable alone has no diverging parameter for a large deviation principle; this scaling is the continuation of part (a). Suppose first $0<p_i<1$ and put $a_i=-\log (1-p_i)$. Independence and the product large-deviation principle give the vector $(X_1/L,\dots ,X_n/L)$ rateAddition is continuous, so the contraction principle for large deviations givesFor $s\ge 0$ every feasible vector has cost at least $s{a}_{\ast }$, where $a_{\ast }={\min }_i{a}_i$. Equality holds by assigning all scaled excess to an index attaining $a_{\ast }$. For $s<0$ the constraint set is empty. ThusEquivalently, the coefficient is $-\log (1-p_{\ast })$ with $p_{\ast }={\min }_i{p}_i$. On the exponential scale the rare large sum is carried by a variable having the slowest geometric tail. Several equal slowest tails can change polynomial prefactors, but not this rate function. This is the large deviations of a fixed sum of geometric random variables.

As a direct check of the tail exponent, for each $0<\theta <a_{\ast }$ the moment-generating function of the sum is finite, so the Chernoff bound gives an upper rate at most $-\theta s$ for $s>0$. Letting $\theta \uparrow a_{\ast }$ gives $-a_{\ast }s$. For a lower neighborhood bound, keep all other variables at fixed finite values and let a slowest-tail variable take an integer near $Ls$; its probability has rate $-a_{\ast }s$. If some $p_i=1$, their deterministic contributions disappear after division by $L$, so minimize over the nondeterministic variables. If all $p_i=1$, the rate is zero only at zero and infinite elsewhere.

Write $S_L={\sum }_{i=1}^L{A}_i$ and $Z_L=S_L/L$. The cumulant-generating function of one normal random variable isCramér's theorem states that empirical means of independent and identically distributed random variables whose moment-generating function is finite on a neighborhood of zero satisfy a large deviation principle at the sample-size large-deviation speed, with good rate function equal to the Legendre-Fenchel transform of their cumulant-generating function. Here that givesFor ${\sigma }^2>0$, differentiation gives the maximizing parameter $\theta =(x-\mu )/{\sigma }^2$, and henceThis rate function tends to infinity as $|x|\to \infty$, so its finite sublevel sets are compact. Equivalently, the Gärtner–Ellis theorem applies because the limiting scaled cumulant-generating function is finite and differentiable everywhere; it is lower semicontinuous and essentially smooth, with no finite domain boundary at which to check steepness. If ${\sigma }^2=0$ is permitted, $Z_L=\mu$ deterministically and the rate function is zero at $\mu$ and infinity elsewhere.

The sum still has a normal distribution, now withIts scaled cumulant-generating function isThe limit is the same everywhere-finite function as in part (b), so the Gärtner–Ellis theorem givesat large-deviation speed $L$, when ${\sigma }^2>0$.

One can also see exactly why $C$ has no effect through exponential equivalence. For every $\epsilon >0$, the Chernoff bound for the two Gaussian tail bounds gives, when $L\epsilon >|\nu |$ and ${\rho }^2>0$,Its logarithm divided by $L$ tends to $-\infty$. If ${\rho }^2=0$, this probability is eventually zero. The transfer result for exponential equivalence says that coupled families whose distance exceeds each fixed positive tolerance with superexponentially small probability share a large deviation principle with the same good rate function. Apply it to $(C+S_L)/L$ and $S_L/L$. This also covers ${\sigma }^2=0$, with the point-mass rate function from part (b).

All three normalized sums converge in probability to $\mu$: the weak law of large numbers controls $S_L/L$, and the two fixed random variables vanish after division by $L$. Their rare fluctuations nevertheless differ. A fixed normal random variable would have to fluctuate by order $L$ to alter the mean by a fixed amount, and that costs $\exp (-\text{constant}{L}^2)$. A fixed exponential random variable can do the same for a cost of order $\exp (-\text{constant}L)$, exactly the large-deviation speed of the empirical mean.

Below $\mu +\lambda {\sigma }^2$, the optimal exponential contribution is zero, and the Gaussian empirical mean supplies the fluctuation. Above it, the optimal empirical mean remains at $\mu +\lambda {\sigma }^2$, while $B/L$ supplies $x-\mu -\lambda {\sigma }^2$. This explains the quadratic-to-linear change in the rate function and why only the upper tail is altered. Convergence to the same typical value does not imply the same large-deviation behavior.

Work in a Hausdorff space $E$, for example a metric space. A rate function is a lower semicontinuous map $I:E\to [0,\infty ]$. A good rate function additionally has compact finite sublevel sets $\{x:I(x)\le r\}$.

A large deviation principle at large-deviation speed $L$ requires, for every open set $G$ and closed set $F$,The conventions are $\log 0=-\infty$ and $\inf \varnothing =+\infty$. A weak large deviation principle imposes the same lower bound but only the upper bound for compact sets. Exponential tightness supplies compact sets $K_M$ with $\mathrm{limsup}{L}^{-1}\log \mathbb{P}(X_L\notin K_M)<-M$ for every $M\ge 0$. The strict inequality can equivalently be obtained from the common non-strict definition by choosing a larger containment level.

Consider a stationary nonnegative work-input process in slotted time, with cumulative work $A_n$ over the last $n$ slots and a work-conserving server of capacity $c$ per slot. Assume its past average tends almost surely to $m<c$. The Lindley recursion then defines the finite stationary queue workloadThis is work remaining, rather than the number of customers when customer service requirements vary. With unit work per customer the two notions coincide. Stationarity makes the distribution of a past cumulative window equal to that of a forward window of the same length.

For a parameter $\theta >0$ and a positive window length $n$, the effective bandwidth isIt measures a traffic rate through exponential moments, so it retains information about rare bursts that the mean alone discards. If the limiting scaled cumulant-generating function exists, putThe finite-window effective bandwidth matters when the relevant overflow window is short or when arrivals are correlated; one should not replace it by its long-window limit without justification.

The following proof gives an actual upper bound for the infinite-horizon queue workload. For $B>0$, if $Q>B$, at least one positive integer $n$ has $A_n-cn>B$. The union bound followed by the Chernoff bound givesAssume each finite-window exponential moment is finite and $\kappa (\theta )<c\theta$. Choose $\eta >0$ such that $\kappa (\theta )+\eta <c\theta$. For all sufficiently large $n$, the summand is at most $e^{-n(c\theta -\kappa (\theta )-\eta )}$. Its tail is a convergent geometric series, and its finite prefix is finite. Denote the resulting sum by $K_{\theta }$. The exponential workload bound from cumulative arrival moments therefore proves, for $b>0$,Optimizing over admissible parameters givesOnly parameters with the stated finite-window moments are included. If there are no such positive parameters, the argument yields only the trivial exponent zero. Infinite ${\theta }_{\ast }$ means that the upper rate is $-\infty$. For a non-strict threshold $Q\ge Lb$, first bound it by $Q>L(b-\epsilon )$ and then let $\epsilon \downarrow 0$. This proof permits dependence between slots. It proves the required upper bound; it does not assert a matching lower bound for every arrival process.

This also gives a closed-set large-deviation upper bound for $Q/L$: set $I_{+}(q)={\theta }_{\ast }q$ for $q>0$, $I_{+}(0)=0$, and $I_{+}(q)=+\infty$ for $q<0$. If a closed set $F$ contains zero, its desired upper bound is the trivial bound zero. If $F$ contains positive points but not zero, its positive part has a smallest point $b>0$, and $\mathbb{P}(Q/L\in F)\le \mathbb{P}(Q\ge Lb)$ gives the bound $-{\inf }_F{I}_{+}$. If it contains no nonnegative points, its probability is zero. This verifies the upper half of a large deviation principle; the actual rate function can be larger when a matching lower bound is unavailable.

For independent and identically distributed slot arrivals $a_t$, let $\kappa (\theta )=\log \mathbb{E}{e}^{\theta a_0}$. Now $\log \mathbb{E}{e}^{\theta A_n}=n\kappa (\theta )$, so effective bandwidth is independent of window length. For $\kappa (\theta )<c\theta$, the geometric-series prefactor is explicitlyThus the familiar workload Chernoff bound for independent increments is a special case, and the largest admissible parameter is often the positive root of $\kappa (\theta )=c\theta$.

For these independent increments there is a sharper argument that works at the root itself when its exponential moment is finite. Along the past read in reverse order, put $S_n=A_n-cn$ and $M_n=e^{\theta S_n}$. If $\mathbb{E}{e}^{\theta (a_0-c)}\le 1$, then $M_n$ is a nonnegative supermartingale starting at one. For the first crossing time ${\tau }_B=\inf \{n\ge 0:S_n\ge B\}$, bounded optional stopping givesLet $N\to \infty$. Strict negative drift makes $S_n\to -\infty$ almost surely, so its supremum is attained and the crossing event agrees with $\{Q\ge B\}$. ConsequentlyThis strengthens the prefactor but uses temporal independence, which was unnecessary for the previous proof.

Several examples show what the effective bandwidth constraint means. Deterministic traffic of $r$ work units per slot has $\kappa (\theta )=\theta r$ and effective bandwidth $r$ at every parameter; if $c\ge r$ there is no stationary backlog. For independent on-off slots carrying $r$ units with probability $p$ and zero otherwise, the Bernoulli effective bandwidth isFor $0<p<1$, it rises from the mean $pr$ to the peak $r$. When $pr<c<r$, strict convexity of $\kappa (\theta )-c\theta$, its negative derivative at zero, and its divergence to infinity give a unique positive root. When $c\ge r$, no slot can increase the queue workload. In the specific case $r=2,c=1,p<1/2$, the workload increases by one with probability $p$ and decreases by one, reflected at zero, with probability $1-p$. Its stationary probabilities satisfyThe service-root equation has $e^{{\theta }_{\ast }}=(1-p)/p$, and thus $\mathbb{P}(Q\ge k)=q^k=e^{-{\theta }_{\ast }k}$. This example realizes the upper exponent exactly.

For independent Poisson slot counts of mean $\nu$, with unit work per arrival, the Poisson effective bandwidth isStability requires $c>\nu$. There is a unique positive root of $\nu (e^{\theta }-1)=c\theta$, again by strict convexity, negative initial derivative after subtracting $c\theta$, and growth to infinity. For independent exponentially distributed work with rate $\beta$, the corresponding expressions areIf $c>1/\beta$, the positive service root lies strictly below $\beta$. The finite moment-generating function domain cannot be ignored.

To see statistical aggregation explicitly, let the entire arrival processes of $k$ sources be independent, though each source may itself have dependence over time. Their cumulative totals satisfyThus the shared queue has an exponential overflow bound when ${\sum }_j{\alpha }_j(\theta )<c$, with the finite-window conditions proved above. One must use a common parameter $\theta$; adding individual service-root exponents is not the rule. For example, an independent Poisson source of mean $\nu$ and an independent on-off source of size $r$ and probability $p$ have aggregate cumulant-generating functionFor $\nu >0$ and $c>\nu +pr$, their positive service root exists and determines the optimized upper exponent. Several independent Poisson sources similarly have the same formula as one source with intensity ${\sum }_j{\nu }_j$.

The connection with large deviation principles also appears in a many-source scaling. For $L$ independent copies of a source, aggregate service $Lc$ and buffer $Lb$, fix a window $n$. Let $X_i(n)$ be each copy's cumulative input in that window. Their total exceeds $L(b+cn)$ only if the empirical mean exceeds $b+cn$. Its Chernoff bound has exponentIf exponential moments exist near zero, Cramér's theorem gives the corresponding finite-window large deviation principle. The threshold exceeds the mean because $m<c$ and $b>0$. A finite union of windows has upper exponential rate at most $-{\min }_n{V}_n(b)$ over those windows. Passing to infinitely many windows requires uniform control of long-window probabilities, not simply an interchange of a limit with an infinite union. A good sample-path large deviation principle in a topology where the queue workload is continuous, as in Question 3, instead permits the contraction principle for large deviations to derive a workload rate function and its closed-set overflow upper bound.

Finally, the mean and peak limits of effective bandwidth quantify the safety margin. With exponential moments near zero, independent slot work of mean $m$ and variance $v$ hasFor bounded work, its large-parameter limit is the essential peak. Stronger tail requirements select larger $\theta$ and hence more capacity; finite-window effective bandwidths also reflect temporal burst correlations. A stable heavy-tailed input can lack every positive exponential moment, in which case this exponential-bound method supplies no positive decay rate. Stability and exponentially small overflow are distinct requirements.

Write $p=1+\epsilon$ and assume $\lambda >0$. The large-deviation speed is $a_N=N^p$, and the answer isHere and below a large deviation principle at speed $a_N$ means the open-set lower bound $\mathrm{liminf}{a}_N^{-1}\log \mathbb{P}(X_N\in G)\ge -{\inf }_{G}I$ and the closed-set upper bound $\mathrm{limsup}{a}_N^{-1}\log \mathbb{P}(X_N\in F)\le -{\inf }_{F}I$. The displayed rate function is nontrivial and is a good rate function.

For $0<u<v$, the exponential distribution givesShrinking an interval about any $x>0$ supplies the local lower bound $-\lambda x$; neighborhoods of zero have probability tending to one. Every open set intersecting the nonnegative half-line contains one of these neighborhoods, giving the open-set bound. If a closed set $F$ contains zero, its upper bound is just $\mathbb{P}(\cdot )\le 1$. If it meets $[0,\infty )$ but excludes zero, closedness gives $b=\inf (F\cap [0,\infty ))>0$, and $\mathbb{P}(A/a_N\in F)\le e^{-\lambda a_{N}b}$. A closed set disjoint from the support has probability zero. This proves the full large deviation principle, including the boundary at zero.

The fixed exponential tail explains the speed: an excursion of size $x{N}^{1+\epsilon }$ costs $e^{-\lambda x{N}^{1+\epsilon }}$. The full Gärtner–Ellis theorem is unnecessary here; the limiting cumulant-generating function is flat on $\theta <\lambda$ and infinite at $\theta \ge \lambda$, so it fails the theorem's essential smoothness hypothesis.

Assume ${\sigma }^2>0$; otherwise the scaled sum is deterministic and no nontrivial rate function is possible. The sum has normal distribution $B_N\sim N(N\mu ,N{\sigma }^2)$. For $X_N=B_N/N^{1+\epsilon }$, use the faster large-deviation speed $b_N=N^{1+2\epsilon }$. The moment-generating function of a normal distribution yieldsThe limiting cumulant-generating function is finite and differentiable on all of $\mathbb{R}$, hence satisfies the Gärtner–Ellis theorem. Its Legendre-Fenchel transform is obtained by maximizing $\theta x-{\sigma }^2{\theta }^2/2$, whose maximizer is $\theta =x/{\sigma }^2$. ThusThe drift disappears because the scaled mean is $\mu /N^{\epsilon }\to 0$. The rate function is nontrivial and good. The corrected scaled cumulant-generating function used here contains an expectation; the corresponding formula in the paper's reference material omits it.

Interpret the additional copies in $Z_N$ as independent of the initial $T_1,\dots ,T_k$, as well as of one another. Set $r=k\lambda$. The Cramér theorem for rate-$r$ exponential random variables gives the rate functionIndeed their cumulant-generating function is $\log (r/(r-\theta ))$ for $\theta <r$, and the maximizer in its Legendre-Fenchel transform is $\theta =r-1/z$. For $Z_N/N$, replacing $N$ summands by $N-k$ does not change either the speed $N$ or this rate function. One can also see this directly from $N^{-1}\log \mathbb{E}{e}^{\theta Z_N}\to \log (r/(r-\theta ))$ and the Gärtner–Ellis theorem.

The product large-deviation principle, followed by the contraction principle for large deviations under addition, now givesFor $x>0$ this is the minimum over $0<z\le x$ ofIf $k>1$, its derivative with respect to $z$ is $r-\lambda -1/z$. Hence the optimum is $z=\min (x,1/[\lambda (k-1)])$, andThe two expressions agree at the transition and have the same derivative $\lambda$. The minimum rate zero occurs at the typical value $x=1/(k\lambda )$. If $k=1$, the minimand is $\lambda x-1-\log (\lambda z)$, decreasing in $z$, so insteadThese are good rate functions. The affine branch for $k>1$ is the slow exponential plus an exponential sample mean mechanism: the bulk ceases to carry additional excess, which instead comes from $T_1$. In particular, blindly applying the full Gärtner–Ellis theorem to the combined sum would be unjustified. Its limiting cumulant-generating function is $\log (r/(r-\theta ))$ only for $\theta <\lambda$, with a finite boundary slope when $k>1$; essential smoothness fails. The product and contraction argument proves the missing lower bounds.

Let $\delta =C-\mu >0$, and first suppose $\sigma >0$. For the infinite-horizon contraction, use the usual sublinear path space for fluid queues,We interpret the supplied path-space large deviation principle in this norm, or in a topology with the same workload-continuity property. The paper does not specify its norm explicitly; mere convergence on compact time intervals would not justify an infinite-horizon contraction.

Define the queue workload functionalIt is finite and nonnegative on the sublinear path space for fluid queues. Here is the required continuity argument. Fix $f$ and choose $T\ge 1$ so that $|\sigma f(t)|\le \delta t/4$ for $t\ge T$. If $\Vert g-f{\Vert }_{\mathrm{sl}}<\delta /(4\sigma )$, then for $t\ge T$,The corresponding expression for $f$ is also negative there, whereas at zero both are zero. Each supremum can therefore be restricted to $[0,T]$, givingThus $R$ is a continuous map; this proof also shows why the negative drift is essential.

Substituting $t=Ns$ into the queue workload givesThe contraction principle for large deviations says that a continuous image of a family with good rate function $I$ has the same large-deviation speed and good rate function obtained by minimizing $I$ over each fibre. ConsequentlyIn particular $J(0)=0$: $Z/\sqrt{L}\to 0$ in the path norm almost surely, so the given large deviation principle and lower semicontinuity give $I(0)=0$, and $R(0)=0$. If $\sigma =0$, the queue workload is identically zero and the rate function is zero at zero and infinite elsewhere. No unspecified variance normalization of the fractional Brownian motion is needed for this variational answer.

Let $\kappa =2(1-H)$ and fix $a>0$. Starting with part (b), the contraction principle for large deviations under the map $q\mapsto q/a$ gives an LDP for $r(X)/(aN)$ with speed $N^{\kappa }$ and rate function $q\mapsto J(aq)$.

Alternatively, replace $N$ by $aN$ in parts (a) and (b), using the real-scale justification in part (a). The same family has large-deviation speed $(aN{)}^{\kappa }$ and rate function $J(q)$. When expressed at speed $N^{\kappa }$, that rate function is $a^{\kappa }J(q)$. The two descriptions of the same large deviation principle must agree:For clarity, uniqueness here is a general property of lower semicontinuous rate functions: at a point $x$, the shrinking-neighborhood logarithmic bounds recover $I(x)$, since ${\inf }_{B(x,\eta )}I\to I(x)$ as $\eta \downarrow 0$. Thus two rate functions for the same family and speed cannot differ.

Taking the base argument $q=1$ and replacing $a$ by any positive queue size givesFor $q<0$ the rate function is infinite. In the usual nondegenerate case $J(1)$ is finite, so the formula also holds at $q=0$. This is the self-similar Gaussian workload rate; the exponent comes from the Hurst parameter, while the constant comes from the path rate function and the drift and noise scales.