Conditional Cramér–Edgeworth Expansion
- Conditional Cramér–Edgeworth expansion is a methodological framework that approximates conditional distributions via tilted measures, cumulant expansions, and Hermite corrections.
- It is applied across diverse settings—extreme-value regimes, Markov chains, urn models, and shot noise—with model-specific remainder controls ensuring precise asymptotic results.
- The approach quantifies thresholds for conditional independence and addresses arithmetic obstructions, supporting applications in large deviations, metastability, and rare-event simulations.
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 (Biret et al., 2016, Dolgopyat et al., 2022, Fan et al., 2012, Mirakhmedov et al., 2014, Járai, 2019, Cao, 2013).
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 , where and (Biret et al., 2016). In the super-large deviation setting of Cao, the focus is the local behavior of at , derived from the -fold convolution of a normalized tilted density under a triangular array (Cao, 2013). 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 (Mirakhmedov et al., 2014).
In lattice Markov-chain problems, the conditional object is different: one expands and its conditioned variants given , with the possibility of additional oscillatory factors coming from arithmetic resonances (Dolgopyat et al., 2022). 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 (Fan et al., 2012). In Poisson shot noise, the expansion is used to approximate the conditional density of 0 given 1, uniformly in 2 (Járai, 2019).
| Setting | Conditional object | Leading form |
|---|---|---|
| Extreme i.i.d. sums | 3, or 4 | Tilted density 5 with Hermite corrections |
| Lattice additive functionals | 6 | Gaussian term times polynomials and trigonometric factors |
| Sum-constrained models | 7, or 8 | 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
9
where 0, 1, 2, and 3 for 4. For a threshold sequence 5, one chooses 6 so that 7, and then uses 8 as the reference law for the conditioned coordinate (Biret et al., 2016). Cao’s super-large deviation analysis uses the same tilt in the form
9
with 0 defined by 1, and studies the triangular array obtained by normalizing i.i.d. variables under 2 (Cao, 2013).
For martingales, the analogue of the tilted law is the conjugate measure 3, defined through the martingale
4
Under 5, the sum decomposes as
6
with 7, 8, and cumulant-generating process 9 (Fan et al., 2012). The saddle-point parameter is then chosen by solving 0.
In the shot-noise problem, the same logic is expressed through a Cramér transform. For
1
one introduces a parameter 2 so that under the tilted measure 3, and rewrites the density through a contour-shifted Fourier inversion formula (Járai, 2019). 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 4 and conditional cumulant-generating functions on blocks 5 (Dolgopyat et al., 2022).
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
6
one obtains, for any fixed integer 7,
8
uniformly in 9. Each 0 is an explicit linear combination of Hermite polynomials with coefficients that are universal polynomials in the tilted cumulants. The first two corrections are
1
with 2 and 3 (Biret et al., 2016).
Cao’s triangular-array result has the same Hermite structure. If
4
and 5 denotes the normalized density of the 6-fold convolution, then uniformly in 7,
8
After translating back to the original sum, this yields a local limit at 9 with an exponential factor 0, the scale 1, and higher-order corrections involving tilted cumulants 2 (Cao, 2013).
In generalized urn models, decomposable statistics satisfy
3
where 4 has degree 5 and is built from joint cumulants of the pairs 6. The first two polynomial corrections again have the standard Hermite pattern: 7 (Mirakhmedov et al., 2014).
The Markov-chain lattice expansion differs in one decisive respect. There is an integer 8 and polynomial families 9 such that
0
uniformly in 1. Under the paper’s non-concentration-mod-2 condition, the terms with 3 vanish and one recovers the usual single-term lattice Edgeworth expansion (Dolgopyat et al., 2022).
For martingales, the expansion is presented in large-deviation form: 4 with first coefficients
5
and
6
where 7 are conditional cumulants (Fan et al., 2012).
4. Structural assumptions and remainder control
The extreme-deviation i.i.d. theory assumes a density
8
with 9 convex, four-times differentiable, and growing fast enough at infinity; equivalently, 0 lies in the class 1 of regularly- or rapidly-varying functions. The perturbation 2 is bounded and of smaller-order variation. Under these conditions, a sharp Abelian theorem yields
3
The final remainder estimate takes the form
4
so the expansion is uniformly valid on the full real line in the 5-variable (Biret et al., 2016).
Cao’s Abelian theorem imposes the Cramér condition on the moment-generating function, steepness on 6, and the requirement 7. It then gives
8
so the skewness of the tilted law vanishes in the super-large deviation regime (Cao, 2013).
In the martingale setting, the assumptions are conditional Bernstein’s condition and variance regularity: 9 together with 0, where 1. For every fixed 2, the remainder satisfies, uniformly in 3,
4
The generalized urn expansion is driven by a Lindeberg-type condition 5, moment assumptions up to order 6, and smoothing conditions on characteristic functions. Its remainder satisfies
7
and under extra smoothing the range may be extended to 8 (Mirakhmedov et al., 2014).
For power-law shot noise, writing 9, Theorem 1 gives
00
whenever 01, uniformly in the tilt parameter 02 (Járai, 2019). 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 03. In the moderate-growth regime
04
the joint conditional density of 05 given 06 satisfies
07
so the first 08 coordinates become asymptotically independent. In the fast-growth regime,
09
the second-order correction in the joint expansion no longer factorizes, and finite-block independence fails. The independence threshold is exactly
10
The lattice Markov-chain theory identifies a different obstruction: arithmetic resonance. Standard Edgeworth expansions of order 11 hold in a conditionally stable way if and only if, for every 12 and every 13, the conditional distribution of 14 given 15 mod 16 is 17 close to uniform, uniformly in the choice of conditioning indices. Equivalently,
18
In particular, the local-limit theorem (19) is stable under such conditioning if and only if the conditional modulo-20 law converges to uniform at rate 21 (Dolgopyat et al., 2022).
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 (Mirakhmedov et al., 2014). 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 (Mirakhmedov et al., 2014). 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 22.
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 (Dolgopyat et al., 2022).
In power-law shot noise, the Edgeworth expansion is turned into an approximation scheme for the conditional density 23 to any desired accuracy, with error bounds uniform in 24. The same work proves a stochastic comparison between 25 given 26 and unconditioned radii 27, and gives an algorithmic scheme in which the overall error is 28, with 29 and polynomial growth in 30 (Járai, 2019).
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 31, while Biret–Broniatowski–Cao study the conditional distribution under 32 and identify the threshold at which finite-block asymptotic independence emerges or fails (Cao, 2013, Biret et al., 2016).
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.