REVIEW 2 major objections 4 minor 20 references
Large deviation probabilities for sums of censored random variables with regularly varying distribution tails
T0 review · 2 major / 4 minor · reviewed 2026-08-07 · deepseek-v4-flash
Pith's one-line read This paper proves uniform asymptotic formulas for the tail probabilities of sums of censored random variables across the whole range $x=O(M_n)$, governed by a multiple large jumps principle.
desk verdict Strong, likely true asymptotic results for censored sums, but the proof of Theorem 3 as written relies on a misstated conditional limit and needs a direct proof of (38). read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The mathematical engine is the multiple large jumps principle: for $x$ of order $M_n$, the only trajectories contributing to $P(Y_n>x)$ are those with exactly $k$ summands of size of order $M_n$. The named objects carrying the formulas are the functions $W_m(z)=\alpha^m\int_{D_m(z)}(t_1\cdots t_m)^{-\alpha-1}\,dt$ on the simplex $D_m(z)=\{t:\max_i t_i<1,\ \sum_i t_i>z\}$, which behave like convolutions of $m$ power-law conditional tail distributions and are computed recursively, and the uniform random-walk representation $H_n(z)=\Phi(z n^{-1/2})+nV(z)\mathbf{1}_{\{z>n^{1/2}\}}$ for the uncensored sum. The proof conditions on a low threshold $h_nM_n$ with $h_n\downarrow 0$, uses the asymptotic (35) for conditional tails scaled by $M_n$, and squeezes $P(Y_n>x)$ between two shifted versions $x\pm 2s_n$ of the same expression, which is why uniformity in $x$ survives.
What would settle it
For power-law tails with $2<\alpha<3$ and $M_n=n^a$ with $a>1/2$, compute $P(Y_n>x)$ at $x=(k-h_n)M_n$ and $x=(k-1+h_n)M_n$ for several slowly vanishing $h_n$; if the ratio to the right-hand side of (13) does not approach 1 for any $h_n$ satisfying the paper's lower bounds, the uniformity assertion behind Theorem 3 is false. A second check is to find a slowly varying $L$ for which the limit in (36) with $h_n$ in place of $h_0$ fails.
Extended reading notes
Core claim
In the authors' own terms, the central discovery is that the tail of a censored sum in the region $x=O(M_n)$ is governed by a multiple large jumps principle with two complementary asymptotic shapes. When $x$ lies in a shrinking window around $kM_n$, the dominant event has exactly $k$ summands censored to $M_n$, and the remaining uncensored part must exceed the residual $x-kM_n$; this gives $P(Y_n>x)\sim \Pi_n^k H_n(x-kM_n)/k!$ uniformly (Theorem 2). When $x$ lies strictly between $(k-1)M_n$ and $kM_n$, the sum exceeds $x$ precisely when there are $k$ large terms, $j$ of which are censored and the other $k-j$ bridge the remaining gap, yielding $P(Y_n>x)\sim (\Pi_n^k/k!)\sum_{j=0}^k \binom{k}{j} W_{k-j}(x/M_n-j)$ uniformly (Theorem 3). The paper proves that these two expressions coincide on the overlap intervals around the multiples, so the asymptotics pass continuously from one form to the other as $x$ crosses $kM_n$.
Load-bearing premise
The proof of Theorem 3 assumes without proof that a uniform convergence of the scaled conditional tail that is known for a fixed positive threshold remains true when the threshold is replaced by a slowly vanishing sequence $h_n\downarrow 0$; if this uniformity fails, the squeezing argument would need extra regularity on the slowly varying function or a slower decay of $h_n$.
Editorial extensions
If this is right
- For every deviation $x$ of order $M_n$, the tail probability of a capped sum now has a uniform asymptotic formula with relative error tending to zero, closing the gap between the single-jump regime below the cap and the multiple-jump regime above it.
- At deviations just below $M_n$, censoring is asymptotically invisible: $P(Y_n>x)\sim nV(x)$, so a single uncensored jump still drives the event.
- Near $x=kM_n$, the probability is asymptotically the chance that exactly $k$ terms hit the cap times the uncensored walk tail at the residual $x-kM_n$, identifying the dominant mechanism for each multiple.
- Between multiples, formula (13) quantifies every mixed scenario with $j$ capped and $k-j$ uncensored large terms, so the relative weights of the configurations are computable from the $W_m$ integrals.
- The overlap verification means the piecewise formula can be used across boundaries without introducing artificial jumps, a property relevant for actuarial risk calculations.
Reading between the lines
- If the uniformity claim for the conditional tail convergence with $h_n\downarrow 0$ is supplied, the same proof should extend to triangular arrays where the jump distribution varies slowly with $n$, as long as the tail index $\alpha$ is stable; the $W_m$ functions would be unchanged.
- The formulas suggest a discrete-spectrum picture of the large-deviation tail: the dominant configurations are indexed by the integer $k$ of cap-reaching terms, and the $W_m$ integrals interpolate between the normal and power-law contributions; this may connect to large-deviation results for infinitely divisible jump processes with truncation.
- A concrete numerical check is available: for power-law-tailed increments and $M_n=n^a$ with $a>1/2$, Monte Carlo estimates of $P(Y_n>x)$ at the endpoints of each interval $((k-1+h_n)M_n,(k-h_n)M_n)$ should match both sides of the overlap formulas.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies sums Y_n of i.i.d. zero-mean unit-variance random variables whose right tail V(t)=t^{-α}L(t) is regularly varying with α>2, censored at a threshold M_n with M_n≫(n log n)^{1/2}. It states a complete asymptotic description of P(Y_n>x) for x=O(M_n): Theorem 1 recovers the uncensored single-jump asymptotics below M_n; Theorem 2 gives P(Y_n>x)∼(Π_n^k/k!)H_n(x−kM_n) near each multiple kM_n; Theorem 3 gives a multi-term representation involving the functions W_m in the intervals between multiples; Remark 3 argues that the two representations merge smoothly in overlap zones. The proofs use Rozovskii's uniform normal/single-jump representation, a decomposition by the number of jumps exceeding a threshold, and a conditional weak convergence argument for the k largest order statistics.
Significance. If the results are correct, they constitute a substantial contribution: they give the first fine-grained large-deviation asymptotics for censored heavy-tailed sums over the entire O(M_n) range, going beyond the earlier vague-convergence results for truncated vectors and exhibiting a multiple-large-jumps principle with smooth transitions. Theorems 1 and 2 are embedded in known theory, and Remark 3 is a useful internal consistency check. The main novel content is Theorem 3, and its proof is not complete as written because it depends on an unproved uniformity assertion. The paper is therefore a promising but not yet fully established contribution.
major comments (2)
- [Proof of Theorem 3, after Eq. (36)] The proof of Theorem 3 hinges on the sentence 'The standard argument shows that (36) will still hold if one replaces in it the fixed h0 > 0 with our positive sequence hn ↓ 0...'. No argument is supplied, and this is not a routine consequence of the uniform convergence theorem for slowly varying functions: the range of v in (36) expands as 1/h_n, so one must control the ratios L(u_i h_n M_n)/L(h_n M_n) uniformly for u_i as large as 1/h_n. The authors need either to prove this uniformity or to prove the unconditional convergence (38) directly. The preceding assertion that a sequence h_n satisfying (28) exists is also stated without proof. It is worth noting that the possible divergence of L(M_n)/L(h_n M_n) when h_n is chosen near the minimal admissible rate n^{-1/2+o(1)} is not by itself an obstruction, because h_n may be chosen far more slowly; nevertheless the proof as written does not establish the required uniformity for any choice of h_n.
- [Proof of Theorem 2, after Eq. (22)] The proof uses the assertion 'nV(εnMn) ≤ Hn(x−kMn)(1+o(1)) for |x−kMn| < εnMn'. This is false when ε_nM_n is bounded. For example, take M_n=n, ε_n=1/n, k=1 and x=M_n+1/2; then x is in the stated range, H_n(x−M_n)=Φ(1/(2√n))→1/2, while nV(ε_nM_n)=nV(1)→∞. The earlier bound (21) is strong enough to imply o(Π_n^k) directly when H_n is bounded below, so the gap is local, but the written deduction via (22) needs replacement, or Theorem 2 must be restricted to sequences with ε_nM_n→∞.
minor comments (4)
- [Figure 1 caption] The word 'explaind' should be 'explained'.
- [Introduction, notation] The abbreviation 'R W' is used with inconsistent spacing and is distracting; plain 'random walk' would be clearer.
- [Remark 1] The claim that Theorems 2 and 3 hold uniformly in k≤k0 for slowly growing k0 is stated without proof; this is not a central issue, but the reader should be told which 'standard argument' is meant.
- [Proof of Theorem 3, Eq. (30)] The lower bound on h_n after (29) is used to justify (30), but the text does not explicitly note that h_n must also be eventually less than 1; this is immediate from h_n→0 but should be said.
Circularity Check
No significant circularity: the asymptotic representations are derived from external large-deviation results and direct conditioning, with no fitted inputs or self-referential definitions.
full rationale
The paper's main theorems are not equivalent by construction to their inputs. The constants Π_n, W_k, and H_n are defined from the model primitives (V, n, M_n, α), not fitted to the probabilities being estimated. Theorem 1 follows from the standard single-jump asymptotics (6) and Rozovskii's uniform representation (8); Theorem 2 follows from an exact decomposition by the number of jumps above M_n/(k+2); Theorem 3 follows from conditioning on exactly k jumps above h_n M_n, the regular-variation convergence in (35), and the explicit integral definition of W_k. The cited tools, including Corollary 4.1.3 and regular-variation facts from [4], are independent published results used as lemmas; although [4] is partly self-citation, the cited statements do not presuppose the present theorems. The only questionable step is the unproved 'standard argument' after (36), where a fixed h0 > 0 is replaced by a slowly vanishing h_n ↓ 0; that is a potential proof gap, not a use of the conclusion as an input, so it does not constitute circularity. No fitted parameter is relabelled as a prediction and no target formula is redefined into existence.
Assumptions & free parameters
assumptions (8)
- domain assumption E ξ = 0 and E ξ^2 = 1 (condition (1))
- domain assumption V(t) = P(ξ > t) = t^{-α} L(t), α > 2, L slowly varying (condition (5))
- domain assumption M_n ≫ s_n = ((α−2)n ln n)^{1/2} (condition (9))
- domain assumption E(ξ^2; |ξ| > t) = o(1/ln t) as t → ∞ (condition (7))
- standard math Uniform large deviation representation P(S_n > x) ∼ H_n(x) uniformly in x ∈ R from Rozovskii [20]
- standard math Corollary 4.1.3 from Borovkov and Borovkov [4]
- standard math Uniform convergence theorem for slowly varying functions
- ad hoc to paper Uniformity claim in eq. (36) survives replacing h_0 by a slowly vanishing sequence h_n
Cite this review
Pith. "Pith review of Large deviation probabilities for sums of censored random variables with regularly varying distribution tails." pith.science (2026). https://pith.science/paper/6K7RJZNN
@misc{pith2026250603727,
author = {Pith},
title = {Pith review of: Large deviation probabilities for sums of censored random variables with regularly varying distribution tails},
year = {2026},
howpublished = {\url{https://pith.science/paper/6K7RJZNN}},
note = {Machine review of arXiv:2506.03727}
}
abstract
Let $\xi_1, \xi_2,\ldots$ be a sequence of independent and identically distributed random variables with zero mean, finite second moment and regularly varying right distribution tail. Motivated by a stop-loss insurance model, we consider a threshold sequence $M_n\gg (n\ln n)^{1/2},$ $n\to \infty,$ and establish the asymptotics of the probabilities of the large deviations of the form $ \sum_{j=1}^n(\xi_j \wedge M_n)>x$ in the whole spectrum of $x$-values in the region $O(M_n).$ The asymptotic representations for these probabilities obey the "multiple large jumps principle" and have different forms in the vicinities of the multiples $kM_n$ of the censoring threshold values, on the one hand, and inside intervals of the form $((k-1)M_n, kM_n),$ on the other. We show that there is a "smooth transition" of these representations from one to the other when the deviation $x$ increases to a multiple of $M_n$, "crosses" it and then moves away from it.
Figures
Reference graph
Works this paper leans on
-
[4]
Asymptotic Analysis of Random Walks
Borovkov, A.A., Borovkov, K.A. Asymptotic Analysis of Random Walks. Heavy- Tailed Distributions (Cambridge University Press, Cambridge, 2008)
work page 2008
-
[1]
A characterization of multivariate regular variation
Basrak, B., Davis, R.A., Mikosch, T. A characterization of multivariate regular variation. Ann. Appl. Probab., 12 (2002), 908–920
work page 2002
-
[2]
Regular Variation (Cambridge Uni- versity Press, Cambridge, 1987)
Bingham, N.H., Goldie, C.M., Teugels, J.L. Regular Variation (Cambridge Uni- versity Press, Cambridge, 1987)
work page 1987
-
[3]
Probability Theory (Springer, London, 2013)
Borovkov, A.A. Probability Theory (Springer, London, 2013)
work page 2013
-
[5]
Borovkov, A.A., Borovkov, K.A. An extension of the concept of slowly varying function with applications to large deviation limit theorems, in Prokhorov and Contemporary Probability Theory, eds. Shiryaev, A.N. et al. (Springer, Berlin, 2013), 127–140
work page 2013
-
[6]
Effect of truncation on large deviations for heavy-tailed random vectors
Chakrabarty, A. Effect of truncation on large deviations for heavy-tailed random vectors. Stoch. Proc. Appl., 122 (2012), 623–653
work page 2012
-
[7]
large deviations for truncated heavy-tailed random variables: A boundary case
Chakrabarty, A. large deviations for truncated heavy-tailed random variables: A boundary case. Indian J. Pure Appl. Math. , 48 (2017), 671–703
work page 2017
-
[8]
Understanding heavy tails in a bounded world or, is a truncated heavy tail heavy or not?
Chakrabarty, A., Samorodnitsky, G. Understanding heavy tails in a bounded world or, is a truncated heavy tail heavy or not?. Stoch. Mod., 28 (2012), 109– 143
work page 2012
Show all 20 references
-
[9]
Sur un nouveau th´ eoreme-limite de la th´ eorie des probabilit´ es.Actu- alites Sci
Cram´ er, H. Sur un nouveau th´ eoreme-limite de la th´ eorie des probabilit´ es.Actu- alites Sci. Indust. , 736 (1938), 5–23
1938
-
[10]
An Introduction to Heavy-tailed and Subex- ponential Distributions, 2nd edn (Springer, New York, 2013)
Foss, S., Korshunov, D., Zachary, S. An Introduction to Heavy-tailed and Subex- ponential Distributions, 2nd edn (Springer, New York, 2013). 17
2013
-
[11]
Values of Mills’ ratio of area to bounding ordinate and of the normal probability integral for large values of the argument
Gordon, R.D. Values of Mills’ ratio of area to bounding ordinate and of the normal probability integral for large values of the argument. Ann. Math. Stat., 12 (1941), 364–366
1941
-
[12]
A contribution to the theory of large deviations for sums of in- dependent random variables
Heyde, C.C. A contribution to the theory of large deviations for sums of in- dependent random variables. Z. Wahrscheinlichkeitstheor. verw. Geb. , 7 (1967), 303–308
1967
-
[13]
Limit theorems that take into account large deviations when Cram´ er’s condition is violated.Izv
Nagaev, A.V. Limit theorems that take into account large deviations when Cram´ er’s condition is violated.Izv. Akad. Nauk. UzSSR, Ser. Fiz-Mat Nauk , 13 (1969), 17–22. (In Russian.)
1969
-
[14]
Integral limit theorems taking large deviations into account when Cram´ er’s condition does not hold
Nagaev, A.V. Integral limit theorems taking large deviations into account when Cram´ er’s condition does not hold. I, II.Theory Probab. Appl., 14 (1969), 51–64; 193–208
1969
-
[15]
Some limit theorems for large deviations
Nagaev, S.V. Some limit theorems for large deviations. Theory Probab. Appl., 10 (1965), 214–235
1965
-
[16]
large deviations of sums of independent random variables
Nagaev, S.V. large deviations of sums of independent random variables. Ann. Probab., 7 (1979), 745–789
1979
-
[17]
Sums of Independent Random Variables (Springer, Berlin, 1975)
Petrov, V.V. Sums of Independent Random Variables (Springer, Berlin, 1975)
1975
-
[18]
A problem on large deviations in a space of trajectories
Pinelis, I.F. A problem on large deviations in a space of trajectories. Theory Probab. Appl., 26 (1981), 69–84
1981
-
[19]
Extreme Values, Regular Variation, and Point Processes (Springer, New York, 1987)
Resnick, S. Extreme Values, Regular Variation, and Point Processes (Springer, New York, 1987)
1987
-
[20]
Probabilities of large deviations of sums of independent random variables with common distribution function in the domain of attraction of the normal law
Rozovskii, L.V. Probabilities of large deviations of sums of independent random variables with common distribution function in the domain of attraction of the normal law. Theory Probab. Appl., 34 (1989), 625–644. 18
1989
Reviewed August 7, 2026 · model on record in the stance chip above.
Discussion (0). Sign in to comment.