VMSTA Modern Stochastics: Theory and Applications 2351-60542351-60462351-6046 VTeXMokslininkų g. 2A, 08412 Vilnius, Lithuania VMSTA236 10.15559/23-VMSTA236 Research Article A note on randomly stopped sums with zero mean increments LeipusRemigijusremigijus.leipus@mif.vu.lta https://orcid.org/0000-0002-8480-5644 ŠiaulysJonasjonas.siaulys@mif.vu.ltb∗ Institute of Applied Mathematics, Vilnius University, Naugarduko 24, Vilnius, Lithuania, LT-03225 Institute of Mathematics, Vilnius University, Naugarduko 24, Vilnius, Lithuania, LT-03225 Corresponding author. 2024 512202311131422292023291020233112023 © 2024 The Author(s). Published by VTeX2024 Open access article under the CC BY license.

In this paper, the asmptotics is considered for the distribution tail of a randomly stopped sum S ν = X 1 + ⋯ + X ν of independent identically distributed consistently varying random variables with zero mean, where ν is a counting random variable independent of { X 1 , X 2 , … }. The conditions are provided for the relation P ( S ν > x ) ∼ E ν P ( X 1 > x ) to hold, as x → ∞, involving the finiteness of E | X 1 |. The result improves that of Olvera-Cravioto [14], where the finiteness of a moment E | X 1 | r for some r > 1 was assumed.

 Heavy-tailed distribution Consistently varying distribution Randomly stopped sum 60E05 60F10 60G40 Introduction and preliminaries

Let X , X 1 , X 2 , … be independent identically distributed (i.i.d.) random variables (r.v.s). Denote a sequence of partial sums { S n , n ⩾ 0 } by S 0 = 0 , S n : = X 1 + ⋯ + X n , n ⩾ 1 . In this paper, we consider the randomly stopped sum S ν = X 1 + ⋯ + X ν , where ν is a counting r.v. taking values in N 0 : = { 0 , 1 , 2 , … }. We assume that ν is nondegenerate at zero, i.e.  P ( ν = 0 ) < 1, and that ν is independent of { X , X 1 , X 2 , … }. Denote F X , F ν and F S ν the distributions of X, ν and S ν , respectively. In the case where primary r.v.s are heavy-tailed and nonnegative, the standard result states that if ν has finite mean E ν, and its distribution tail is lighter than the tail of X, then F S ν ‾ ( x ) ∼ x → ∞ E ν F X ‾ ( x ) . For important contributions, see Stam [15], Daley et al. [4], Embrechts et al. [7], Faÿ et al. [8]. In Section 4 of the last paper, the case of nonnegative regularly varying summands was examined in detail. Note that, generally, relationship (2) can be obtained under different conditions on r.v.s X and ν (see, e.g., Daley et al. [4]). More precisely, (2) holds under various heavy-tailed distribution classes, moment conditions on X and ν, relationships between the distribution tails F X ‾ and F ν ‾ (typically, F ν ‾ ( x ) = o ( F X ‾ ( x ) )). Usually, weakening the conditions on F ν , stronger conditions on F X are assumed. In the case of real-valued r.v.s, the conditions for (2) depend also on the sign of the mean μ = E X if it exists. For instance, in the case of negative mean, the relation (2) holds for all subclasses of S ∗ (see definition below), which includes most subexponential distributions with finite mean, see Denisov et al. [6, Theorem 1].

In this paper, we pose the problem under what ‘minimal’ moment conditions relation (2) holds in the case of real-valued consistently varying distribution F X with zero mean. Recall that the class of consistently varying distributions (see definition below) contains the regularly varying class of distributions.

Before formulating and discussing the main result of the paper, we will introduce the related subclasses of heavy-tailed distributions, some notions, and known results. We will say that a distribution F = 1 − F ‾ is on R : = ( − ∞ , ∞ ) if F ‾ ( x ) > 0 for all x ∈ R. All limiting relations are assumed as x → ∞ unless it is stated to the contrary. For two eventually positive functions a ( x ) and b ( x ), a ( x ) ∼ b ( x ) means that lim a ( x ) / b ( x ) = 1; a ( x ) ≍ b ( x ) means that 0 < lim inf a ( x ) / b ( x ) ⩽ lim sup a ( x ) / b ( x ) < ∞. We denote a + : = max { a , 0 }, a − : = − min { a , 0 }.

A distribution F on R is said to be heavy-tailed, denoted F ∈ H, if its Laplace–Stieltjes transform satisfies ∫ − ∞ ∞ e δ x d F ( x ) = ∞ for any δ > 0 . Otherwise, F is said to be light-tailed.

Next we introduce the heavy-tailed distribution subclasses which will be used in the paper.

A distribution F on R is said to be regularly varying with index α ⩾ 0 and denoted F ∈ R ( α ) if its tail satisfies lim F ‾ ( x y ) F ‾ ( x ) = y − α for any y > 0 . F ∈ R ( 0 ) is said to be slowly varying distribution.

A distribution F on R is said to be consistently varying, denoted by F ∈ C, if lim y ↘ 1 lim inf x → ∞ F ‾ ( x y ) F ‾ ( x ) = 1 .

A distribution F on R is said to belong to dominatedly varying class of distributions, denoted F ∈ D, if lim sup F ‾ ( x y ) F ‾ ( x ) < ∞ for all (or, equivalently, for some) y ∈ ( 0 , 1 ).

It holds that C ⊂ D ⊂ H.

Next, for a distribution F on R denote F ‾ ∗ ( y ) : = lim inf x → ∞ F ‾ ( x y ) F ‾ ( x ) , F ‾ ∗ ( y ) : = lim sup x → ∞ F ‾ ( x y ) F ‾ ( x ) , y > 1 , and introduce the upper and lower Matuszewska indices by equalities J F + = − lim y → ∞ log F ‾ ∗ ( y ) log y , J F − = − lim y → ∞ log F ‾ ∗ ( y ) log y . Clearly, 0 ⩽ J F − ⩽ J F + ⩽ ∞. It is well known that F ∈ D if and only if J F + < ∞.

Set F + ( x ) : = F ( x ) 1 { x ⩾ 0 } . A distribution F on R is said to be subexponential and denoted F ∈ S if F + ∗ F + ‾ ( x ) ∼ 2 F ‾ ( x ).

Note that F ∈ S implies F ∗ n ‾ ( x ) ∼ n F ‾ ( x ) for all n ⩾ 2 , see, e.g., Foss et al. [9, Corollary 3.20].

A distribution F on R with m F : = ∫ 0 ∞ F ‾ ( u ) d u ∈ ( 0 , ∞ ) belongs to S ∗ (or is strong subexponential) if ∫ 0 x F ‾ ( x − y ) F ‾ ( y ) d y ∼ 2 m F F ‾ ( x ) .

It holds that C ⊂ S ∗ ⊂ S provided the mean is finite.

More details on the mentioned heavy-tailed classes can be found in the recent book [11].

First, we formulate some known results for class C.

Let X , X 1 , X 2 , … be i.i.d. real-valued r.v.s with the common distribution F X ∈ C and let ν be an independent counting r.v. Let either of conditions hold:

E ν p + 1 < ∞ for some p > J F X + , or

E | X | < ∞, F ν ‾ ( x ) = o ( F X ‾ ( x ) ), or

E | X | < ∞, E ν < ∞ and E X < 0.

 Then F S ν ‾ ( x ) ∼ E ν F X ‾ ( x ) .

Proof. In the case of nonnegative r.v.s, part (a) of the proposition can be found in Leipus and Šiaulys [10, Corollary 3]. We provide a short proof for the case of distributions on R. Write F S ν ‾ ( x ) = ∑ n = 1 ∞ F X ∗ n ‾ ( x ) P ( ν = n ) , x ⩾ 0 . Since C ⊂ S, we have F X ∗ n ‾ ( x ) ∼ n F X ‾ ( x ) for any n ⩾ 1. In addition, as C ⊂ D, according to Theorem 3 in Daley et al. [4], for any p > J F X + , there exists a finite positive constant C, independent of x and n, such that sup x ∈ R F X ∗ n ‾ ( x ) F X ‾ ( x ) ⩽ C n p + 1 . This implies (5) by the dominated convergence theorem. Part (b) can be found in Ng et al. [13, Theorem 2.3] or Denisov et al. [6, Corollary 3]. Part (c) follows from Denisov et al. [6, Theorem 1] and relationship C ⊂ S ∗ (in the case of regularly varying distributions, see Borovkov and Borovkov [2, Theorem 7.1.1]).  □

We will focus our attention to the case where E X = 0 and show that in this case the result in part (b) can be improved replacing o ( · )-condition to O ( · )-condition. Note that, in the case of zero mean and in the more general setup, Olvera-Cravioto [14, Theorem 2.1 (b)] obtained the following result.

Let X , X 1 , X 2 , … be i.i.d. real-valued r.v.s with the common distribution F X ∈ C, and let ν be an independent counting r.v. Assume that J F X − > 0, E | X | r < ∞ for some r > 1, E X = 0 and F ν ‾ ( x ) = O ( F X ‾ ( x ) ). Then (5) holds.

As noted by Olvera-Cravioto [14], the proof of the result follows the standard heavy-tailed techniques from Nagaev [12], Borovkov [1] (see also Borovkov and Borovkov [2]), based on the exponential bounds for sums of truncated r.v.s. Moreover, it was conjectured that the requirement E | X | r < ∞, r > 1 might be weakened with a different proof technique.

In our paper we prove that the result of Proposition 2 indeed holds under the condition E | X | < ∞, accordingly modifying the proof. Specifically, some ideas from Cline and Hsing [3], Tang [16] and Danilenko and Šiaulys [5] have been used in the proof of the main result. Apparently, the alternative proof of the main result can be constructed using the bounds in Theorem 1 of Tang and Yan [18].

 Main results

Let X , X 1 , X 2 , … be i.i.d. r.v.s with the distribution F X ∈ C, and let ν be an independent counting r.v. If E | X | < ∞, E X = 0, J F X − > 0, and F ν ‾ ( x ) = O ( F X ‾ ( x ) ), then (5) holds.

Observe that conditions E | X | < ∞ and F ν ‾ ( x ) = O ( F X ‾ ( x ) ) imply finiteness of the moment E ν < ∞. The statement of the theorem follows from Propositions 3 and 4 below in which the upper and lower asymptotic bounds are obtained.

Note that, in the case of dominatedly varying distribution F X with finite mean, the condition F ν ‾ ( x ) = O ( F X ‾ ( x ) ) (both for μ > 0 and μ ⩽ 0) is sufficient for the relationship F S ν ‾ ( x ) ≍ F X ‾ ( x ) (see, e.g., Leipus and Šiaulys [10], Yang and Gao [19]). Taking into account the closure of class D under weak tail equivalence, this yields that the distribution of random sum S ν is in D.

Let X , X 1 , X 2 , … be i.i.d. r.v.s with the common distribution F X ∈ S, and let ν be an independent counting r.v. with finite mean E ν. Then lim inf F S ν ‾ ( x ) E ν F X ‾ ( x ) ⩾ 1 .

Under the conditions of Theorem 1, lim sup F S ν ‾ ( x ) E ν F X ‾ ( x ) ⩽ 1 .

From the main theorem we obtain the following statement for regularly varying distributions. To the best of our knowledge, this is a new result.

Let X , X 1 , X 2 , … be i.i.d. r.v.s with the distribution F X ∈ R ( α ), α ⩾ 1, and let ν be an independent counting r.v. If E | X | < ∞, E X = 0, and F ν ‾ ( x ) = O ( F X ‾ ( x ) ), then (5) holds.

Remark that if F X ∈ R ( α ), α > 1, then the condition E | X | < ∞ is automatically satisfied.

 Proof of Proposition <xref rid="j_vmsta236_stat_005">3</xref>

For K ∈ N and large x we have F S ν ‾ ( x ) ⩾ P ( S ν > x , ν ⩽ K ) = ∑ n = 1 K F X ∗ n ‾ ( x ) P ( ν = n ) . Since F X ∗ n ‾ ( x ) ∼ n F X ‾ ( x ), we get that lim inf F S ν ‾ ( x ) E ν F X ‾ ( x ) ⩾ 1 E ν ∑ n = 1 K n P ( ν = n ) = E ν 1 { ν ⩽ K } E ν . The assertion of the proposition follows now from the last estimate by passing K to infinity.  □

 Proof of Proposition <xref rid="j_vmsta236_stat_006">4</xref>

Let K ∈ N and δ ∈ ( 0 , 1 ) be temporarily fixed numbers. For sufficiently large x we have F S ν ‾ ( x ) = P ( S ν > x , ν ⩽ K ) + P ( S ν > x , K < ν ⩽ x δ − 1 ) + P ( S ν > x , ν > x δ − 1 ) = ∑ n = 1 K P ( S n > x ) P ( ν = n ) + ∑ K < n ⩽ x δ − 1 P ( S n > x , ∪ k = 1 n { X k > x ( 1 − δ ) } ) P ( ν = n ) + ∑ K < n ⩽ x δ − 1 P ( S n > x , ∩ k = 1 n { X k ≤ x ( 1 − δ ) } ) P ( ν = n ) + P ( S ν > x , ν > x δ − 1 ) ⩽ ∑ n = 1 K F X ∗ n ‾ ( x ) P ( ν = n ) + ∑ K < n ⩽ x δ − 1 n F X ‾ ( x ( 1 − δ ) ) P ( ν = n ) + ∑ K < n ⩽ x δ − 1 P ( ∑ k = 1 n X ˆ k > x ) P ( ν = n ) + F ν ‾ ( x δ − 1 ) = : J 1 + J 2 + J 3 + J 4 , where X ˆ k : = min { X k , x ( 1 − δ ) }.

Since F X ∈ C ⊂ S, it holds that F X ∗ n ‾ ( x ) ∼ n F X ‾ ( x ) for any fixed n. Therefore, J 1 ⩽ ( 1 + δ ) F X ‾ ( x ) E ν 1 { ν ⩽ K } for sufficiently large x ⩾ x 1 ( K , δ ).

In addition, J 2 ⩽ F X ‾ ( x ( 1 − δ ) ) E ν 1 { ν > K } , J 3 ⩽ E ν max n ⩽ x δ − 1 P ( ∑ k = 1 n X ˆ k > x ) n . Using the bound in Lemma 1 (i) for the class D and the condition F ν ‾ ( x ) = O ( F X ‾ ( x ) ), we obtain J 4 = F ν ‾ ( x δ − 1 ) F X ‾ ( x δ − 1 ) F X ‾ ( x δ − 1 ) F X ‾ ( x ) F X ‾ ( x ) ⩽ c 1 F X ‾ ( x δ − 1 ) F X ‾ ( x ) F X ‾ ( x ) ⩽ c 2 δ J F X − / 2 F X ‾ ( x ) for large x ⩾ x 2 ( δ ) with some positive constants c 1 and c 2 .

Substituting estimates (8)–(11) into (7), we obtain F S ν ‾ ( x ) E ν F X ‾ ( x ) ⩽ max { J 1 F X ‾ ( x ) E ν 1 { ν ⩽ K } , J 2 F X ‾ ( x ) E ν 1 { ν > K } } + J 3 F X ‾ ( x ) E ν + J 4 F X ‾ ( x ) E ν ⩽ max { 1 + δ , F X ‾ ( x ( 1 − δ ) ) F X ‾ ( x ) } + max n ⩽ x δ − 1 P ( ∑ k = 1 n X ˆ k > x ) n F X ‾ ( x ) + c 2 E ν δ J F X − / 2 for x ⩾ max { x 1 ( K , δ ) , x 2 ( δ ) }. Therefore, lim sup F S ν ‾ ( x ) E ν F X ‾ ( x ) ⩽ max { 1 + δ , lim sup F X ‾ ( x ( 1 − δ ) ) F X ‾ ( x ) } + lim sup F X ‾ ( x ( 1 − δ ) ) F X ‾ ( x ) lim sup max n ⩽ x δ − 1 P ( ∑ k = 1 n X ˆ k > x ) n F X ‾ ( x ( 1 − δ ) ) + c 2 E ν δ J F X − / 2 = max { 1 + δ , lim sup F X ‾ ( x ( 1 − δ ) ) F X ‾ ( x ) } + c 2 E ν δ J F X − / 2 according to Lemma 2. The desired upper bound is then obtained taking δ ↘ 0.

 Auxiliary lemmas

The first auxiliary lemma can be found in Tang and Tsitsiashvili [17, Lemma 3.5].

Let the distribution F ∈ D with lower and upper Matuszewska indices J F − and J F + , respectively.

If J F − > 0, then for any 0 ⩽ p 1 < J F − there exist positive constants C 1 = C 1 ( p 1 ) and D 1 = D 1 ( p 1 ), such that F ‾ ( y ) F ‾ ( x ) ⩾ C 1 ( x y ) p 1 for all x ⩾ y ⩾ D 1 .

For any p 2 > J F + ⩾ 0 there exist positive constants C 2 = C 2 ( p 2 ) and D 2 = D 2 ( p 2 ), such that F ‾ ( y ) F ‾ ( x ) ⩽ C 2 ( x y ) p 2 for all x ⩾ y ⩾ D 2 .

For any p > J F + it holds that x − p = o ( F ‾ ( x ) ).

The following lemma is crucial in the proof of Proposition 4.

Let X , X 1 , X 2 , … be i.i.d. real-valued r.v.s with the dominatedly varying distribution F X ∈ D. If E | X | < ∞, E X = 0, then, for any δ ∈ ( 0 , 1 ), lim max n ⩽ x δ − 1 P ( ∑ k = 1 n X ˆ k > x ) n F X ‾ ( x ( 1 − δ ) ) = 0 , where X ˆ k : = min { X k , x ( 1 − δ ) }.

Proof. For any δ ∈ ( 0 , 1 ), set a = a ( x , n ) : = max { log 1 n F X ‾ ( x ( 1 − δ ) ) , 1 } , x ∈ R , n ∈ N . The assumption E | X | < ∞ implies that x F X ‾ ( x ( 1 − δ ) ) → 0 as x → ∞. Since a ( x , n ) is nonincreasing in n, we get that for any δ ∈ ( 0 , 1 ) min n ⩽ x δ − 1 a ( x , n ) ⩾ log 1 x δ − 1 F X ‾ ( x ( 1 − δ ) ) → ∞ and a ( x , n ) = log ( 1 / ( n F X ‾ ( x ( 1 − δ ) ) ) ) for large x ( x ⩾ x 3 ( δ )) and n ⩽ x δ − 1 .

By the exponential Markov inequality, for any h , x > 0, we have P ( ∑ k = 1 n X ˆ k > x ) ⩽ e − h x E exp { h ∑ k = 1 n X ˆ k } = e − h x ( 1 + E ( e h X ˆ 1 − 1 ) ) n . Thus, by inequality 1 + z ⩽ e z , z ∈ R, P ( ∑ k = 1 n X ˆ k > x ) n F X ‾ ( x ( 1 − δ ) ) ⩽ exp { − h x + a + n E ( e h X ˆ 1 − 1 ) } . Split the expectation E ( e h X ˆ 1 − 1 ) as follows: E ( e h X ˆ 1 − 1 ) = K 1 + K 2 + K 3 + K 4 , where K 1 : = ∫ ( − ∞ , 0 ] ( e h u − 1 ) d F X ( u ) , K 2 : = ∫ ( 0 , x ( 1 − δ ) a − 2 ] ( e h u − 1 ) d F X ( u ) , K 3 : = ∫ ( x ( 1 − δ ) a − 2 , x ( 1 − δ ) ] ( e h u − 1 ) d F X ( u ) , K 4 : = ( e h x ( 1 − δ ) − 1 ) F X ‾ ( x ( 1 − δ ) ) . The inequalities | e z − 1 | ⩽ | z |, | e z − z − 1 | ⩽ z 2 / 2, z ⩽ 0, imply that K 1 = h E X 1 { X ⩽ 0 } + E ( e h X − h X − 1 ) 1 { X ⩽ 0 } = − h E X − + E ( e h X − 1 ) 1 { X ⩽ − h − 1 / 4 } − h E X 1 { X ⩽ − h − 1 / 4 } + E ( e h X − h X − 1 ) 1 { − h − 1 / 4 < X ⩽ 0 } ⩽ − h E X − + 2 h E | X | 1 { X ⩽ − h − 1 / 4 } + h 3 / 2 2 . The inequality e z − 1 ⩽ z e z , z ⩾ 0, implies that K 2 ⩽ h e h x ( 1 − δ ) a − 2 ∫ ( 0 , x ( 1 − δ ) a − 2 ] u d F X ( u ) ⩽ h e h x ( 1 − δ ) a − 2 E X + . In addition, observe that K 3 , K 4 ⩽ e h x ( 1 − δ ) F X ‾ ( x ( 1 − δ ) a − 2 ) . Substituting estimates (17), (18), (19) into (15)–(16), we get P ( ∑ k = 1 n X ˆ k > x ) n F X ‾ ( x ( 1 − δ ) ) ⩽ exp { 2 n e h x ( 1 − δ ) F X ‾ ( x ( 1 − δ ) a − 2 ) } × exp { − h x + a + n h ( 2 E | X | 1 { X ⩽ − h − 1 / 4 } + h 1 / 2 2 − E X − + e h x ( 1 − δ ) a 2 E X + ) } .

According to Lemma 1 (iii), ( x ( 1 − δ ) ) p F X ‾ ( x ( 1 − δ ) ) → ∞ for any p > J F X + . Hence, for large x ( x ⩾ x 4 ( δ , p ) > x 3 ( δ )), max 1 ⩽ n ⩽ x δ − 1 a ( x , n ) ⩽ log ( x ( 1 − δ ) ) p F X ‾ ( x ( 1 − δ ) ) ( x ( 1 − δ ) ) p ⩽ p log ( x ( 1 − δ ) ) . This relation implies that min 1 ⩽ n ⩽ x δ − 1 x ( 1 − δ ) a − 2 → ∞ and, since F X ∈ D, by Lemma 1 (ii), it holds F X ‾ ( x ( 1 − δ ) a − 2 ) F X ‾ ( x ( 1 − δ ) ) ⩽ c 3 a 2 p for any p > J F X + , large x ( x ⩾ x 5 ( δ , p ) > x 4 ( δ , p ) ) and some positive constant c 3 = c 3 ( δ , p ).

Therefore, by condition E X = E X + − E X − = 0, we get P ( ∑ k = 1 n X ˆ k > x ) n F X ‾ ( x ( 1 − δ ) ) ⩽ exp { 2 c 3 n a 2 p e h x ( 1 − δ ) F X ‾ ( x ( 1 − δ ) ) } × exp { − h x + a + n h ( 2 E | X | 1 { X ⩽ − h − 1 / 4 } + h 1 / 2 2 + ( e h x ( 1 − δ ) a 2 − 1 ) E X + ) } = : P 1 P 2 for h > 0, n ⩽ x δ − 1 and large x ( x ⩾ x 5 ( δ , p )).

Now, for x > 0 set h = h ( x , n ) : = max { a ( x , n ) − 2 p log a ( x , n ) x ( 1 − δ ) , 1 x ( 1 − δ ) } . By (14), for large x ( x ⩾ x 6 ( δ , p ) > x 5 ( δ , p )), h = a − 2 p log a x ( 1 − δ ) . Hence, from (20) we obtain, that for x ⩾ x 6 ( δ , p ) max n ⩽ x δ − 1 h ( x , n ) ⩽ max n ⩽ x δ − 1 a ( x , n ) x ( 1 − δ ) ⩽ p log ( x ( 1 − δ ) ) x ( 1 − δ ) → 0 .

With this choice of h, we obtain that, for large x ( x ⩾ x 6 ( δ , p ) ) and any n ⩽ x δ − 1 , P 1 = exp { 2 c 3 n a 2 p e a − 2 p log a F X ‾ ( x ( 1 − δ ) ) } = exp { 2 c 3 e a n F X ‾ ( x ( 1 − δ ) ) } = e 2 c 3 . For P 2 , we have for large x and n ⩽ x δ − 1 P 2 = exp { − a δ 1 − δ + 2 p log a 1 − δ + n a − 2 p log a x ( 1 − δ ) ( 2 E | X | 1 { X ⩽ − h − 1 / 4 } + h 1 / 2 2 + ( e ( a − 2 p log a ) a − 2 − 1 ) E X + ) } ⩽ exp { − a δ 1 − δ + 2 p log a 1 − δ + a δ ( 1 − δ ) ( 2 E | X | 1 { X ⩽ − h − 1 / 4 } + h 1 / 2 2 + ( e 1 / a − 1 ) E X + ) } . Since, by (14) and (23), min n ⩽ x δ − 1 a ( x , n ) → ∞ and max n ⩽ x δ − 1 h ( x , n ) → 0, for large x ( x ⩾ x 7 ( δ , p ) > x 6 ( δ , p ) ), it holds that max n ⩽ x δ − 1 ( 2 E | X | 1 { X ⩽ − h − 1 / 4 } + h 1 / 2 2 + ( e 1 / a − 1 ) E X + ) ⩽ δ 2 2 . Substituting this bound into (25), we obtain that, for large x, max n ⩽ x δ − 1 P 2 ⩽ max n ⩽ x δ − 1 exp { − a δ 1 − δ + 2 p log a 1 − δ + a δ 2 ( 1 − δ ) } = max n ⩽ x δ − 1 exp { − a δ − 4 p log a 2 ( 1 − δ ) } → 0 . This, together with (22) and (24), implies the statement of the lemma.  □

 References Borovkov, A.A.: Estimates for the distribution of sums and maxima of sums of random variables without the Cramer condition. Sib. Math. J. 41, 811–848 (2000). MR1803562. https://doi.org/10.1007/BF02674739 Borovkov, A.A., Borovkov, K.A.: Asymptotic Analysis of Random Walks: Heavy-Tailed Distributions. Cambridge University Press, Cambridge (2008). MR2424161. https://doi.org/10.1017/CBO9780511721397 Cline, D.B.H., Hsing, T.: Large Deviation Probabilities for Sums and Maxima of Random Variables with Heavy or Subexponential Tails. Preprint, Texas A&M University (1991) Daley, D.J., Omey, E., Vesilo, R.: The tail behaviour of a random sum of subexponential random variables and vectors. Extremes 10, 21–39 (2007). MR2397550. https://doi.org/10.1007/s10687-007-0033-3 Danilenko, S., Šiaulys, J.: Randomly stopped sums of not identically distributed heavy tailed random variables. Stat. Probab. Lett. 113, 84–93 (2016). MR3480399. https://doi.org/10.1016/j.spl.2016.03.001 Denisov, D., Foss, S., Korshunov, D.: Asymptotics of randomly stopped sums in the presence of heavy tails. Bernoulli 16, 971–994 (2010). MR2759165. https://doi.org/10.3150/10-BEJ251 Embrechts, P., Goldie, C.M., Veraverbeke, N.: Subexponentiality and infinite divisibility. Adv. Appl. Probab. 44, 1142–1172 (2012) Faÿ, G., González-Arévalo, B., Mikosch, T., Samorodnitsky, G.: Modeling teletraffic arrivals by a Poisson cluster process. Queueing Syst. 54, 121–140 (2006). MR2268057. https://doi.org/10.1007/s11134-006-9348-z Foss, S., Korshunov, D., Zachary, S.: An Introduction to Heavy-Tailed and Subexponential Distributions. Springer, New York (2013). MR2810144. https://doi.org/10.1007/978-1-4419-9473-8 Leipus, R., Šiaulys, J.: Closure of some heavy-tailed distribution classes under random convolution. Lith. Math. J. 52, 249–258 (2012). MR3020941. https://doi.org/10.1007/s10986-012-9171-7 Leipus, R., Šiaulys, J., Konstantinides, D.: Closure Properties for Heavy-Tailed and Related Distributions. Springer, Cham (2023). MR4660026. https://doi.org/10.1007/978-3-031-34553-1 Nagaev, S.V.: On the asymptotic behavior of one-sided large deviation probabilities. Theory Probab. Appl. 26, 362–366 (1982). MR0616627 Ng, K.W., Tang, Q.H., Yang, H.: Maxima of sums of heavy-tailed random variables. ASTIN Bull. 32, 43–55 (2002). MR1928012. https://doi.org/10.2143/AST.32.1.1013 Olvera-Cravioto, M.: Asymptotics for weighted random sums. Adv. Appl. Probab. 44, 1142–1172 (2012). MR3052852 Stam, A.J.: Regular variation of the tail of a subordinated probability distribution. Adv. Appl. Probab. 5, 287–307 (1973). MR0339353. https://doi.org/10.2307/1426038 Tang, Q.: Insensitivity to negative dependence of the asymptotic behavior of precise large deviations. Electron. J. Probab. 11, 107–120 (2006). MR2217811. https://doi.org/10.1214/EJP.v11-304 Tang, Q., Tsitsiashvili, G.: Precise estimates for the ruin probability in finite horizon in a discrete-time model with heavy-tailed insurance and financial risks. Stoch. Process. Appl. 108, 299–325 (2003). MR2019056. https://doi.org/10.1016/j.spa.2003.07.001 Tang, Q., Yan, J.: A sharp inequality for the tail probabilities of sums of i.i.d. r.v.’s with dominatedly varying tails. Sci. China Ser. A 45, 1006–1011 (2002). MR1942914. https://doi.org/10.1007/BF02879983 Yang, Y., Gao, Q.: On closure properties of heavy-tailed distributions for random sums. Lith. Math. J. 54, 366–377 (2014). MR3240977. https://doi.org/10.1007/s10986-014-9249-5