---
title: Conditional Cramér–Edgeworth Expansion
url: https://www.emergentmind.com/topics/conditional-cramer-edgeworth-expansion
type: topic
---

# Conditional Cramér–Edgeworth Expansion

Search arXiv for "conditional Edgeworth expansion Cramér conditional Gibbs principle"
Conditional Cramér–Edgeworth expansion denotes a family of asymptotic representations for conditional laws, conditional tail probabilities, or conditionally stabilized local limits in which the leading term is either Gaussian or exponentially tilted, and higher-order corrections are written through cumulants and Hermite-polynomial terms. In the cited literature, conditioning appears in several distinct forms: on extreme exceedances of a sum, on the exact value of a normalized sum in a super-large deviation regime, on a finite collection of past states for additive functionals of uniformly elliptic Markov chains, on a sum constraint in generalized urn models, and on a fixed shot-noise total. Across these settings, the expansion is obtained by a change of measure, Fourier inversion, and model-specific control of the remainder; the resulting formulas quantify when conditioning preserves Gaussian-type asymptotics, when it produces oscillatory lattice corrections, and when it destroys asymptotic independence [1610.04052], [2203.15907], [1210.2198], [1401.4419], [1912.07275], [1302.1337].

## 1. Principal settings and conditional objects

The topic does not refer to a single theorem, but to a recurring asymptotic mechanism. In the i.i.d. extreme-deviation setting, one studies the conditional density of one coordinate or of a fixed block given the rare event \(\{S_n>n a_n\}\), where \(S_n=X_1+\cdots+X_n\) and \(a_n\to\infty\) [1610.04052]. In the super-large deviation setting of Cao, the focus is the local behavior of \(S_n\) at \(n a_n\), derived from the \(n\)-fold convolution of a normalized tilted density under a triangular array [1302.1337]. In generalized urn models, the random frequency vector is represented as conditionally independent given its sum, and Edgeworth expansions are derived for decomposable statistics under that conditioning [1401.4419].

In lattice Markov-chain problems, the conditional object is different: one expands \(\mathbb P\{S_N=k\}\) and its conditioned variants given \(X_{j_1},\dots,X_{j_\ell}\), with the possibility of additional oscillatory factors \(e^{2\pi i a k/J}\) coming from arithmetic resonances [2203.15907]. In martingale large deviations, the conditioning is encoded through the filtration and the conjugate distribution technique of Cramér; the resulting expansion is expressed through conditional cumulants and conditional Bernstein bounds rather than through an event of the form \(\{S_n=n a_n\}\) [1210.2198]. In Poisson shot noise, the expansion is used to approximate the conditional density of \(R_1\) given \(S=s\), uniformly in \(s\) [1912.07275].

| Setting | Conditional object | Leading form |
|---|---|---|
| Extreme i.i.d. sums | \(X_1\mid\{S_n>n a_n\}\), or \((X_1,\dots,X_k)\mid\{S_n>n a_n\}\) | Tilted density \(T_{t_n}\) with Hermite corrections |
| Lattice additive functionals | \(S_N\mid X_{j_1},\dots,X_{j_\ell}\) | Gaussian term times polynomials and trigonometric factors |
| Sum-constrained models | \(R_N(\mathbf n)\mid \sum \xi_m=n\), or \(R_1\mid S=s\) | Gaussian or tilted term with cumulant corrections |

A plausible implication is that “conditional Cramér–Edgeworth expansion” is best understood as a methodological class rather than a single canonical formula.

## 2. Conditioning by tilting, conjugate measures, and operator perturbation

The standard i.i.d. construction begins with a tilted density
\[
T_t(x)=\exp\{t x-\Lambda(t)\}p(x),
\]
where \(\Lambda(t)=\log \Psi(t)\), \(m(t)=\Lambda'(t)\), \(s^2(t)=\Lambda''(t)\), and \(\kappa_j(t)=\Lambda^{(j)}(t)\) for \(j\ge 3\). For a threshold sequence \(a_n\), one chooses \(t_n>0\) so that \(m(t_n)=a_n\), and then uses \(T_{t_n}\) as the reference law for the conditioned coordinate [1610.04052]. Cao’s super-large deviation analysis uses the same tilt in the form
\[
\pi^{a_n}(x)=e^{t_n x-\psi(t_n)}p(x),
\]
with \(t_n=t(a_n)\) defined by \(m(t_n)=a_n\), and studies the triangular array obtained by normalizing i.i.d. variables under \(\pi^{a_n}\) [1302.1337].

For martingales, the analogue of the tilted law is the conjugate measure \(P_\theta\), defined through the martingale
\[
Z_k(\theta)=\prod_{i=1}^k \frac{e^{\theta X_i}}{M_i(\theta)},\qquad M_i(\theta)=E[e^{\theta X_i}\mid\mathcal F_{i-1}].
\]
Under \(P_\theta\), the sum decomposes as
\[
S_n=Y_n(\theta)+B_n(\theta),
\]
with \(B_n(\theta)=\sum_{i=1}^n b_i(\theta)\), \(b_i(\theta)=E_\theta[X_i\mid\mathcal F_{i-1}]\), and cumulant-generating process \(V_n(\theta)=\sum_{i=1}^n \log M_i(\theta)\) [1210.2198]. The saddle-point parameter is then chosen by solving \(B_n(\theta)=x\).

In the shot-noise problem, the same logic is expressed through a Cramér transform. For
\[
Y^{(r)}=\frac{S^{(r)}-\mu(r)}{\sigma(r)},
\]
one introduces a parameter \(\xi=\xi(y,r)\) so that under the tilted measure \(E[Y^{(r)}]=y\), and rewrites the density through a contour-shifted Fourier inversion formula [1912.07275]. In the lattice Markov setting, the role of tilting near nonzero resonant points is played by a sequential Perron–Frobenius perturbation theorem giving analyticity of the transfer-operator’s top eigenvalue \(\lambda_n(z)\) and conditional cumulant-generating functions on blocks \([n,k]\) [2203.15907].

These constructions are formally different, but they all replace the original conditioned problem by an auxiliary law under which cumulants can be expanded explicitly.

## 3. Canonical algebraic forms

In the extreme i.i.d. exceedance problem, setting
\[
y=\frac{x-a_n}{s_n},\qquad s_n^2=s^2(t_n),
\]
one obtains, for any fixed integer \(m\ge 1\),
\[
p(X_1=x\mid S_n>n a_n)
=
T_{t_n}(x)\left\{1+\sum_{r=1}^m n^{-r/2}Q_r\bigl(y;\kappa_3(t_n),\dots,\kappa_{r+2}(t_n)\bigr)\right\}
+
O\bigl(n^{-(m+1)/2}\bigr),
\]
uniformly in \(x\ge 0\). Each \(Q_r\) is an explicit linear combination of Hermite polynomials with coefficients that are universal polynomials in the tilted cumulants. The first two corrections are
\[
Q_1(y)=\frac{\kappa_3}{6\,s_n^3}H_3(y),\qquad
Q_2(y)=\frac{\kappa_4}{24\,s_n^4}H_4(y)+\frac{\kappa_3^2}{72\,s_n^6}H_6(y),
\]
with \(H_3(y)=y^3-3y\) and \(H_4(y)=y^4-6y^2+3\) [1610.04052].

Cao’s triangular-array result has the same Hermite structure. If
\[
Y_{i,n}=\frac{X_i-m(t_n)}{s(t_n)},\qquad
\gamma_n=\frac{\mu_3(t_n)}{s^3(t_n)},
\]
and \(P_n\) denotes the normalized density of the \(n\)-fold convolution, then uniformly in \(x\in\mathbb R\),
\[
P_n(x)=\phi(x)\left[1+\frac{\gamma_n}{6\sqrt n}(x^3-3x)\right]+O\!\left(\frac1n\right).
\]
After translating back to the original sum, this yields a local limit at \(n a_n\) with an exponential factor \(\exp\{-nI(a_n)\}\), the scale \(s_n\sqrt n\), and higher-order corrections involving tilted cumulants \(\kappa_r(a_n)\) [1302.1337].

In generalized urn models, decomposable statistics satisfy
\[
P\{U_N\le x\}
=
\Phi(x)+\sum_{k=1}^r N^{-k/2}Q_k(x)\phi(x)+R_{r+1}(x;N),
\]
where \(Q_k\) has degree \(3k\) and is built from joint cumulants of the pairs \((g_{m,N}(\xi_m),\xi_m)\). The first two polynomial corrections again have the standard Hermite pattern:
\[
Q_1(x)=\frac{\kappa_{3,N}}{6}(x^2-1),\qquad
Q_2(x)=\frac{\kappa_{4,N}}{24}(x^3-3x)+\frac{\kappa_{3,N}^2}{72}(x^5-10x^3+15x)
\]
[1401.4419].

The Markov-chain lattice expansion differs in one decisive respect. There is an integer \(J=J(K)<\infty\) and polynomial families \(P_{a,b,N}\) such that
\[
P\{S_N=k\}
=
\sum_{a=0}^{J-1}\sum_{b=1}^r
\sigma_N^{-b}\,
P_{a,b,N}\!\left(\frac{k-a_N}{\sigma_N}\right)\,
g(k_N)\,
e^{2\pi i a k/J}
+
o(\sigma_N^{-r}),
\]
uniformly in \(k\in\mathbb Z\). Under the paper’s non-concentration-mod-\(m\) condition, the terms with \(a\neq 0\) vanish and one recovers the usual single-term lattice Edgeworth expansion [2203.15907].

For martingales, the expansion is presented in large-deviation form:
\[
P(S_n\ge x)=\bigl(1-\Phi(x/\sigma_n)\bigr)\exp\{\cdots\},
\]
with first coefficients
\[
\lambda_1(x)=\frac{\kappa_{3,n}}{6\sigma_n^3}(x^3-3x)\frac1{\sqrt n},
\]
and
\[
\lambda_2(x)=\frac{\kappa_{4,n}}{24\sigma_n^4}(x^4-6x^2+3)\frac1n
+\frac{\kappa_{3,n}^2}{72\sigma_n^6}(-x^6+15x^4-45x^2+15)\frac1n,
\]
where \(\kappa_{r,n}\) are conditional cumulants [1210.2198].

## 4. Structural assumptions and remainder control

The extreme-deviation i.i.d. theory assumes a density
\[
p(x)=\exp(-g(x)+q(x)),\qquad x\ge 0,
\]
with \(g\) convex, four-times differentiable, and growing fast enough at infinity; equivalently, \(h=g'\) lies in the class \(R\) of regularly- or rapidly-varying functions. The perturbation \(q\) is bounded and of smaller-order variation. Under these conditions, a sharp Abelian theorem yields
\[
m(t)=h^{-1}(t)(1+o(1)),\qquad
s^2(t)=h'(h^{-1}(t))(1+o(1)),\qquad
\kappa_j(t)=O\bigl(h^{-1}(t)^{\,2-j}\bigr)\quad (j\ge 3).
\]
The final remainder estimate takes the form
\[
\sup_{x\ge 0}\left|p(X_1=x\mid S_n>n a_n)-T_{t_n}(x)\sum_{r=0}^m n^{-r/2}Q_r(y)\right|
\le
C\,n^{-(m+1)/2}(1+|y|^L),
\]
so the expansion is uniformly valid on the full real line in the \(y\)-variable [1610.04052].

Cao’s Abelian theorem imposes the Cramér condition on the moment-generating function, steepness on \([0,t_+)\), and the requirement \(h\in\mathcal R\). It then gives
\[
m(t_n)\sim v(t_n),\qquad s^2(t_n)\sim v'(t_n),\qquad
\frac{\mu_3(t_n)}{[s^2(t_n)]^{3/2}}\to 0,
\]
so the skewness of the tilted law vanishes in the super-large deviation regime [1302.1337].

In the martingale setting, the assumptions are conditional Bernstein’s condition and variance regularity:
\[
|E[X_i^k\mid \mathcal F_{i-1}]|
\le \tfrac12 k!\,\epsilon^{k-2}E[X_i^2\mid \mathcal F_{i-1}],\qquad k\ge 3,
\]
together with \(|V_n-\sigma_n^2|\le \delta_n\), where \(\delta_n=o(\sigma_n^2)\). For every fixed \(m\ge 1\), the remainder satisfies, uniformly in \(0\le x=o(n^{1/6})\),
\[
|R_{m+1}(x,n)|\le C\,\frac{1+x^{3m+6}}{n^{(m+1)/2}}
\]
[1210.2198].

The generalized urn expansion is driven by a Lindeberg-type condition \(L_{2+\delta,N}\to 0\), moment assumptions up to order \(s\ge r+2\), and smoothing conditions on characteristic functions. Its remainder satisfies
\[
\sup_{x\in\mathbb R}|R_{r+1}(x;N)|
\le
C\bigl(L_{2+\delta,N}+K_{2+\delta,N}+E_N(\delta)\bigr),
\]
and under extra smoothing the range may be extended to \(|x|=o(N^{1/6})\) [1401.4419].

For power-law shot noise, writing \(\rho=r^{d/2}\), Theorem 1 gives
\[
\sup_y |E_k(y;r)|
\le
C_2 C_3^k k^{k/2}\rho^{-(k+1)}
\]
whenever \(r^{d/2}\ge C_4\sqrt{k}\), uniformly in the tilt parameter \(y\) [1912.07275]. This suggests that explicit remainder control is one of the defining features of the conditional theory, but the control mechanism is model-dependent.

## 5. Independence thresholds, arithmetic obstructions, and conditional stability

One of the central results in the extreme-deviation Gibbs framework is that conditional asymptotic independence is not automatic. Fix \(k\ge 2\). In the moderate-growth regime
\[
a_n\to\infty,\qquad \frac{a_n}{s_n\sqrt n}\to 0,
\]
the joint conditional density of \((X_1,\dots,X_k)\) given \(\{S_n>n a_n\}\) satisfies
\[
p(X_1=x_1,\dots,X_k=x_k\mid S_n>n a_n)
=
\prod_{i=1}^k T_{t_n}(x_i)\,(1+o(1)),
\]
so the first \(k\) coordinates become asymptotically independent. In the fast-growth regime,
\[
0<\liminf \frac{a_n}{s_n\sqrt n}\le \limsup \frac{a_n}{s_n\sqrt n}<\infty,
\]
the second-order correction in the joint expansion no longer factorizes, and finite-block independence fails. The independence threshold is exactly
\[
a_n=o(\sqrt n\,s_n)
\]
[1610.04052].

The lattice Markov-chain theory identifies a different obstruction: arithmetic resonance. Standard Edgeworth expansions of order \(r\) hold in a conditionally stable way if and only if, for every \(m\) and every \(\ell\), the conditional distribution of \(S_N\) given \(X_{j_1},\dots,X_{j_\ell}\) mod \(m\) is \(o_\ell(\sigma_N^{1-r})\) close to uniform, uniformly in the choice of conditioning indices. Equivalently,
\[
\Delta_{N,m,\ell}=O(\sigma_N^{1-r})\qquad\text{for all }m\le 2K.
\]
In particular, the local-limit theorem (\(r=1\)) is stable under such conditioning if and only if the conditional modulo-\(m\) law converges to uniform at rate \(o(1)\) [2203.15907].

Generalized urn models provide a third perspective: the random vector of frequencies is viewed as conditionally independent given the sum, and the Edgeworth expansion exploits that representation [1401.4419]. The literature therefore explicitly separates three phenomena that are often conflated: conditional independence by representation, asymptotic independence under rare-event conditioning, and conditional stability of an Edgeworth expansion after conditioning on part of the process. These are not equivalent.

## 6. Applications and significance

In generalized urn models, the conditional expansion yields explicit asymptotics for decomposable statistics in sampling with replacement, sampling without replacement, and the multicolor Pólya–Egenberger scheme. The examples treated include the chi-square statistic, the sample sum in the without-replacement scheme, and Dixon’s spacing-frequency statistic for two-sample homogeneity tests [1401.4419]. In the chi-square example, the paper gives a two-term Edgeworth expansion; in the without-replacement example, it recovers the familiar first correction of order \(n^{-1/2}\).

For uniformly elliptic Markov chains, the expansions support a quantitative Prokhorov-type theorem, a conditionally stable local-limit theorem, and recovery of the “super-stable” Edgeworth theorems of Dolgopyat–Hafouta in the case of bounded independent summands. The paper also states that these formulas can be used for explicit pre-asymptotic error bounds in metastability, rare-event simulation, and statistical-mechanics models with integer observables [2203.15907].

In power-law shot noise, the Edgeworth expansion is turned into an approximation scheme for the conditional density \(f_{R_1\mid S=s}\) to any desired accuracy, with error bounds uniform in \(s\). The same work proves a stochastic comparison between \((R_1,R_2,\dots)\) given \(S=s\) and unconditioned radii \((R_1',R_2',\dots)\), and gives an algorithmic scheme in which the overall error is \(O(\exp(-c\sqrt\ell\,\ln\ell))\le \epsilon\), with \(\ell\sim(\ln(1/\epsilon)/\ln\ln(1/\epsilon))^2\) and polynomial growth in \(\epsilon^{-1}\) [1912.07275].

In the extreme-sum and super-large deviation literature, the expansion is tied directly to the conditional Gibbs principle. Cao develops an Abelian theorem and a triangular-array Edgeworth expansion for the regime \(S_n/n=a_n\to\infty\), while Biret–Broniatowski–Cao study the conditional distribution under \(\{S_n>n a_n\}\) and identify the threshold at which finite-block asymptotic independence emerges or fails [1302.1337], [1610.04052].

Taken together, these results place conditional Cramér–Edgeworth expansion at the intersection of large deviations, local limit theory, and conditional limit theorems. The common structure is a cumulant expansion under a transformed measure; the decisive differences are the conditioning mechanism, the presence or absence of arithmetic resonances, and the regime in which the conditional law does or does not decouple.

Source: https://www.emergentmind.com/topics/conditional-cramer-edgeworth-expansion