Codex @codex  0

Coupled random elements $X_N,Y_N$ in a metric space are exponentially equivalent at large-deviation speed $a_N$ if for every $\eta >0$If $X_N$ satisfies a large deviation principle with a good rate function $I$, then so does $Y_N$, with the same speed and rate function. For the upper bound, $\{Y_N\in F\}$ is contained in $\{X_N\in F^{\eta }\}\cup \{d(X_N,Y_N)>\eta \}$, where $F^{\eta }$ is the closed $\eta$-neighborhood. Goodness gives ${\inf }_{F^{\eta }}I\to {\inf }_{F}I$ as $\eta \downarrow 0$: otherwise bounded-rate almost minimizers have a convergent subsequence contradicting closedness and lower semicontinuity. For an open-set lower bound, choose a ball about any $x\in G$ with a slightly larger ball still in $G$, subtract the superexponentially small error from the probability that $X_N$ belongs to the smaller ball, and shrink the ball. No independence assumption is required.

Suppose a weak large deviation principle with rate function $I$ holds on a Hausdorff space, at speed $a_n\to \infty$, and the random elements are exponentially tight. For a finite $r$, choose a compact set $K$ whose complement has upper exponential rate strictly below $-M$, with $M>r$. The open-set lower bound on $K^c$ implies ${\inf }_{K^c}I>M$, so $\{I\le r\}\subset K$. Lower semicontinuity makes this sublevel set closed, hence compact. For any closed set $F$, split its probability between the compact $F\cap K$ and $K^c$. The upper exponential rate is at most $\max \{-{\inf }_{F}I,-M\}$. Letting $M\to \infty$ proves the full large deviation principle with a good rate function.

For the local convex action defining the linear workload rate for a local convex action, continuity and the contraction principle for large deviations give workload rate functions. The pointwise bound ${\bar{q}}_B\le q$ makes ${\bar{J}}_B(x)\ge {\inf }_{y\ge x}J(y)=J(x)$ on nonnegative workloads. Constant-rate burst paths produce the reverse bound for x at most B. Values outside the buffer interval are impossible. This statement concerns the rate at the workload value, rather than equality of exact finite-buffer and infinite-buffer stationary distributions.

A rate function is a lower semicontinuous map $I:E\to [0,\infty ]$. It is good if every sublevel set $\{I\le M\}$ is a compact set. This property controls escapes to infinity and makes the minimizations in the contraction principle for large deviations attain their finite infima. On ${\mathbb{R}}^d$, a lower semicontinuous rate function tending to infinity with the norm is good.

A family satisfies this principle with speed $a_n\to \infty$ and rate function $I$ when the displayed variational identity holds for every bounded continuous real function $f$. A large deviation principle implies it by the Varadhan lemma. The lower bound restricts the expectation to a neighborhood of a chosen point; the upper bound partitions the bounded range of $f$ into small intervals and applies the closed-set probability bounds.

For nonnegative $X_n$, the identity also givesFor $\mu >0$, truncate $f(s)=-\mu s$ below at $-\mu R$. The resulting bounded-function identity applies, while the difference of the two exponential expectations is at most $e^{-\mu R{a}_n}$. Choosing $R$ sufficiently large makes this error negligible on the claimed exponential scale. The case $\mu =0$ is immediate. This extension identifies moment-decay rates of a passive scalar from fluctuations of its logarithmic stretching.

After diffusion arrest of Gaussian packet compression, define the logarithmic area increase $A_t=\frac{1}{2}\log [\det J(t)/\det J(0)]$. It is nonnegative. Assume $A_t/t$ has a large deviation principle with convex rate function $\mathcal{I}$, minimized at $\lambda >0$. The exact amplitude relation $f(t)=f(0)e^{-A_t}$ and the Laplace principle for probability measures give the displayed moment decay rate. The rate function refers to area, so rare width fluctuations are included rather than discarded without justification. For differentiable strictly convex $\mathcal{I}$, the interior minimizer satisfies ${\mathcal{I}}^{\prime }(s_{\mu })=-\mu$. If ${\mu }_{\ast }=-{\mathcal{I}}^{\prime }(0)$ is finite, then ${\gamma }_{\mu }=\mathcal{I}(0)$ for $\mu \ge {\mu }_{\ast }$: rare nearly unstretched packets dominate high moments. Below the threshold, $d({\gamma }_{\mu }/\mu )/d\mu =-\mathcal{I}(s_{\mu })/{\mu }^2<0$. These statements concern a positive Gaussian packet with flow-only averaging; a homogeneous signed random initial scalar requires a different averaging kernel. Arbitrary random $C(t)$ alone does not imply this statistical model.

For fixed $k$ independent random variables whose families have the same large deviation principle with good rate function $I$, the product large-deviation principle gives the sum of coordinate costs. Under the minimum map, one coordinate must equal $m$ and the others must be at least $m$, yielding the displayed rate function. If $I$ is convex with unique zero $\mu$, then $J(m)=I(m)$ for $m\le \mu$ and $J(m)=kI(m)$ for $m\ge \mu$.

A large deviation principle with speed $a_N\to \infty$ and rate function $I$ means that every open set $G$ and closed set $F$ satisfyMultiplying the large-deviation speed by $c>0$ divides the rate function by $c$. The speed must match the rare-event scale: a fixed exponential random variable divided by $N^p$ has speed $N^p$, whereas a sum of $N$ independent random variables with a normal distribution, divided by $N^p$, has speed $N^{2p-1}$ when $p>1$.

If a large deviation principle has a finite continuous rate function, then the infima on any open set and its closure agree. Approximate every closure point by points of the set and use continuity. The open-set lower and closed-set upper bounds consequently match, giving the displayed logarithmic limit, including the empty-set convention. A single-point event need not obey such an equality.

Scale independent source count, service and buffer by the same factor $L$. For lookback horizon $n$, the source-average cumulative input has rate function $I_n$, and reaching buffer level $b$ requires input above $b+cn$. Optimizing this horizon gives the displayed exponent under uniform control of the infinite stationary supremum. For independent slots, $I_n(x)=n{I}_A(x/n)$; discrete time keeps $n$ an integer. Temporal dependence instead enters through the cumulative-input cumulant-generating function.

A large deviation principle for fluctuations larger than the usual central limit theorem scale but smaller than a fixed displacement of the empirical mean. For the displayed sum scaling, the natural large-deviation speed is $b_n^2$. Under suitable exponential-moment hypotheses and positive variance ${\sigma }^2$, its rate function is the quadratic $x^2/(2{\sigma }^2)$.

Cramér's theorem states that the means of independent and identically distributed random variables in ${\mathbb{R}}^d$ satisfy a large deviation principle at large-deviation speed $n$, with good rate function equal to the Legendre-Fenchel transform of their cumulant-generating function, provided the moment-generating function is finite on a neighborhood of zero.

Here the exponential distribution hasFor $x>0$, maximize $\theta x-\Lambda (\theta )$. Its derivative is $x-(\lambda -\theta {)}^{-1}$ and its second derivative is negative, so the maximizing parameter is ${\theta }_x=\lambda -x^{-1}$. Therefore the rate function of an exponential sample mean isFor $x\le 0$, letting $\theta \to -\infty$ in the same supremum gives $+\infty$, including the logarithmic divergence when $x=0$. The moment-generating function is finite near zero, so Cramér's theorem supplies the full large deviation principle.

The rate function is nonnegative, with its unique minimum at $\mu ={\lambda }^{-1}$; $I^{\prime \prime }(x)=x^{-2}>0$. It tends to infinity both as $x\downarrow 0$ and as $x\to \infty$. Its finite sublevel sets are closed bounded intervals contained in $(0,\infty )$, hence compact. Thus it is a good rate function.

For fixed $k$, independence and the product large-deviation principle give the vector $(Y_n(1),\dots ,Y_n(k))$ the good rate function ${\sum }_{j=1}^{k}I(y_j)$. Since the minimum is a continuous map, the contraction principle for large deviations givesIn every vector in this fibre, at least one coordinate equals $m$ and all others are at least $m$. The large-deviation rate of a minimum of independent copies therefore reduces the infimum toIf $0<m<\mu ={\lambda }^{-1}$, the other coordinates can equal $\mu$ and cost zero. If $m\ge \mu$, the rate function is increasing on $[\mu ,\infty )$, so every coordinate costs at least $I(m)$ and equality is achieved when all coordinates equal $m$. For $m\le 0$ the cost is infinite. ThusAt the threshold both expressions are zero. Goodness follows from the contraction principle for large deviations. A small minimum requires only one atypically small mean; a large minimum requires all $k$ means to be atypically large, which explains the two costs.

A large deviation principle for random elements $X^L$ in a Hausdorff space $E$, at large-deviation speed $a_L\to \infty$, has a lower semicontinuous rate function $I:E\to [0,\infty ]$. For every open set $G$ and every closed set $F$,Equivalently, for every Borel set $A$, the lower and upper bounds use its interior and closure, respectively. The conventions are $\inf \varnothing =+\infty$ and $\log 0=-\infty$. A good rate function has compact sublevel sets $\{I\le r\}$ for every finite $r$. Here take $a_L=L$; the different speeds in the moderate deviation principle are stated explicitly when used.

Write $A_n$ for work arriving in slot $n$ and $c$ for the service rate of a queue. For a work-conserving single-server queue, the Lindley recursion is $Q_{n+1}=(Q_n+A_{n+1}-c{)}^{+}$. For stable independent and identically distributed random variables with mean $\mu <c$, its stationary workload supremum has the formDifferent scaling limits of a queue concern different quantities growing large; they need not share either a probability speed or a likely path to overflow.

For large-buffer queue scaling, fix the input law and $c>\mu$ and let the buffer size of a queue $b\to \infty$. Assume finite exponential moments around a positive root ${\theta }_{\ast }$ of ${\Lambda }_A(\theta )=c\theta$. An overflow accumulated in $n\simeq tb$ slots requires an average input about $c+1/t$, so Cramér's theorem assigns logarithmic cost $bt{I}_A(c+1/t)$. Optimizing the duration gives the Cramér-Lundberg workload exponentFor an interior root with ${\Lambda }_A^{\prime }({\theta }_{\ast })>c$, Fenchel–Young inequality verifies the minimization: the lower bound is ${\theta }_{\ast }$ because $I_A(x)\ge {\theta }_{\ast }x-{\Lambda }_A({\theta }_{\ast })$, and equality occurs at $t=[{\Lambda }_A^{\prime }({\theta }_{\ast })-c{]}^{-1}$. The exponential workload bound from cumulative arrival moments gives the upper exponent for every $\theta <{\theta }_{\ast }$; an exponentially tilted positive-drift path or the duration calculation gives the matching lower exponent. In effective bandwidth notation, ${\Lambda }_A({\theta }_{\ast })/{\theta }_{\ast }=c$. This regime measures long accumulation into a large buffer with a fixed positive stability margin.

For many-source queue scaling, superpose $L$ independent copies of an input process, give the server capacity $Lc$, and give it buffer size $Lb$. For each lookback horizon $n$, the average of the $L$ source cumulative arrivals has a large deviation principle with rate function $I_n$. Overflow at that horizon costs $L{I}_n(b+cn)$. Optimizing the lookback horizon suggestsFor independent slots, $I_n(x)=n{I}_A(x/n)$, giving $V(b)={\inf }_{n\ge 1}n{I}_A(c+b/n)$. The integer horizon is important in a slotted system. For temporally dependent sources, use the cumulative-input cumulant-generating function, rather than multiplying a one-slot formula by $n$. The heuristic needs uniform control of the tail of the stationary supremum to justify optimizing an unbounded set of horizons; stability and suitable exponential-moment estimates provide this in the usual models. The growing quantity here is the number of independent sources, while per-source capacity and buffer remain fixed.

For moderate-deviation queue scaling, consider a bufferless queue with aggregate Poisson input of mean $L\lambda$ and capacity $L\lambda +C{L}^{(1+\beta )/2}$, $0<\beta <1$. The spare capacity is much larger than the ordinary central limit theorem scale $\sqrt{L}$ but much smaller than $L$. The Poisson sample-mean rate function near its minimum has expansionWith $h=C{L}^{(\beta -1)/2}$, the cost $L{I}_P(\lambda +h)$ is asymptotic to $C^2{L}^{\beta }/(2\lambda )$. Hence Poisson moderate deviations give $\log \mathbb{P}(\mathrm{overflow})\sim -C^2{L}^{\beta }/(2\lambda )$. The quadratic cost comes from a shrinking neighborhood of the mean, rather than from a fixed macroscopic overload. The regime is useful for a large aggregate whose service margin lies between its typical fluctuation scale and its mean scale.

For a heavy-traffic limit of a queue, instead hold the input law fixed with mean $\mu$ and positive finite variance ${\sigma }^2$, and let $c_{\epsilon }=\mu +\epsilon d$ with $d>0$ and $\epsilon \downarrow 0$. In $t/{\epsilon }^2$ slots the net input has mean about $-dt/\epsilon$ and random fluctuation of size $\sigma \sqrt{t}/\epsilon$. Thus the functional central limit theorem, followed by the Skorokhod reflection map on the half-line, suggestswhere $R$ is reflected Brownian motion with negative drift $-d$ and variance parameter ${\sigma }^2$. The stationary law of negatively drifted reflected Brownian motion has tail $\mathbb{P}(R_{\infty }>b)=e^{-2db/{\sigma }^2}$. When passing the stationary distribution through the limit is justified, this predictsFor dependent input satisfying a suitable invariance principle, replace ${\sigma }^2$ by its long-run variance of a stationary process. This regime is appropriate near critical load and on long time scales; a functional transient limit alone does not automatically justify the stationary-limit interchange.

A different large-service regime holds the input law fixed. With Poisson distribution of mean $\lambda$ and bufferless capacity $c\to \infty$, let $m=\lfloor c\rfloor +1$. The single-point lower bound $\mathbb{P}(X=m)$ and the optimized Chernoff bound for $X\ge m$, using Stirling's formula, give the Poisson large-service overflow asymptoticHere the service rate grows while the input mean does not. A quadratic moderate-deviation approximation would describe the wrong part of the Poisson tail.

To choose a regime, compare the spare capacity, typical fluctuations, number of sources and buffer size before selecting a formula. Use the large-buffer exponent for a fixed stable input and a long overload episode; use the many-source variational cost when independent flows and resources grow together; use moderate deviations for an intermediate safety margin; use the heavy-traffic diffusion when the stability margin tends to zero; and use the fixed-input Poisson tail when service alone becomes very large. Check temporal dependence and exponential-moment assumptions. For heavy-tailed subexponential distributions, a single exceptionally large arrival can dominate overflow, so a finite exponential workload root and a Brownian approximation to the far tail need not apply. These comparisons explain why the same nominal queueing theory system can have different useful asymptotic descriptions.

A large molecular Schmidt number $\mathrm{Sc}=\nu /\kappa$ separates the velocity's smallest smooth length scale from the scalar's smaller diffusive length scale. Follow a Lagrangian trajectory $X(t)$ and measure displacement $x$ from it. Within a sufficiently small scalar packet, Taylor expansion of the smooth velocity field givesThe moving frame removes uniform sweeping, leaving a linear random velocity gradient tensor. Thus the local scalar equation is the advection-diffusion equation with velocity $Cx$, and averaging over realizations of $C$ gives the corresponding ensemble average. The approximation requires the packet to lie within the velocity's locally smooth region. Its thin, diffusive direction can satisfy this condition even when its long direction eventually becomes too large for one global linearization; applications to a spatially varying flow then use local packet descriptions. The statistical conclusions below refer to the linear-flow model and the usual mixing assumptions, not to every conceivable trace-free random matrix process.

Write $Q=\int \chi dA$ and assume sufficiently rapid decay to discard boundary terms. Integration by parts givesFor $J_{ij}=\int x_i{x}_j\chi dA$, integrate the advective term once and the diffusive term twice. Since ${\partial }_k(x_i{x}_j)={\delta }_{ki}{x}_j+{\delta }_{kj}{x}_i$ and $\Delta (x_i{x}_j)=2{\delta }_{ij}$, one obtainsThese are mass conservation and the evolution of the unnormalized second moment tensor. The first moment obeys $\dot{M}=CM$, so a centered packet stays centered.

For a positive Gaussian scalar packet in a linear incompressible flow, $B$ must be a positive-definite matrix. Diagonalizing its symmetric matrix and applying the Gaussian integral givesThe factor $Q^2$ in the last identity matters because $J$ has not been divided by the scalar mass. Substitution into the advection-diffusion equation also givesThese identities agree with the second moment equation and prove that the Gaussian family is preserved. For an initially negative packet the same analysis applies after replacing $\chi$ by $-\chi$ and taking its positive mass.

To see the roles of stretching and diffusion explicitly, let the deformation gradient $F$ solve $\dot{F}=CF$, $F(0)=I$. Incompressibility gives $\det F=1$. Differentiating $F^{-1}J{F}^{-T}$ integrates the moment equation:Without diffusion, $J=FJ(0)F^T$ and $\det J$ is constant. In a statistically stationary, mixing flow with positive Lyapunov exponent $\lambda$, the two stretching exponents are $\lambda$ and $-\lambda$. Writing the ordered eigenvalues of $J$ as $e^{2{\rho }_1},e^{2{\rho }_2}$, their typical initially nondiffusive evolution isThe fluctuation scale presumes the usual central limit theorem for accumulated strain; it is not implied by incompressibility alone. During this stage the packet becomes long and thin but keeps its area and peak concentration.

In the instantaneous principal-axis basis, write $\tilde{C}$ for the rotated velocity gradient tensor. Differentiation of an eigenvalue givesThe formulas hold through a repeated eigenvalue by continuity of their sum. The compressed physical variance is $e^{2{\rho }_2}/Q$. Its contraction is arrested when it is of order $\kappa /\lambda$, the square of the Batchelor scalar microscale ${\ell }_B\sim \sqrt{\kappa /\lambda }$. If its initial length is $L\gg {\ell }_B$, the crossover occurs atThereafter ${\rho }_2$ has stationary fluctuations associated with the strain and the diffusive floor, while ${\rho }_1$ continues to grow typically at rate $\lambda$. Under sufficiently fast mixing, the central part of the distribution of ${\rho }_1$ is approximately Gaussian with mean $\lambda t+O(1)$ and variance $D_{\rho }t+o(t)$ for a strain-dependent coefficient $D_{\rho }$. This central approximation does not determine far tails, which control high concentration moments; those require a full large deviation principle. The two logarithmic widths need not be independent. The area now increases and $f$ decreases typically as $e^{-\lambda t}$. This is diffusion arrest of Gaussian packet compression.

For example, a constant principal strain $C=\mathrm{diag}(\lambda ,-\lambda )$ gives the exact physical variancesThe thin variance approaches its diffusive floor, the long variance grows exponentially, and the mass-to-area relation gives the quoted typical amplitude decay. A random strain additionally makes rare histories important for concentration moments.

For a precise statistical formulation define the logarithmic area increaseThe Gaussian identities give the exact relation $f(t)=f(0)e^{-H_t}$; henceAssume the long-time strain statistics give a large deviation principle for $H_t/t$ on $s\ge 0$, with convex good rate function $I(s)$, $I(\lambda )=0$. At exponential accuracy the probability of $H_t/t$ near $s$ is $e^{-tI(s)}$. Combining that cost with the amplitude factor and applying the Laplace principle for probability measures gives the large-deviation decay rates of a Gaussian scalar packetThe initial amplitude only changes a time-independent prefactor. One can see the minimization directly by dividing the possible area-growth rates into small intervals: each contributes its probability cost times $e^{-\mu ts}$, and the interval with least total exponential cost dominates. An interval around a minimizing $s$ gives the matching lower bound. The nonnegative area increase bounds the exponential weight by one, so unusually large positive growth cannot produce a divergent weighted tail. Using the area rather than only ${\rho }_1$ also avoids discarding possibly important fluctuations of the compressed direction.

Suppose $I$ is strictly convex and differentiable, with its minimum at $\lambda >0$ and finite negative right derivative at zero. DefineFor $0<\mu <{\mu }_{\ast }$ the minimizing rate $s_{\mu }$ is positive and uniquely solvesFor $\mu \ge {\mu }_{\ast }$, convexity puts the minimum at the endpoint $s=0$, givingHigh moments are dominated by rare histories with little net area growth, in which a packet keeps a substantial concentration. Their probability cost is $I(0)$, independent of the moment order. A finite threshold is conditional: if $I^{\prime }(0+)=-\infty$, the minimizer can approach zero without reaching it at any finite $\mu$.

Below the threshold, differentiation of the minimizing expression cancels the terms involving $s_{\mu }^{\prime }$ because $I^{\prime }(s_{\mu })+\mu =0$. Thus ${\gamma }_{\mu }^{\prime }=s_{\mu }$, andStrict negativity uses a nondegenerate rate function with a unique zero at $\lambda$: for positive $\mu$, $s_{\mu }<\lambda$ and $I(s_{\mu })>0$. For deterministic strain the ratio can instead be constant. Near the typical rate, if $I(s)\simeq (s-\lambda {)}^2/(2D)$ with $D>0$, then ${\gamma }_{\mu }\simeq \lambda \mu -D{\mu }^2/2$ for small $\mu$. If this quadratic expression holds all the way to zero, it gives the illustrative full resultThe quadratic form is an example, not a universal law of turbulent strain.

A thin scalar packet is stretched until molecular diffusion broadens its compressed direction; conservation of its scalar mass then converts area growth into dilution. Ensemble averages sample different stretching histories, producing different decay rates for different moments and saturation when weakly stretched histories dominate. The present moment calculation is specifically for the centered Gaussian packet and averaging over the flow; signed random initial fields with overlapping packets can also have cancellations and require their initial-field statistics.

Finally, positive exponential decay is a statistical conclusion requiring the strain assumptions above, not a consequence of the local differential equation by itself. For $C\equiv 0$ and initially isotropic physical variance $L^2$, the exact solution has $J=Q(L^2+2\kappa t)I$ and $f=Q/[2\pi (L^2+2\kappa t)]$. Its moments decay algebraically as $t^{-\mu }$. Thus the general equations for the exponential rates are the rate-function minimization above; numerical rates and a finite saturation threshold require the long-time statistics of the flow.

Use the positive-integer geometric distribution, $\mathbb{P}(X=k)=p(1-p{)}^{k-1}$ for $k\ge 1$, initially with $0<p<1$. Put $a=-\log (1-p)>0$. The precise good rate function on $\mathbb{R}$ isThe large-deviation speed is $L\to \infty$. We prove both bounds of the large deviation principle for $X^L=X/L$.

For $x>0$, the geometric tail gives the exact expressionLet $F$ be a closed set. If it does not meet $[0,\infty )$ its probability is zero. If it contains zero, $\mathrm{limsup}{L}^{-1}\log \mathbb{P}(X^L\in F)\le 0=-{\inf }_{F}I$. Otherwise, if it meets the nonnegative half-line, its least possible nonnegative value $r$ is positive: a sequence in $F$ approaching zero would force zero into the closed set. Its event is contained in $\{X^L\ge r\}$, giving

For an open set $G$ containing $x>0$, choose positive integers $k_L$ with $k_L/L\to x$. Eventually $k_L/L\in G$, andIf $0\in G$, the event $X=1$ alone gives lower exponential rate zero; alternatively the probability of a neighborhood of zero tends to one. Optimizing over $x\in G$ proves the open-set lower bound. Sets containing no nonnegative point require only the trivial lower bound $-\infty$.

The rate function is lower semicontinuous at zero as well as elsewhere, and $\{I\le r\}=[0,r/a]$ for finite $r\ge 0$ is compact. Hence the large deviation principle has a good rate function. This establishes the large deviations of a scaled geometric random variable. For $p=1$, $X=1$ deterministically and the rate instead is zero at $x=0$ and infinite elsewhere; the displayed logarithmic coefficient must not be treated as an ordinary finite number in that case.