A note on a deterministic property to obtain the long run behavior of the range of a stochastic process
Abstract
A Brownian motion with drift is simply a process of the form where is a standard Brownian motion and 333The case is deducible by remarking . In [13], the authors considered the drifted Brownian motion and studied the statistics of some related sequences defined by certain stopping times. In particular, they provided the law of the range of as well as its first range process . In particular, they investigated the asymptotic comportment of and . They proved that if is a Brownian motion with a positive drift then its range is asymptotically equivalent to . In other words
(1) |
In this paper, we show that (1) follows from a striking deterministic property. More precisely, we show that the long run behavior of the range of a deterministic continuous function is obtainable straightaway from that of the function itself. Our result can be deemed as the continuous version of a similar one appeared in [1].
1 Introduction
The range of a real valued process is defined to be the "measure" (in a certain sense) of the set of values generated by this process up to time . We shall denote the range of the process by . When is discrete, i.e , simplifies to the number of explored sites up to time by the process , i.e . The range of discrete processes (random walks, Markov chains etc…) has been investigated in several seminal works [4, 5, 2, 15, 16]. In particular, we cite Kesten-Spitzer-Whitman theorem [12] which says that the average of the range of a nearest neighbor simple random walk (referred to as its speed in [1]) converges to the probability of never returning to the origin (the starting point more generally). That is, let be a sequence of i.i.d Redmacher random variables of parameter and set . Then
(2) |
Note that is simply . In [1], the authors showed that (2) is a deterministic property, and no requirement to involve randomness to get it. In fact they showed the following result.
Theorem 1.
[1] if is any deterministic sequence mimicking a nearest neighbor random walk, i.e for all , then if
then
Theorem (1) shows that the asymptotic behavior of the range of any nearest neighbor random walk follows immediately from the asymptotic behavior of the random walk itself. This deterministic result covers also the case of random walks in random environments [11]. An immediate consequence of theorem (1) is that if is a random walk for which the Birkoff ergodic theorem [10] applies then
(3) |
In continuous time, the range of a process is defined similarly. It is the Lebesgue measure of the interval . In other words
(4) |
One should notice that the path of is non-decreasing. Thus, we can define its right continuous inverse
Note that and share the same monotonicity. In addition, the following two relations encodes the duality in between them:
-
•
-
•
A typical process to study its range in continuous time is obviously the Brownian motion as well as its derivatives [13, 6, 14]. The density of the range of a standard Brownian motion is computed in [4] for a fixed time while the Laplace transform of is given in [6, 14]. In [13], the authors considered the case of a positive drifted Brownian motion where . In section they provided the distribution functions of and . In addition, they proved two limit theorems for that can be seen as a law of large numbers and a central limit theorem. What matters for us in this work is their result about the long run behavior of the range. They showed that the range of is asymptotically equivalent to (a.e), or equivalently
However, their proof is quite technical and it is based on the study of the right continuous inverse process , combined with the use of the subadditive ergodic theorem. Their approach will be discussed in the sequel. What we have discovered is that the comportment of the range of at infinity does not require that whole machinery to obtain. In fact, it is a deterministic property that follows directly from the behavior of the underlying process. More generally, we show that the long run behavior of the range of a function is deducible from the long run behavior of the function itself. To this end, recall that the range of is defined exactly as in (4), i.e
When is continuous then its range path is also continuous. Moreover, when s monotonic then its range increases over the time. Finally note that
(5) |
2 Results and applications
Now, we are ready to state the main result of the paper which is inspired from the work in [1] but has more consequences.
Theorem 2.
Let be two functions such that is positively increasing to infinity. If
(6) |
then
Proof.
Without loss of generality we may assume is positive thanks to (5). Let . The assumption (6) yields
(7) |
for greater than some positive . As is positive then . On the other hand, we have
(8) |
since for . By combining (7) and (8) we get
Since will vanish at infinity, we can find such that
for all greater than which completes the proof by taking into account the case . ∎
Note that theorem (2) covers also the case when is infinite. This is done by a minor change in the previous proof. Using the same assumptions and notations of theorem (2), the case when is zero is similar and it is the subject of the next theorem.
Theorem 3.
If
(9) |
then
Proof.
The long run behavior of the the range of the drifted Brownian motion follows easily by looking at the behavior of itself followed by applying theorems (2) and (3).
Corollary 4.
If is a Brownian motion with a drift (possibly ) then
Proof.
In particular we obtain the behavior of the range of
which is not covered in [13]. The reason we think is because the authors derived the limit (12) by proving fist the following limit of
which itself requires computations in terms of (valid only when ). Then they deduced the asymptotic behavior of the range leaning on the fact that is the right continuous process of . Now by theorems (2) and (3), the asymptotic comportment of the range of are obtained independently of and follows exclusively from the behavior of the underlying process .
Now we show that the behavior of is obtainable from that of and vice versa. The main tool to do so is the following result relating the asymptotic behaviors of a non decreasing function and its generalized inverse. For a survey about generalized inverses, we refer the reader to [3].
Proposition 5.
Let be a non decreasing function and let be its generalized inverse, i.e
(13) |
If
then
Proof.
The statement is straightforward when is continuously increasing since in such a case . Otherwise fix a positive (less than if ) and let be a large number so that
for . It is not hard to see that for , the curve of is squeezed between and 444Jumps (resp. flat parts) of becomes flat parts (resp. jumps) for . In other words
if | (14) | ||||
if |
for larger than . The result follows by considering the reciprocals in (14). ∎
Remark 6.
Another common definition of the generalized inverse is . proposition (5) is still valid if we use since a.e 555It is because the set of discontinuity of a non decreasing function is countable. The only difference is that the formula (13) generates a right continuous function while generates a left continuous one. A very known usage of the left continuous inverse is when represents the cumulative distribution function of some distribution In such a case, is used to simulate a random variable of the same law . More precisely
That is, the uniform distribution over is mapped to a random variable of distribution . Note also that proposition (5) works in both directions since a.e. In particular, could be infinite.
A straightforward consequence of proposition (5) is the equivalence between the comportment of and . This appeared only as implication in [13].
Proposition 7.
We have
In particular
The following diagram illustrates the difference between our approach and that in [13].
Another application of proposition (5) is the recovery of the limit theorem for renewal processes (We refer the reader to [8] for more details). That is, let be a renewal counting process associated to some renewal sequence defined by
(15) |
Note that the RHS of (15) is simply . The process is the generalized inverse of the renewal sequence (the right continuous one). More precisely, is obtainable from by
That is, we recover the following equivalence
valid even in the case when the sequence of inter-arrivals is ergodic. Both theorems (2) and (3) can be seen as the continuous version of the main result stated in [1]. However, the discrete version can follow easily from the continuous case. That is, let be a sequence of integers mimicking a simple walk on and let be the range of , i.e the number of explored sites up to time by . Let be the function obtained from by connecting the dots. It is clear that
Hence, in case of existence of limits, we obtain
A typical process derived from Brownian motion is the so called Bessel process. Bessel processes are important as they interfere in financial modeling of stock market prices etc. A -dimensional Bessel process, denoted by , is defined by
where is the Euclidean norm and is a -dimensional Brownian motion 666People often add the starting point as a subscript.. Another alternative definition of Bessel processes uses SDE theory. More precisely, a Bessel process is the solution of the following SDE
We refer the reader to [7] for more details about the subject. The determination of the statistic of the range of a Bessel process is not an easy task, not to mention its long run behavior. Now, theorems (2) and (3) allows us to obtain the asymptotic behavior of such a range by knowing only the behavior of the process itself. However, we provide a result that covers more than the case of Bessel processes.
Proposition 8.
Let be an -dimensional Brownian motion and let . Then
where is the norm 777 It is not a true norm when . We use the word by abuse of of terminology. of , i.e
Proof.
Let . The law of large number implies that
for . It follows that
For we have
Therefore, in both cases
∎
Corollary 9.
The range of a Bessel process is negligible against the time.
The following result illustrates the relation between a deterministic function and its underlying supremum.
Proposition 10.
Let be two functions such that is positively increasing to infinity and let . If
(16) |
then
Proof.
From the assumption, we know for every there exists a large enough such that, when
(17) |
Also,
(18) |
for . On the other hand, we have
(19) |
Letting go to infinity, will converge to as diverges to . will converge to . Therefore,
(20) |
The inequality (19) holds for any . Thus,
(21) |
∎
Corollary 11.
In other words, the four functions have the same long run behavior under the assumptions of proposition (10). Note that proposition (10) is still valid when provided that becomes eventually positive after certain time. The following result is a consequence of proposition (10). It concerns the underlying supremum process of a drifted Brownian motion.
Proposition 12.
Let . Then
and
A corollary of proposition (12) is that the supremum of a Brownian motion, as well as its range are negligible against the time evolution. However, it would be interesting to derive estimates for the range like the law of iterated logarithm for Brownian motion, and on top of that investigate whether such potential properties are deterministic or not.
Acknowledgments
The authors would like to thank Greg Markowsky for helpful communications.
References
- [1] M. Boudabra and G. Markowsky. Remarks on the speeds of a class of random walks on the integers. Discrete Mathematics, 344(8):112436, 2021.
- [2] K. S. Chong, R. Cowan, and L. Holst. The ruin problem and cover times of asymmetric random walks and brownian motions. Advances in Applied Probability, 32(1):177–192, 2000.
- [3] A. de La Fortelle. A study on generalized inverses and increasing functions part i: generalized inverses. 2015.
- [4] W. Feller. The asymptotic distribution of the range of sums of independent random variables. The annals of mathematical statistics, pages 427–432, 1951.
- [5] P. W. Glynn. On the range of a regenerative sequence. Stochastic Processes and Their Applications, 20(1):105–113, 1985.
- [6] J. P. Imhof. On the range of brownian motion and its inverse process. The Annals of Probability, 13(3):1011–1017, 1985.
- [7] G. F. Lawler. Notes on the bessel process. Lecture notes. Available on the webpage of the author, pages 523–531, 2018.
- [8] K. V. Mitov and E. Omey. Renewal processes. In Renewal Processes, pages 1–51. Springer, 2014.
- [9] P. Mörters and Y. Peres. Brownian Motion, volume 30. Cambridge University Press, 2010.
- [10] A. N Shiryaev. Probability-1, volume 95. Springer, 2016.
- [11] F. Solomon. Random walks in a random environment. The Annals of Probability, 3(1):1–31, 1975.
- [12] F. Spitzer. Principles of random walk, volume 34. Springer Science & Business Media, 2001.
- [13] E. Tanré and P. Vallois. Range of brownian motion with drift. Journal of Theoretical Probability, 19(1):45–69, 2006.
- [14] P. Vallois. Decomposing the brownian path via the range process. Stochastic Processes and Their Applications, 55(2):211–226, 1995.
- [15] P. Vallois. The range of a simple random walk on . Advances in Applied Probability, 28(4):1014–1033, 1996.
- [16] P. Vallois and Charles S Tapiero. Range reliability in random walks. Mathematical Methods of Operations Research, 45:325–345, 1997.