---
title: One Big Jump Principle
url: https://www.emergentmind.com/topics/one-big-jump-principle
type: topic
---

# One Big Jump Principle

The **One Big Jump Principle** is a heavy-tail asymptotic principle asserting that certain rare large values of sums, additive functionals, or extremal observables are typically realized by a *single exceptional contribution* rather than by the coherent accumulation of many moderate ones. In its classical one-dimensional form, for i.i.d. summands \(X_1,\dots,X_n\) with a subexponential distribution and \(S_n=\sum_{i=1}^n X_i\), the far-right tail satisfies
\[
\mathbb P(S_n>x)\sim n\,\mathbb P(X>x),\qquad x\to\infty,
\]
and, at density level, \(f_{S_n}(x)\sim n f(x)\). The interpretation is that the event \(S_n\approx x\) is asymptotically produced by one summand of order \(x\), with \(n\) equivalent locations for that exceptional fluctuation [2603.01829]. Although this principle originated in the study of sums of independent heavy-tailed random variables, subsequent work has extended, modified, or contradicted it in settings involving stretched-exponential tails, multivariate deviations, moving cutoffs, correlated increments, branching structures, excursion decompositions, and constrained persistence events [2602.01168], [2106.14222], [2206.14627].

## 1. Classical formulation and probabilistic meaning

The standard formulation concerns sums of i.i.d. nonnegative or centered real-valued random variables in a heavy-tailed or subexponential regime. In the one-dimensional stretched-exponential setting, if \(Y\) satisfies
\[
\log \PP(Y\ge t)\sim -c\,t^\alpha \qquad (t\to\infty),
\]
with \(\alpha\in(0,1)\), then Nagaev-type results imply that for every \(t>0\),
\[
\lim_{N\to\infty}\frac{1}{N^\alpha}\log \PP\left(\frac{1}{N}\sum_{i=1}^N Y_i\ge t\right)
=
\lim_{N\to\infty}\frac{1}{N^\alpha}\log \PP(Y_1\ge Nt)
=
-c\,t^\alpha .
\]
This is the classical one-big-jump principle: on the logarithmic scale, the deviation of the sum is caused by one exceptional summand [2602.01168].

A closely related asymptotic, standard in the subexponential literature, is
\[
\PP\!\left(\sum_{i=1}^N X_i>t\right)\sim N\PP(X_1>t), \qquad t\to\infty.
\]
In this regime, the upper tail of the sum is asymptotically the same as the upper tail of the maximum. The mechanism is that simultaneous occurrence of two or more extreme summands is asymptotically negligible relative to the event that exactly one summand is extreme [2602.01168], [2106.14222].

A precise abstract formulation of the “principle of a single big jump” also appears in the distributional class \(\mathcal J\). For i.i.d. nonnegative \(X_1,X_2,\dots\), with \(S_n=\sum_{i=1}^n X_i\) and \(X_{n,1}\) the largest order statistic, \(F\in\mathcal J\) if for all \(n\ge 2\),
\[
\lim_{K\to\infty}\liminf_{x\to\infty}
\mathbb P\!\left(X_{n,1}>x-K\,\middle|\,S_n>x\right)=1.
\]
Equivalently, conditional on the rare event \(S_n>x\), asymptotically one summand lies within bounded distance of the full threshold, while the remaining summands contribute only a bounded amount [1411.1625], [1406.2754].

## 2. Tail classes and asymptotic regimes

The principle is most naturally associated with **subexponential** or **heavy-tailed** distributions, but the precise form depends strongly on the tail class. For symmetric stretched-exponential densities
\[
f(\chi)=\widetilde N \exp\!\left(-\alpha^\beta |\chi|^\beta\right),\qquad 0<\beta<1,
\]
the far tail of the \(n\)-fold convolution \(\phi(x|n)=f^{*n}(x)\) obeys
\[
\phi(x|n)_{BJP}\sim n f(x),\qquad |x|\to\infty,
\]
which is the density-level version of the principle. In this regime one summand forms a condensate, while the remaining \(n-1\) variables produce only lower-order fluctuations [2603.01829].

The same paper emphasizes that this description is strictly asymptotic and does not capture the crossover from the Gaussian core to the condensed tail. For \(|x|\ll \sqrt n\), one has the CLT regime
\[
\phi(x|n)_{CLT}\approx \frac{1}{\sqrt{2\pi n}\,\exp\!\left(-\frac{x^2}{2n}\right),
\]
whereas for fixed \(n\) and \(|x|\to\infty\), the one-big-jump asymptotic applies. Between these regimes lies a moderate-deviation region in which the classical principle alone is insufficient [2603.01829].

By contrast, for thin-tailed distributions the principle fails. In stretched-exponential Weibull laws with parameter \(\alpha>1\), the big-jump formulas underestimate rare-event probabilities by many orders of magnitude, and the correct asymptotics are of ordinary large-deviation type,
\[
P(R,T)\sim e^{-T \cdot I(R/T)},
\]
with a collective many-small-deviation mechanism rather than a single dominant event [1911.09974].

The class \(\mathcal J\) shows that one-big-jump behavior is broader than classical subexponentiality but still constrained. Heavy-tailed distributions in \(\mathcal J\) are automatically **strongly heavy-tailed**, meaning
\[
\lim_{x\to\infty} e^{\lambda x}\bar F(x)=\infty
\quad\text{for all }\lambda>0.
\]
Thus \(\mathcal J\cap\mathcal K\subset \mathcal{OS}\cap\mathcal K\subset \mathcal{DK}^c\), so heavy-tailed single-big-jump laws cannot have arbitrarily irregular tails [1406.2754]. At the same time, \(\mathcal J\) is strictly larger than \(\mathcal S\) and larger than the light-tailed convolution-equivalent classes \(\mathcal S(\gamma)\); there exist light-tailed members of \(\mathcal J\) not even weakly tail equivalent to any convolution-equivalent distribution [1411.1625].

## 3. Beyond leading order: perturbative and large-deviation refinements

A recent development replaces the leading statement \(\phi(x|n)\sim n f(x)\) by a systematic asymptotic expansion around the condensed configuration. For stretched-exponential summands, the convolution integral can be rewritten by isolating one macroscopic jump and scaling the remaining \(n-1\) variables as \(y_i=\chi_i/x\), yielding an integral dominated by \(n\) nonanalytic cusps of a geometric function \(g(\vec y)\), each cusp representing one symmetry-related condensed configuration [2603.01829].

For general fixed \(n\), this yields the asymptotic structure
\[
\phi(x|n) \sim n f(x)\,[G(x)]^{\,n-1},
\]
where
\[
G(x)=1+\sum_{\substack{l>0\\ l\ \mathrm{even}}}^{\infty}
\frac{d_l(x)}{x^l}\,\mathbb E[x^l].
\]
The zeroth-order approximation is precisely the classical one-big-jump formula,
\[
\phi(x|n)\approx n f(x),
\]
and the next correction is controlled by
\[
d_2(x)=\frac{\beta}{2}\,\alpha^{\beta}|x|^{\beta}
\Big(\beta\,\alpha^{\beta}|x|^{\beta}-\beta+1\Big),
\]
so that
\[
\phi(x|n)\underset{x\to\infty}{\sim} n f(x)\left(1+\frac12 \beta^2\alpha^{2\beta}|x|^{2\beta-2}\right)^{n-1}.
\]
Probabilistically, \(n f(x)\) is the condensate contribution, while \(G(x)^{n-1}\) captures the collective fluctuation cloud of the non-condensed background [2603.01829].

This perturbative construction yields the crossover scale
\[
|x|\sim n^{1/(2-\beta)},
\]
with anomalous exponents
\[
\xi=\frac{1}{2-\beta},\qquad \eta=\frac{\beta}{2-\beta}.
\]
The resulting approximate rate function,
\[
\mathcal{I}_{approx}(r)=\alpha^\beta |r|^\beta - \frac12 \alpha^{2\beta}\beta^2 |r|^{2\beta-2},
\]
matches the large-\(r\) expansion of the exact large-deviation rate function
\[
\mathcal{I}(r)=\min_{t\in[0,r]}\left\{\alpha^\beta |t|^\beta+\frac12 |r-t|^2\right\},
\]
which describes competition between a condensate of size \(t\) and a Gaussian background of size \(r-t\) [2603.01829].

This line of work explicitly positions itself as complementary to Edgeworth theory: Edgeworth expansions correct the Gaussian core in large \(n\), whereas the perturbative big-jump expansion corrects the condensed tail in large \(x\) [2603.01829].

## 4. Generalizations, deformations, and failures of the principle

### Multivariate deviations: few big jumps

In higher dimensions, the one-dimensional principle does not survive unchanged. For i.i.d. centered vectors in \(\mathbb R^k\) with stretched-exponential tails of rate \((\mathcal J,\alpha)\), the large-deviation rate for coordinatewise exceedance is
\[
\calI_\calJ(\bt):=\min\Big\{\sum_{r=1}^k \calJ\big(\bt^{(r)}\big): \bt^{(r)}\in\mathbb R_+^k,\ \sum_{r=1}^k \bt^{(r)}=\bt\Big\}.
\]
The geometric argument behind this variational problem shows that at most \(k\) nonzero summands are needed. The correct multivariate analogue is therefore a **few-big-jumps principle**, not a literal one-big-jump principle: a deviation in \(\mathbb R^k\) is typically realized by at most \(k\) large vectors, with one jump remaining optimal only in special geometries [2602.01168].

The paper gives explicit counterexamples in \(k=2\) where the target \((1,1)\) is more cheaply achieved by two large vectors, one supporting each coordinate, than by a single vector satisfying both constraints. In one dimension, the variational rate reduces to \(\mathcal I_\mathcal J(t)=\mathcal J(t)\), recovering the classical principle [2602.01168].

### Moving cutoff: fewest big jumps

A different deformation arises when summands are truncated at the same scale as the deviation. For triangular arrays \(W_1^{(n)},\dots,W_n^{(n)}\) with \(0\le W^{(n)}\le n\) and
\[
S_n=\sum_{i=1}^n W_i^{(n)},
\]
the event \(S_n\approx n(\mu+\rho)\) cannot be produced by one summand once \(\rho>1\), because each variable is bounded by \(n\). The dominant mechanism becomes the **fewest-big-jumps principle**: if \(k-1<\rho<k\), then exactly
\[
k=\lceil \rho\rceil
\]
macroscopic summands realize the excess [2206.14627].

The main local asymptotic is
\[
\mathbb P\Big(n(\rho_1(n)+\mu)\le S_n \le n(\rho_2(n)+\mu)\Big)
=
\big(K_\rho+o(1)\big)\binom{n}{k}\,(\rho_2(n)-\rho_1(n))\, f(n)^k,
\]
and the conditional structure theorem states that, under this event, exactly \(k\) summands are of order \(n\), their sum produces the entire excess \(\rho n\), and the remaining \(n-k\) variables still obey a law of large numbers [2206.14627]. The classical one-big-jump case is recovered only for \(0<\rho<1\).

### Correlated increments: one jump plus memory trail

For random walks with correlated increments
\[
\tilde{\delta}_i=\sum_{j=1}^i M_{i-j}\,\delta_j,
\qquad
\tilde{x}_N=\sum_{i=1}^N \tilde{\delta}_i
=\sum_{k=1}^N W_{N-k}\,\delta_k,
\]
with heavy-tailed IID innovations \(\delta_k\), the rare event is still initiated by one large innovation, but correlation propagates its effect to later increments. The conditional principle becomes
\[
\tilde{x}_N \stackrel{d}{\sim} W_{N-b}\,\tilde{\delta}_{\max}
\quad\text{conditioned on the big jump occurring at step }b,
\]
while the unconditional version is
\[
\mathbb{P}(\tilde{x}_N>z)\sim \frac{\tilde{\gamma}_N}{N}\,\mathbb{P}(\tilde{\delta}_{\max}>z),
\qquad
\tilde{\gamma}_N=\sum_{k=1}^N (W_{N-k})^\alpha.
\]
Thus the principle survives, but the observable extreme is the big jump together with its memory-generated aftereffects [2106.14222].

## 5. Physical and stochastic-process realizations

### Continuous-time random walks and propagators

In CTRWs with stretched-exponential jump density \(f\) and finite-mean waiting-time law \(\psi\), the propagator
\[
P(x,t)=\sum_{n=0}^\infty Q_t(n)\,\phi(x|n)
\]
inherits a one-big-jump structure. At leading order,
\[
P(x,t)_{BJP}\sim \langle n_t\rangle f(x),\qquad |x|\to\infty,
\]
meaning the tail is the probability of one large jump times the mean number of opportunities to realize it. Incorporating the perturbative correction to \(\phi(x|n)\) yields an expansion in powers of \(G(x)-1\), with coefficients determined by moments \(\langle n_t^p\rangle\) of the renewal count [2603.01829].

This connects to an earlier physical “rate formalism” for rare displacements in transport processes. There the far-tail density \(B(R,T)\) is written as
\[
B(R,T) \sim \int dx \int_0^T dT_w\, r_N(T_w)\lambda(x)\, {\cal P}(R|T,x,T_w),
\]
where \(r_N(T_w)\) is the rate of opportunities to realize a new microscopic event, \(\lambda(x)\) is its tail density, and \({\cal P}\) is the kinematic propagator from one single event to the observed rare displacement [1911.09974], [1804.02932].

### Lévy flights, Lévy walks, and Lévy-Lorentz gas

For Lévy flights with jump law
\[
p(r)=\frac{\alpha r_0^\alpha}{r^{1+\alpha}},
\]
the far tail of the running maximum is
\[
P(X,n)\sim \frac12\,n\,\frac{\alpha r_0^\alpha}{X^{\alpha+1}},
\]
which is the direct extreme-value analogue of the one-big-jump principle [2404.19406].

For Lévy walks with finite velocity \(v\), the maximum tail becomes
\[
P(X,T)\sim B_0(X,T)+B_1(X,T),
\]
with one term corresponding to a big flight still ongoing at time \(T\) and the other to a big flight completed earlier. In infinite-density scaling form,
\[
P(X,T)\sim T^{-\alpha}I_\alpha\!\left(\frac{X}{vT}\right),
\]
showing that finite velocity imposes a ballistic cutoff and splits the tail by path topology [2404.19406], [1804.02932].

For the Lévy-Lorentz gas, the big jump is a quenched large gap in the disorder landscape rather than an IID flight. The maximum still arises from one exceptional structural element, but topology-induced memory modifies both the effective number of opportunities and the post-jump dynamics. The resulting asymptotics depend on \(X/(vT)\) and differ sharply from those of Lévy walks because the walker can reflect repeatedly inside the same long gap [2404.19406].

### Continuous correlated observables and excursions

A major continuous-path realization appears in Ornstein–Uhlenbeck dynamics for the time-integrated observable
\[
A=\int_0^T v^n(t)\,dt.
\]
Using the excursion decomposition between zero crossings, one writes
\[
A=\sum_{i=1}^N \mathcal A_i+\mathcal A^*,
\qquad
T=\sum_{i=1}^N \tau_i+\tau^*,
\]
where \(\mathcal A_i\) is the area under one excursion and \(\tau_i\) its duration. For \(n>2\), the single-excursion area density has stretched-exponential tail
\[
f_{v_0}(\mathcal{A}) \sim v_0 \exp\left\{-\frac{\gamma^{\frac{n+2}{n}}}{\sigma^2} c_n \mathcal A^{2/n}\right\},
\]
with \(2/n<1\), hence subexponential. Therefore
\[
P(A,T)\underset{A\to\infty}{\sim}\langle N(T)\rangle f(A)\sim \frac{T}{\langle\tau\rangle}f(A),
\]
so a rare large value of the time-integrated observable is realized by one exceptional excursion area [2501.07704]. This gives a physical interpretation of the anomalous large-deviation scaling previously derived by instanton methods.

### Trapping models and lagging plumes

In biased CTRWs with heavy-tailed waiting times
\[
\phi(\tau)=\alpha \frac{\tau_0^\alpha}{\tau^{1+\alpha}},\qquad 1<\alpha<2,
\]
the one big jump is not a large spatial displacement but one exceptionally long **trapping time**. In the rare-event sector far behind the mean drift,
\[
x \doteqdot \frac{t-\tau_{\max}}{\langle\tau\rangle}\,a,
\]
so the position deficit is asymptotically determined by the largest waiting time. The resulting rare tail of the propagator and the rare tail of the maximum trapping time share the same infinite-density form, and these rare sluggish trajectories control the anomalous growth of the mean square displacement [1906.04249].

## 6. Exceptions, competing principles, and boundary cases

The one-big-jump principle is not universal. Several recent papers make clear that the correct asymptotic mechanism can be qualitatively different depending on geometry, constraints, and recursion structure.

A sharp counterexample is the persistence problem for sample averages of a heavy-tailed random walk in a compact convex set \(A\) with \(0\notin A\). The event
\[
\left\{\frac{S_k}{k}\in A\ \text{for all }k=1,\dots,n\right\}
\]
is not realized by one catastrophic jump. Instead, it requires a sequence of large jumps whose number grows like
\[
K_n\sim \frac{\log n}{\log r^*},
\]
where \(r^*\) is a geometric radial expansion factor of \(A\). The survival probability then satisfies
\[
\lim_{n\to\infty}\frac{1}{(\log n)^2}\log P_n
=
-\frac{\alpha-1}{2\log r^*},
\]
and the authors describe this as a **principle of infinitely many big jumps** [1902.09922]. The reason is that one jump cannot sustain the sample average in a set bounded away from the origin across all times up to \(n\); repeated rejuvenation is necessary.

In branching settings, further variants arise. For tree-indexed random walks on a finite rooted tree, the maximum displacement can obey a one-big-jump principle provided the largest single edge increment dominates branchwise fluctuation scales. If \(V\) is the number of non-root vertices, \(H\) the height, and \(X\) the edge law, the paper gives a sufficient criterion in terms of a geometric exponent \(D\) and a distribution-dependent threshold \(\mathsf D(X)\): if \(H\lesssim V^{1/D}\) with \(D>\mathsf D(X)\), then
\[
\frac{M_n^S}{M_n^X}\xrightarrow{\mathbb P}1,
\]
and the tail of the maximal displacement is asymptotically the tail of the largest edge jump [1505.04949].

A different branching analogue appears for weighted branching random walks. There, for
\[
Z_n=\sum_{|u|=n} e^{-V_u}\delta_{V_u},
\]
one has
\[
Z_n((nc+t_n,\infty))=W\,n\,\mathbb P(S_1>t_n)(1+o(1))
\]
in the heavy-tail Nagaev regime, with \(W\) the additive martingale limit. The paper interprets this as a principle of one big jump along the ancestral lineage of those particles contributing to the upper tail mass [2603.16316].

Finally, delicate boundary-index cases still exhibit a single-big-jump structure but require refined control. In a branching-process fixed-point equation
\[
X \stackrel{d}{=} A+\sum_{i=1}^X B_i,
\]
with
\[
\mathbb P(A>x)\sim \frac{1}{1+x},
\qquad
\mathbb P(B>x)=\frac{L(x)}{1+x},
\qquad
L(x)\sim (\log x)^{-1-\varepsilon},
\]
the stationary tail obeys
\[
\mathbb P(X>x)\sim \frac{1}{(1-b)(1+x)},
\]
with only negligible logarithmic corrections of order \(L(x)\log x/(1+x)\). The dominant rare event is still effectively one large immigration shock, geometrically amplified by branching, and the paper terms this a **Boundary Principle of a Single Big Jump** [2509.05650].

## 7. Conceptual significance and recurring structures

Across these varied formulations, several structural motifs recur.

The first is **condensation**: a rare event localizes onto one degree of freedom, one excursion, one gap, one lineage increment, one waiting time, or one structural cluster. In stochastic-process language, the principle explains why far tails often lie outside the scope of Gaussian or Cramér-type large deviations [2603.01829], [2501.07704].

The second is **competition with collective fluctuations**. In many models the rare event can be realized either democratically, by many moderate contributions, or condensately, by one exceptional contribution. The one-big-jump principle identifies the condensed side of that competition. The multivariate few-big-jumps principle, the moving-cutoff fewest-big-jumps principle, and the infinitely-many-big-jumps persistence mechanism are all ways this competition can be reshaped by geometry or constraints [2602.01168], [2206.14627], [1902.09922].

The third is **nontrivial crossover structure**. The leading asymptotic \(\mathbb P(S_n>x)\sim n\mathbb P(X>x)\) is often not enough in applications. The perturbative expansion “beyond the big jump” demonstrates that the condensed regime itself has an internal fluctuation theory, with explicit higher-order corrections and anomalous crossover exponents [2603.01829].

The fourth is **robustness beyond IID sums**. Physical transport models, correlated random walks, excursion decompositions, branching recursions, and quenched media all admit one-big-jump descriptions once the correct microscopic unit of condensation is identified. That unit need not be a literal jump length; it may be an excursion area, a trapping interval, a gap in a random medium, or an ancestral displacement [2106.14222], [2501.07704], [1906.04249], [2404.19406].

The fifth is **fragility under smoothing mechanisms**. Disorder in generalized pinning models destroys the flat constrained-free-energy branch on which the big-jump phase depends, thereby removing the partially localized phase altogether [2003.05140]. This suggests that whether one-big-jump structure survives under perturbation depends sensitively on whether the perturbation preserves a zero-cost branch for underconstrained configurations.

In modern usage, therefore, the “One Big Jump Principle” refers less to a single rigid theorem than to a family of asymptotic mechanisms. The classical statement remains the canonical prototype, but current research treats it as one member of a broader taxonomy that includes systematic corrections, multivariate few-jump analogues, cutoff-constrained minimal-jump analogues, correlated and branching variants, boundary-case refinements, and explicit counterexamples where condensation requires more than one extreme contribution [2603.01829], [2602.01168], [2206.14627], [2106.14222], [1902.09922].

Source: https://www.emergentmind.com/topics/one-big-jump-principle