A renewal theorem and supremum of a perturbed random walk
Ewa Damek, Bartosz Ko{\l}odziejek

TL;DR
This paper introduces a new renewal theorem to analyze the tail behavior of the supremum of a perturbed random walk, providing novel asymptotic results under weak assumptions.
Contribution
It develops a new renewal theorem and applies it to derive first and second order asymptotics for the tail of the supremum of a perturbed random walk, a regime not previously studied.
Findings
Established first and second order asymptotics for the tail of the supremum
Developed a new renewal theorem of independent interest
Extended analysis to a previously unconsidered regime
Abstract
We study tails of the supremum of a perturbed random walk under regime which was not yet considered in the literature. Our approach is based on a new renewal theorem, which is of independent interest. We obtain first and second order asymptotics of the solution to renewal equation under weak assumptions and we apply these results to obtain first and second order asymptotics of the tail of the supremum of a perturbed random walk.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
A renewal theorem and supremum of a perturbed random walk
Ewa Damek
Institute of Mathematics
Wroclaw University
50-384 Wroclaw
pl. Grunwaldzki 2/4
Poland
and
Bartosz Kołodziejek
Faculty of Mathematics and Information Science
Warsaw University of Technology
Koszykowa 75
00-662 Warsaw, Poland
Abstract.
We study tails of the supremum of a perturbed random walk under regime which was not yet considered in the literature. Our approach is based on a new renewal theorem, which is of independent interest.
We obtain first and second order asymptotics of the solution to renewal equation under weak assumptions and we apply these results to obtain first and second order asymptotics of the tail of the supremum of a perturbed random walk.
Key words and phrases:
perturbed random walk; regular variation; renewal theory
2010 Mathematics Subject Classification:
Primary 60H25; Secondary 60E99
1. Introduction
1.1. Renewal theorems
Almost every renewal quantity may be described as the solution to an integral equation
[TABLE]
where is a probability measure and is a locally bounded function. When functions , and measure are supported on , then is given by
[TABLE]
where , provided . Such equations appear frequently in different problems. In particular, they are closely related to stochastic fixed point equations, [6].
In the general case when and are defined on and has a strictly positive mean, the second equality in (2) does not hold but quite likely, due to properties of and ,
[TABLE]
may become the main term in the asymptotics of as . The classical Key Renewal Theorem (KRT) gives the asymptotics of at infinity when is directly Riemann integrable but in applications one encounters equations (1) where corresponding is not even in and so there is a need of a more general theory.
In this paper we study behavior of the integrals
[TABLE]
where is a slowly varying function with the property that is not integrable on . The asymptotics of (3) does not follow from the classical KRT nor from known relatives (see e.g. [8, Section 6.2.3]), because the latter results are obtained under additional assumption that the integrand function is (ultimately) monotone or is asymptotically equivalent to a monotonic function. In our case, may exhibit infinite oscillations, so in general it is not asymptotically equivalent to a monotonic function. Slow variation of plays here the role of the regularity condition. For , let
[TABLE]
If the integral exists, is again slowly varying as a function of . Under very mild assumptions on , we show that (Theorem 3.1)
[TABLE]
for any , where is the mean of . Here and henceforth, means that as . The proof of Theorem 3.1 is surprisingly simple and although we use particular properties of slowly varying functions, the scheme behind it may be adopted to other situations.
Under some further assumptions we are able to reduce the second quantity in (3) to the first one and to obtain the second order asymptotics (Theorem 3.3). Imposing some more regularity on , we show that
[TABLE]
1.2. Supremum of a perturbed random walk
Consider
[TABLE]
where the sequence is i.i.d. and a.s. The renewal equation (1) arises naturally from the study of the right tail of . When and are positive a.s. then taking the logarithm of both sides of (5), is the supremum of the so-called perturbed random walk (PRW)
[TABLE]
where , . In a more general case considered here it is natural to call a perturbed multiplicative random walk. Random variable , if exists, satisfies the following fixed-point stochastic equation
[TABLE]
converges to zero when tends to infinity and it is a natural question to describe the rate at which it happens. We do it here under specific assumptions and the result clearly applies to . PRW is a natural extension of the random walk with applications to queuing theory, insurance risk as well as to telecommunication networks [8], [14], [15], [16]. Supremum of the process with regenerative increments can be represented as for an appropriate PRW and the size of the largest box in the Bernoulli sieve as , [8]. Therefore, supremum of PRW is a natural object to study. Supremum of PRW, , inherits characteristics related to and to the extreme behavior of the perturbations . Tail behavior of is studied in three main regimes in [14], one of them being the Cramer case which requires existence of some exponential moments of and . Since our framework is a little bit more general, we shall explain it in terms of .
In the Cramer case the tail behavior of may be determined by or alone, or by both of them. The first case happens when the tail of is regularly varying with index , and for some . Then ([1, Theorem 3], [14, Theorem 2])
[TABLE]
On the other hand, if , , and the distribution of given is non-arithmetic, then ([6, Theorem 5.2])
[TABLE]
and it is that plays the main role here.
The Cramer case when both and contribute significantly to the tail has not been considered yet for although it is quite natural to do it, see the example described in Subsection 1.3.
We assume that
[TABLE]
(see Section 4 for the rest of assumptions) and we describe the right tail of (Theorem 4.2). If for , where is a slowly varying function, then
[TABLE]
and so the tail is essentially bigger than that of , since as ; see (10). Appearance of the function is probably the most interesting phenomenon here. To obtain (7) we use a renewal theorems mentioned in the previous section. A somehow related problem was dealt with in [12].
Finally, assuming some more regularity on the distribution of , we obtain the second order asymptotics in (7), that is,
[TABLE]
see Theorem 4.2 (ii). Note that if is asymptotically bounded away from zero, then we have , but such claim is not true if is decreasing to [math] (e.g. ).
We hope that (7) holds in a more general setting:
[TABLE]
where is a random Lipschitz mapping such that for any
[TABLE]
and . But then calculations become much more technical and it is still a work in progress.
1.3. Extremes of perturbed random walk
There is a somehow related problem, where contributions to asymptotics of some statistic may come from one of two ingredients alone or from both of them. Let be a sequence of i.i.d. two-dimensional random vectors with generic copy . Consider the maximum of PRW, , where is a random walk with i.i.d. increments , and , . The aim is to study convergence in distribution of for some suitable chosen deterministic sequence . There are essentially three distinct cases. In the first case , dominates the perturbation and the limit of coincides with the limit of . In the second one, the tail is regularly varying with index , perturbation dominates the random walk and the limit coincides with the limit of . For above see [7, Theorem 3]. In the most interesting, third case, that is, if for some , both random walk and the perturbation have comparable contributions, see [18, 9] along with generalization to functional limit theorems. Further developments have been made recently in [10], where the assumption is dispensed with.
2. Preliminaries
2.1. Regular variation
A measurable function is called regularly varying with index , , if for all ,
[TABLE]
The class of such functions will be denoted . If then is called a slowly varying function. The class of slowly varying functions plays a fundamental part in the Karamata’s theory of regular variability, since if , then for some . Below, we introduce some basic properties of the class that, later on, will be essential.
If is bounded away from [math] and on every compact subset of , then for any there exists such that (Potter’s Theorem, see e.g [5], Appendix B)
[TABLE]
Assume that is locally bounded on for some . Then, for one has
[TABLE]
Define . Then, for any ,
[TABLE]
since the convergence in (8) is locally uniform outside zero [3, Theorem 1.5.2]. Moreover, since
[TABLE]
(10) implies that is slowly varying. In the theory of regular variation, is called the de Haan function.
2.2. Renewal theory
Let be the sequence of independent copies of a random variable with . We write for and . The measure defined by
[TABLE]
is called the renewal measure of . Condition along with imply that is finite for all (see e.g. [11, Theorem 2.1]).
We say that the distribution of is arithmetic if its support is contained in for some and non-arithmetic, otherwise. Equivalently, the distribution of is arithmetic if and only if there exists such that , where is the characteristic function of the distribution of . The law of is strongly non-lattice if the Cramer condition is satisfied, that is, .
A fundamental result of renewal theory is the Blackwell theorem [4]: if the distribution of is non-arithmetic, then for any ,
[TABLE]
Note that in the non-arithmetic case, since is convergent as we have and so
[TABLE]
for some positive , and any .
Under additional assumptions we know more about the asymptotic behavior of (see [17]). If for some one has as , then there exists such that
[TABLE]
Exact asymptotics of as in the presence of such that are given in [13].
Finally, if has finite second moment and for some , as and the distribution of is strongly non-lattice, then for some (see [17])
[TABLE]
3. Renewal Theorems
A function is called directly Riemann integrable on (dRi) if for any ,
[TABLE]
and
[TABLE]
If is locally bounded and a.e. continuous on , then an elementary calculation shows that (15) with implies direct integrability of . If the distribution of is non-arithmetic, for directly Riemann integrable function , we have the following Key Renewal Theorem: (see e.g. [2, Theorem 4.2])
[TABLE]
There are many variants of this theorem, when is not necessarily - see [8, Section 6.2.3]. Such results are usually obtained by additional requirement that is (ultimately) monotone or is asymptotically equivalent to a monotone function.
Here we obtain a renewal result that is essentially stronger: an asymptotic of
[TABLE]
for a slowly varying function , Theorem 3.1. Such a function may exhibit infinite oscillations, so in general it is not asymptotically equivalent to a monotonic function.
Theorem 3.1**.**
Assume that and the law of is non-arithmetic. Let be a slowly varying function, which is locally bounded on . For any such that is finite and as , one has
[TABLE]
Remark 3.2**.**
The assumption that the law of is non-arithmetic is not crucial here. The same result holds if one assumes that the law of is arithmetic and the proof of such result requires only small modifications necessitated by the use of the Blackwell theorem in the arithmetic case.
Under stronger assumptions, particularly assuming that is a monotonic function, we may prove second order asymptotics.
Theorem 3.3**.**
*Assume that , for some , the law of is strongly non-lattice and as for some . Assume further that there is a random variable , a slowly varying function and a constant such that for . Let as . Then *
[TABLE]
Proofs of both renewal theorems are postponed to Section 5. We note only that for any slowly varying function there exist and another slowly varying function such that and is the tail of a probability distribution. In this sense, the assumption of existence in Theorem 3.3 is not very restrictive.
4. Tails of the supremum of perturbed random walk
4.1. Notation and assumptions
Throughout the paper, stands for the natural logarithm. We are going to write for . For any we write and . Our standing assumptions are:
- (A-1)
, the law of given is non-arithmetic,
- (A-2)
there exists such that , ,
- (B-1)
,
- (B-2)
.
Note that under (A-2)
[TABLE]
is strictly positive. Indeed, consider . Since , is convex, we have .
Let us denote defined in (4) by . Note that there is no problem with integrability near as under (B-1) we have .
As an easy consequence of (9) we obtain
Proposition 4.1**.**
*Suppose that *(B-1) is satisfied. Then
[TABLE]
and for any ,
[TABLE]
Under (B-1), condition (B-2) implies that as .
In this chapter the previous results in the renewal theory will be applied to the random variable with the law defined by
[TABLE]
4.2. Tails of perturbed multiplicative random walk
In this section we study the asymptotics of , where is defined in (5). Under (A-2) and (B-1) with , we have and . Since
[TABLE]
has finite moments up to . If one assumes additionally that
[TABLE]
then
[TABLE]
because and . The main theorem of this section is
Theorem 4.2**.**
Assume (A-1)-(A-2) and (B-1)-(B-2).
- (i)
If (18) holds, then
[TABLE]
- (ii)
If for some and additionally the distribution of defined by (17) is strongly non-lattice, then
[TABLE]
Remark 4.3**.**
- (1)
We say that the law is spread-out if there exists such that -th convolution has a non-zero absolutely continuous part. Notice that if the law of is spread-out then the law of is spread-out and so it is strongly non-lattice. If the law of has a non-trivial absolutely continuous component then the same holds for implying that the law of is strongly non-lattice and we have (19). 2. (2)
* through Hölder inequality implies (18).* 3. (3)
By (19), for any , we have
[TABLE]
which means that (see **[3, Chapter 3]**).
Proof.
Let and . Let be a Borel function. If is an i.i.d. sequence with the law (17), then
[TABLE]
where are i.i.d. In particular,
[TABLE]
Then, (c.f. (1))
[TABLE]
Iterating (21) we obtain
[TABLE]
where , . Clearly, if the law of given is non-arithmetic under , then the law of is non-arithmetic as well.
By (20), the random walk has positive drift, thus with probability as . Moreover, since has finite moments up to , by Markov inequality we have for . Thus,
[TABLE]
as and so
[TABLE]
where is the renewal measure of .
In our case is not dRi (it is not even in ), so the Key Renewal Theorem is not applicable. Instead, we consider and define . First we will show that is convergent as to a finite limit. Therefore, will constitute the main part (see Theorems 3.1 and 3.3). Indeed, and
[TABLE]
where . Using Fubini’s theorem and changing the variable , we obtain
[TABLE]
By (12), we may take the limit as inside the integral. Thus, by the Blackwell Theorem we get
[TABLE]
For the main part, we have
[TABLE]
Let us concentrate now on the first order asymptotics, point (i). We will show that
[TABLE]
and
[TABLE]
Observe that for any and consider the limit
[TABLE]
For any , the integrand is bounded by for some by Potter bounds. Combining this with (13) and Lebesgue’s Dominated Convergence Theorem we conclude that
[TABLE]
[Asymptotics of which is more precise than (13) is available here (see [13]): as .]
Further, since , we have
[TABLE]
again by the Lebesgue Dominated Convergence Theorem.
The first part of the assertion will follow from Theorem 3.1. Indeed, we already know that the expectation of is strictly positive and finite. Moreover, the law of is non-arithmetic. Thus,
[TABLE]
For the purpose of second order asymptotics (ii), we additionally assume that is finite and that the law of is strongly non-lattice. Observe that and thus, the assumptions of Theorem 3.3 are satisfied. Thus,
[TABLE]
So far we have shown that
[TABLE]
where
[TABLE]
is the error term coming from the integral of . However, may be decreasing to [math] (e.g. ) and we want to be more precise here. We will show that for some ,
[TABLE]
and in such case we may drop in (24).
Note that implies for . Indeed, we have
[TABLE]
where and . The right hand side is finite for with . Analogously we show that . We write (recall that )
[TABLE]
We have
[TABLE]
Moreover, under our setup we know that for one has as and thus for some and and all . Then
[TABLE]
and the conclusion follows.
∎
5. Proofs
Proof of Theorem 3.1.
Using the definition of a slowly varying function, it is easy to see that the integral over is as . Indeed, for ,
[TABLE]
since the convergence in (8) is locally uniform outside zero ([3, Theorem 1.5.2]). Moreover, the integral over is as . Indeed, by the local boundedness of we have
[TABLE]
and, by the Blackwell theorem, the right hand side above converges. Thus, it is enough to concentrate on the integral over . Let us fix and and observe that
[TABLE]
Further, by Potter bounds ([3, Theorem 1.5.6 (i)]), if , for any and sufficiently large and we have
[TABLE]
and similarly for the lower bound. Moreover, let be such that for any ,
[TABLE]
Altogether, above considerations yield
[TABLE]
for any , and sufficiently large . This gives us that
[TABLE]
and the assertion follows. ∎
Proof of Theorem 3.3.
We have
[TABLE]
We already know that the first term is asymptotically equivalent to (see (23)).
The second term equals and the integral is convergent, thus it is of the same order as the first one.
The main contribution comes from the third term, which is equal to
[TABLE]
where . Since , we have
[TABLE]
and after integrating by parts and changing the variable ,
[TABLE]
It remains to show that .
Since , we get that . Moreover, by assumption, the distribution of is strongly non-lattice. Thus, by (14), there exists such that as , where . This implies that for all and some finite .
We have
[TABLE]
by Proposition 4.1. ∎
Acknowledgements
The authors are thankful to anonymous referee for simplifying the proof of Theorem 3.1. Remark 3.2 was proposed by a referee. Ewa Damek was partially supported by the NCN Grant UMO-2014/15/B/ST1/00060. Bartosz Kołodziejek was partially supported by the NCN Grant UMO-2015/19/D/ST1/03107.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] V. F. Araman and P. W. Glynn. Tail asymptotics for the maximum of perturbed random walk. Ann. Appl. Probab. , 16(3):1411–1431, 2006.
- 2[2] K. B. Athreya, D. Mc Donald and P. Ney. Limit theorems for semi-Markov processes and renewal theory for Markov chains. Ann. Probab. , 6(5):788–797, 1978.
- 3[3] N. H. Bingham, C. M. Goldie, and J. L. Teugels. Regular variation , volume 27 of Encyclopedia of Mathematics and its Applications . Cambridge University Press, Cambridge, 1989.
- 4[4] D. Blackwell. Extension of a renewal theorem. Pacific J. Math. , 3:315–320, 1953.
- 5[5] D. Buraczewski, E. Damek, and T. Mikosch. Stochastic Models with Power-Law Tails. The Equation X = A X + B 𝑋 𝐴 𝑋 𝐵 X=AX+B . Springer Series in Operations Research and Financial Engineering. Springer International Publishing, Switzerland, 2016.
- 6[6] C. M. Goldie. Implicit renewal theory and tails of solutions of random equations. Ann. Appl. Probab. , 1(1):126–166, 1991.
- 7[7] P. Hitczenko and J. Wesołowski. Renorming divergent perpetuities. Bernoulli , 17(3):880–894, 2011.
- 8[8] A. Iksanov. Renewal theory for perturbed random walks and similar processes. Probability and its Applications. Birkhäuser/Springer, Cham, 2017.
