Chover-Type Laws of the Iterated Logarithm for Continuous Time Random Walks
Abstract
A continuous time random walk is a random walk subordinated to a renewal process used in physics to model anomalous diffusion. In this paper, we establish Chover-type laws of the iterated logarithm for continuous time random walks with jumps and waiting times in the domains of attraction of stable laws.
1. Introduction
It should be mentioned that the subordination scheme of CTRW processes is going back to Fogedby [1] and that it was expanded by Baule and Friedrich [2] and Magdziarz et al. [3]. It should also be mentioned that the theory of subordination holds for nonhomogeneous CTRW processes, that were introduced in the following works: Metzler et al. [4, 5] and Barkai et al. [6].
The CTRW is useful in physics for modeling anomalous diffusion. Heavy-tailed particle jumps lead to superdiffusion, where a cloud of particles spreads faster than the classical Brownian motion, and heavy-tailed waiting times lead to subdiffusion. CTRW models and the associated fractional diffusion equations are important in applications to physics, hydrology, and finance; see, for example, Berkowitz et al. [7], Metzler and Klafter [8], Scalas [9], and Meerchaert and Scalas [10] for more information. In applications to hydrology, the heavy tailed particle jumps capture the velocity irregularities caused by a heterogeneous porous media, and the waiting times model particle sticking or trapping. In applications to finance, the particle jumps are price changes or log returns, separated by a random waiting time between trades.
Throughout this paper we will use C to denote an unspecified positive and finite constant which may be different in each occurrence and use “i.o.” to stand for “infinitely often” and “a.s." to stand for “almost surely” and “u(x) ~ v(x)” to stand for “lim u(x)/v(x) = 1”. Our main results read as follows.
Theorem 1.1. Let {Yi} be a sequence of i.i.d. nonnegative random variables with a common distribution F, and let {Ji}, independent of {Yi}, be a sequence of i.i.d. nonnegative random variables with a common distribution G. Assume that 1 − F(x) ~ x−αL(x), 0 < α < 2, where L is a slowly varying function, and that G is absolutely continuous and 1 − G(x) ~ Cx−β, 0 < β < 1. Let {B(n)} be a sequence such that nL(B(n))/B(n) α → C as n → ∞. Then one has
The following is an immediate consequence of Theorem 1.1.
Corollary 1.2. If the tail distribution of Yi satisfies P(Y1 > x) ~ Cx−α in Theorem 1.1, then one has
In the course of our arguments we often make statements that are valid only for sufficiently large values of some index. When there is no danger of confusion, we omit explicit mention of this proviso.
2. Chung Type LIL for Stable Summands
Theorem 2.1. Let {Ji} be a sequence of i.i.d. nonnegative random variables with a common distribution G(x), and let V(x) = inf {y > 0 : 1 − G(y) ≤ 1/x}. Assume that G is absolutely continuous and 1 − G(x) ~ x−βl(x), 0 < β < 1, where l is a slowly varying function. Then one has
In order to prove Theorem 2.1, we need some lemmas.
Lemma 2.2. Let h(x) be a slowly varying function. Then, if yn → ∞, zn → ∞, one has for any given τ > 0,
Proof. See Seneta [27].
Lemma 2.3. Let {Ji} be a sequence of i.i.d. nonnegative random variables with a common distribution G and let M(n) = max {J1, J2, …, Jn}. Assume that G is absolutely continuous and 1 − G(x) ~ x−βl(x), 0 < β < 1, where l is a slowly varying function. Then one has for some given small t > 0
Proof. We will follow the argument of Lemma 2.1 in Darling [28]. Without loss of generality we can assume J1 = max {J1, J2, …, Jn} = M(n) since each Ji has a probability of 1/n of being the largest term, and P(Ji = Jj) = 0 for i ≠ j since G(x) is presumed continuous.
For notational simplicity we will use the tail distribution and denote by g(x) the corresponding density, so that . Then, the joint density of J1, J2, …, Jn, given J1 = M(n), is
The following large deviation result for stable summands is due to Heyde [19].
Lemma 2.4. Let {ξi} be a sequence of i.i.d. nonnegative random variables with a common tail distribution satisfying P(ξ1 > x) ~ x−rh(x), 0 < r < 2, where h is a slowly varying function. Let {λn} be a sequence such that as n → ∞, and let {xn} be a sequence with xn → ∞ as n → ∞. Then
Now we can show Theorem 2.1.
Proof of Theorem 2.1. In order to show (2.3), it is enough to show that for all ɛ > 0
We first show (2.18). Let nk = [θk], 1 < θ < 2. Put again . Let be the inverse of . Obverse that , 0 < y ≤ 1, where H is a slowly varying function and , so that
We now show (2.19). Let , δ > 0. For notational simplicity, we introduce the following notations:
Observe again that and V(n) ~ n1/βH(n), so that
By applying Lemma 2.4 and (2.27) and some simple calculation, we have easily that , so that
3. Proof of Theorem 1.1
Proof of Theorem 1.1. We have to show that for all ɛ > 0
We first show (3.1). Let tk = θk, 1 < θ < 2. For notational simplicity, we introduce the following notations:
By (2.18), we have
Put . Let be the inverse of . Recall that , 0 < y ≤ 1, where is a slowly varying function, so that and
Note that
Observe that
We now show (3.2). Let , δ > 0. To show (3.2), it is enough to prove
Put
By (2.19), we have
Note that
Now, observe that
Acknowledgments
The authors wish to express their deep gratitude to a referee for his/her valuable comments on an earlier version which improve the quality of this paper. K. S. Hwang is supported by the Korea Research Foundation Grant Funded by Korea Government (MOEHRD) (KRF-2006-353-C00004), and W. Wang is supported by NSFC Grant 11071076.