A functional limit theorem for general shot noise processes
Alexander Iksanov, Bohdan Rashytov

TL;DR
This paper establishes a general functional limit theorem for shot noise processes with arbitrary shot counting, showing convergence to different Gaussian processes depending on the limit of the counting process, and explores the regularity of these limits.
Contribution
It extends existing limit theorems to more general shot noise processes with arbitrary counting, identifying new limit processes and normalization methods.
Findings
Limit processes include Riemann-Liouville processes when the counting process converges to Brownian motion.
The results apply to five specific counting processes.
The paper investigates the Hölder continuity of the limit processes.
Abstract
By a general shot noise process we mean a shot noise process in which the counting process of shots is arbitrary locally finite. Assuming that the counting process of shots satisfies a functional limit theorem in the Skorokhod space with a locally H\"{o}lder continuous Gaussian limit process and that the response function is regularly varying at infinity we prove that the corresponding general shot noise process satisfies a similar functional limit theorem with a different limit process and different normalization and centering functions. For instance, if the limit process for the counting process of shots is a Brownian motion, then the limit process for the general shot noise process is a Riemann-Liouville process. We specialize our result for five particular counting processes. Also, we investigate H\"{o}lder continuity of the limit processes for general shot noise processes.
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 functional limit theorem for general shot noise processes
Alexander Iksanov 111Faculty of Computer Science and Cybernetics, Taras Shevchenko National University of Kyiv, 01601 Kyiv, Ukraine; e-mail: [email protected] and Bohdan Rashytov 222Faculty of Computer Science and Cybernetics, Taras Shevchenko National University of Kyiv, 01601 Kyiv, Ukraine; e-mail: [email protected]
Abstract
By a general shot noise process we mean a shot noise process in which the counting process of shots is arbitrary locally finite. Assuming that the counting process of shots satisfies a functional limit theorem in the Skorokhod space with a locally Hölder continuous Gaussian limit process and that the response function is regularly varying at infinity we prove that the corresponding general shot noise process satisfies a similar functional limit theorem with a different limit process and different normalization and centering functions. For instance, if the limit process for the counting process of shots is a Brownian motion, then the limit process for the general shot noise process is a Riemann-Liouville process. We specialize our result for five particular counting processes. Also, we investigate Hölder continuity of the limit processes for general shot noise processes.
Keywords: Hölder continuity; shot noise process; weak convergence in the Skorokhod space
2000 Mathematics Subject Classification: Primary: 60F17
2000 Mathematics Subject Classification: Secondary: 60G55
1 Introduction and main result
Let be a not necessarily monotone sequence of positive random variables. Define the counting process by
[TABLE]
where if the event holds and , otherwise. Throughout the paper we always assume that almost surely (a.s.) for .
Denote by the Skorokhod space of right-continuous real-valued functions which are defined on and have finite limits from the left at each positive point. For a function , the random process which is the main object of our investigation is given by
[TABLE]
We call general shot noise process, for no assumptions are imposed apart from a.s. Plainly, a.s.
Denote by , independent and identically distributed (i.i.d.) random processes with paths in . Assume that, for , is independent of . In particular, the case of complete independence of and is not excluded. Set
[TABLE]
and call random process with immigration at random times. The interpretation is that associated with the th immigrant arriving at the system at time is the process which defines a model-dependent ‘characteristic’ of the th immigrant. For instance, may be the fitness of the th immigrant at time . The value of is then given by the sum of ‘characteristics’ of all immigrants arriving at the system up to and including time . Assume that the function is finite for all , not identically [math] and that . To investigate weak convergence of the process , properly normalized and centered, it is natural to use decomposition
[TABLE]
For fixed , while the first summand is the terminal value of a martingale, the second is the value at time of a general shot noise process. The summands should be treated separately, for each of these requires a specific approach. Weak convergence of the first summand in (1) will be investigated in [11].
In the present paper we are aimed at proving a functional limit theorem for a general shot noise process under natural assumptions. Besides being of independent interest our findings pave the way towards controlling the asymptotic behavior of the second summand in (1). These taken together with prospective results from [11] should eventually lead to understanding of the asymptotics of processes .
A rich source of random processes with immigration at random times are queueing systems and various branching processes with or without immigration. For example, particular instances of random variables are given by the number of the th generation individuals () with positions in a branching random walk; the number of customers served up to and including time or the number of busy servers at time in a queuing system, where GEN means that the arrival of customers is regulated by a general point process. Nowadays rather popular objects of research are queueing systems in which an input process is more complicated than the renewal process, for instance, a Cox process (also known as a doubly stochastic Poisson process) [8] or a Hawkes process [10, 28] and branching processes with immigration governed by a process which is more general than the renewal process, for instance, an inhomogeneous Poisson process [34] or a Cox process [7]. Note that some authors investigated the processes , or the like from purely mathematical viewpoint. An incomplete list of relevant publications includes the works [9, 30, 31, 32] and the recent article [29]. On the other hand, we stress that the results obtained in the aforementioned papers do not overlap with ours.
The present work was preceded by several articles [16, 19, 20, 21, 27] in which weak convergence of renewal shot noise processes has been investigated. The latter processes is a particular case of processes in which the input sequence is a standard random walk. Development of elements of the weak convergence theory for renewal shot noise processes was motivated by and effectively used for the asymptotic analysis of various characteristics of several random regenerative structures: the order of random permutations [12], the number of zero and nonzero blocks of weak random compositions [2, 24], the number of collisions in coalescents with multiple collisions [13], the number of busy servers in a queuing system [18], random process with immigration at the epochs of a renewal process [22, 23]. Chapter 3 of the monograph [17] provides a survey of results obtained in the aforementioned articles, pointers to relevant literature and a detailed discussion of possible applications.
To formulate our main result we need additional notation. Denote by a centered Gaussian process which is a.s. locally Hölder continuous with exponent and satisfies a.s. In particular, for all , all and some a.s. finite random variable
[TABLE]
Define the random process by
[TABLE]
when and by
[TABLE]
when . Also, put . Using (2) we conclude that a.s. whenever .
Convergence of the integrals in (3) and (4) and a.s. continuity of the processes will be proved in Lemma 2.1 below. When is a Brownian motion (so that for any ), the process can be represented as a Skorokhod integral
[TABLE]
The so defined process is called Riemann–Liouville process or fractionally integrated Brownian motion with exponent for . Since these processes appear for several times in our presentation we reserve a special notation for them, . When is a more general Gaussian process satisfying the standing assumptions, the process may be called fractionally integrated Gaussian process. Note that, for positive integer , the process is up to a multiplicative constant an -times integrated process . This can be easily checked with the help of integration by parts.
Throughout the paper we assume that the spaces and are endowed with the -topology and denote weak convergence in these spaces by and , respectively. Comprehensive information concerning the -topology can be found in the books [4, 26]. In what follows we use the notation .
Theorem 1.1**.**
Let be an eventually nondecreasing function of bounded variation which is regularly varying333This means that for all . at of index . Assume that when and that
[TABLE]
where is regularly varying at of positive index, and is a nondecreasing function. Then
[TABLE]
Remark 1.2**.**
A perusal of the proof given below reveals that the assumption when is not needed if is nondecreasing on rather than eventually nondecreasing.
Since is nondecreasing and is locally bounded and almost everywhere continuous function (in view of ), the integral exists as a Riemann-Stieltjes integral.
The remainder of the article is organized as follows. In Section 2 we investigate local Hölder continuity of the limit processes in Theorem 1.1. In Section 3 we give five specializations of Theorem 1.1 for particular sequences . Finally, we prove Theorem 1.1 in Section 4.
2 Hölder continuity of the limit processes
For the subsequent presentation, it is convenient to define the process on the whole line. To this end, put for . The right-hand side of (4) can then be given in an equivalent form
[TABLE]
It is important for us that formula (2) still holds true for negative . More precisely, we claim that, for all , all and the same random variable as in (2),
[TABLE]
This inequality is trivially satisfied in the case and follows from (2) in the case . Assume now that . Then . Here, the first inequality is a consequence of (2) with .
Lemma 2.1**.**
*Let . The following assertions hold:
a.s. for each fixed ;
- the process is a.s. locally Hölder continuous with exponent if and with arbitrary positive exponent less than if ; more precisely, in the latter situation we have, for any ,*
[TABLE]
Proof.
The case is trivial. Fix .
Proof of 1). Using (2) we obtain, for all ,
[TABLE]
in the case and
[TABLE]
in the case .
Proof of 2). By virtue of symmetry it is enough to investigate the case , and this is tacitly assumed throughout the proof.
Assume first that . Appealing to (8) and (2) we conclude that, for ,
[TABLE]
We already know from the proof of part 1) that a similar inequality holds when . Thus, the claim of part 2) has been proved in the case .
Assume now that . We infer with the help of (2) that
[TABLE]
where the last inequality follows from the mean value theorem for differentiable functions.
It remains to investigate the case . We shall use the following decomposition
[TABLE]
where
[TABLE]
[TABLE]
The summand can be estimated as follows
[TABLE]
Using the inequality for gives
[TABLE]
in the case and
[TABLE]
in the case . Also,
[TABLE]
in the case .
Further,
[TABLE]
In the case the inequality has to be additionally used.
Finally,
[TABLE]
The right-hand side does not exceed in the case in view of subadditivity of on and in the case .
The proof of Lemma 2.1 is complete. ∎
3 Applications of Theorem 1.1
In this section we give five examples of particular sequences which satisfy limit relation (6) with four different Gaussian processes . Throughout the section we always assume, without further notice, that satisfies the assumptions of Theorem 1.1.
In the case where the sequence is a.s. nondecreasing, the counting process is nothing else but a generalized inverse function for , that is,
[TABLE]
In view of this, if a functional limit theorem for in the -topology on holds, and the limit process is a.s. continuous, then the corresponding functional limit theorem for in the -topology on is a simple consequence. A detailed discussion of this fact can be found, for instance, in [15]. If the sequence is not monotone (as, for instance, at point 2 below), then equality (9) is no longer true, and the proof of a functional limit theorem for requires an additional specific argument in every particular case.
- Delayed standard random walk. Let , be i.i.d. nonnegative random variables which are independent of a random variable . The possibility that a.s. is not excluded. The random sequence defined by for is called delayed standard random walk. In the case a.s. the term zero-delayed standard random walk is used. Denote by the counting process for a zero-delayed standard random walk. It is well-known (see, for instance, Theorem 1b(i) in [5]) that
a) if , then
[TABLE]
where , and is a standard Brownian motion (so that relation (6) holds with and );
b) if
[TABLE]
for some slowly varying at , then
[TABLE]
where is a positive measurable function satisfying (so that relation (6) holds with and ; since is asymptotically inverse for , an application of Proposition 1.5.15 in [6] enables us to conclude that , hence also are regularly varying at of index ).
The counting process for a delayed standard random walk satisfies the same functional limit theorems which follows from the limit relation: for all
[TABLE]
where, depending on the case, either or , and is the counting process for the corresponding zero-delayed standard random walk (of course, for ). The last centered formula is a consequence of the equality , , the relation obtained in Lemma A.1 of [16]
[TABLE]
which holds for any positive and , and the fact that is independent of . Thus, according to Theorem 1.1, we have both for delayed and zero-delayed standard random walks
[TABLE]
provided that (in the case , the limit process is ), and
[TABLE]
provided that conditions (11) hold. In particular, irrespective of whether the variance is finite or not the limit process is a fractionally integrated Brownian motion with parameter . As far as zero-delayed standard random walks are concerned, the aforementioned results can be found in Theorem 1.1 (A1, A2) of [16].
- Perturbed random walks. Let , be i.i.d. random vectors with nonnegative coordinates. Put
[TABLE]
The so defined sequence is called perturbed random walk. Various properties of perturbed random walks are discussed in the monograph [17].
Assume that and for some . Put for . According to Theorem 3.2 in [2],
[TABLE]
where . Therefore, by Theorem 1.1,
[TABLE]
- Random walks with long memory. Let , be i.i.d. positive random variables with finite mean. Assume that these are independent of random variables , which form a centered stationary Gaussian sequence with as for some . Put and
[TABLE]
Recall that a fractional Brownian motion with Hurst index is a centered Gaussian process with covariance for . This process has stationary increments and is self-similar of index . Therefore, for any ,
[TABLE]
According to the Kolmogorov-Chentsov sufficient conditions, there exists a version of (which we also denote by ) which is a.s. Hölder continuous with exponent smaller than for any , hence also, smaller than .
According to Example 4.25 on p. 357 in [3],
[TABLE]
where and . An application of Theorem 1.1 yields
[TABLE]
if . If , the limit process is .
- Counting process in a branching random walk. Assume that the random variables defined at point 1 are a.s. positive. Denote by the corresponding renewal process. For some integer , we take in the role of the number of the th generation individuals with positions in a branching random walk in which the first generation individuals are located at the points , (a more precise definition can be found in Section 1.2 of [25]).
Assume that . Theorem 1.3 in [25] implies that
[TABLE]
where . Of course, for this limit relation is also valid and amounts to (10) as it must be. By Lemma 2.1, the process is a.s. locally Hölder continuous with any positive exponent smaller than . Thus, Theorem 1.1 applies and gives
[TABLE]
where is the beta function. The latter equality can be checked as follows: for
[TABLE]
- Inhomogeneous Poisson process. Let be an inhomogeneous Poisson process with for a nondecreasing function satisfying
[TABLE]
where . Without loss of generality we can identify with the process , where is a homogeneous Poisson process with , . According to (10),
[TABLE]
Dini’s theorem in combination with (13) ensures that
[TABLE]
for all . It is known (see, for instance, Lemma 2.3 on p. 159 in [14]) that the composition mapping is continuous on continuous functions and continuous nondecreasing functions . Using this fact in conjunction with (14), (15) and continuous mapping theorem we infer
[TABLE]
Thus, the limit process is a time-changed Brownian motion. An application of Theorem 1.1 yields
[TABLE]
if . If , the limit process is .
4 Proof of Theorem 1.1
To prove weak convergence of finite-dimensional distributions we need an auxiliary lemma.
Lemma 4.1**.**
Let be a function which is nondecreasing in the second coordinate and satisfies for all and some . For , set
[TABLE]
[TABLE]
Then, for any ,
[TABLE]
Proof.
Fix any . For each , denote by and independent random variables with the distribution functions
[TABLE]
Also, denote by and independent random variables with the distribution functions
[TABLE]
By assumption,
[TABLE]
Define the function on . Using a.s. continuity of , Lebesgue’s dominated convergence theorem and the fact that, according to Theorem 3.2 on p. 63 in [1], we conclude that is continuous, hence also bounded on for all . This entails
[TABLE]
and thereupon
[TABLE]
by Lebesgue’s dominated convergence theorem. Further,
[TABLE]
It remains to note that while in the case we have
[TABLE]
in the case we have
[TABLE]
The proof of Lemma 4.1 is complete. ∎
Proof of Theorem 1.1.
Since is eventually nondecreasing, there exists such that is nondecreasing for . Being a regularly varying function of nonnegative index, is eventually positive. Hence, increasing if needed we can ensure that for . We first show that the behavior of the function of bounded variation on does not affect weak convergence of the general shot noise process. Once this is done, we can assume, without loss of generality, that and that is nondecreasing on .
Integrating by parts yields
[TABLE]
For all ,
[TABLE]
because is regularly varying at . Denote by the total variation of on . By assumption, . For all ,
[TABLE]
as . The convergence to [math] is justified by the facts that, according to (6), the first factor converges in distribution to , whereas the second trivially converges to [math]. Recall that, when , holds by assumption, whereas, when , it holds automatically. Thus, as was claimed, while investigating the asymptotic behavior of the second summand on the right-hand side of (17) we can and do assume that and that is nondecreasing on .
Skorokhod’s representation theorem ensures that there exist versions and of the processes and such that, for all ,
[TABLE]
where for and . For each , set , ,
[TABLE]
and
[TABLE]
The distributions of the processes and are the same. Hence, it remains to check that
[TABLE]
in the -topology on and
[TABLE]
In view of (18) and monotonicity of , we have, for all as ,
[TABLE]
which proves (19).
Since is a Gaussian process, the convergence of the finite-dimensional distributions in (20) which is equivalent to the convergence of covariances follows from Lemma 4.1. While applying the lemma we use the equalities
[TABLE]
when and when . Our next step is to prove tightness on , for all , of
[TABLE]
By Theorem 15.5 in [4], it is enough to show that, for any , there exist such that, for all ,
[TABLE]
Put . Recalling that for (see the beginning of Section 2) we have, for and ,
[TABLE]
for large enough and a positive constant . The existence of is justified by the relation . Decreasing if needed, we ensure that inequality (21) holds for any positive and . The proof of Theorem 1.1 is complete. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. J. Adler, An introduction to continuity, extrema, and related topics for general Gaussian processes . Institute of Mathematical Statistics. 1990.
- 2[2] G. Alsmeyer, A. Iksanov and A. Marynych, Functional limit theorems for the number of occupied boxes in the Bernoulli sieve . Stoch. Proc. Appl. 127 (2017), 995–1017.
- 3[3] J. Beran, Y. Feng, S. Ghosh and R. Kulik, Long-memory processes. Probabilistic properties and statistical methods . Springer, 2013.
- 4[4] P. Billingsley, Convergence of probability measures . Wiley, 1968.
- 5[5] N. H. Bingham, Maxima of sums of random variables and suprema of stable processes . Z.Wahrscheinlichkeitstheor. Verwandte Geb. 26 (1973), 273–296.
- 6[6] N. H. Bingham, C. M. Goldie and J. L. Teugels, Regular variation . Cambridge University Press, 1989.
- 7[7] O. A. Butkovsky, Limit behavior of a critical branching process with immigration . Mathemat. Notes. 92 (2012), 612–618.
- 8[8] E. A. Chernavskaya, Limit theorems for an infinite-server queuing system . Mathemat. Notes. 98 (2015), 653–666.
