An Erdös–Révész Type Law of the Iterated Logarithm for Order Statistics of a Stationary Gaussian Process

Let {X(t):t∈R+}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{X(t):t\in \mathbb R_+\}$$\end{document} be a stationary Gaussian process with almost surely (a.s.) continuous sample paths, EX(t)=0,EX2(t)=1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb E X(t) = 0, \mathbb E X^2(t) = 1$$\end{document} and correlation function satisfying (i) r(t)=1-C|t|α+o(|t|α)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$r(t) = 1 - C|t|^{\alpha } + o(|t|^{\alpha })$$\end{document} as t→0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t\rightarrow 0$$\end{document} for some 0≤α≤2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$0\le \alpha \le 2$$\end{document} and C>0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C>0$$\end{document}; (ii) supt≥s|r(t)|<1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sup _{t\ge s}|r(t)|<1$$\end{document} for each s>0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$s>0$$\end{document} and (iii) r(t)=O(t-λ)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$r(t) = O(t^{-\lambda })$$\end{document} as t→∞\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t\rightarrow \infty $$\end{document} for some λ>0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda >0$$\end{document}. For any n≥1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n\ge 1$$\end{document}, consider n mutually independent copies of X and denote by {Xr:n(t):t≥0}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{X_{r:n}(t):t\ge 0\}$$\end{document} the rth smallest order statistics process, 1≤r≤n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$1\le r\le n$$\end{document}. We provide a tractable criterion for assessing whether, for any positive, non-decreasing function f,P(Ef)=P(Xr:n(t)>f(t)i.o.)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$f, \mathbb P(\mathscr {E}_f)=\mathbb P(X_{r:n}(t) > f(t)\, \text { i.o.})$$\end{document} equals 0 or 1. Using this criterion we find, for a family of functions fp(t)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$f_p(t)$$\end{document} such that zp(t)=P(sups∈[0,1]Xr:n(s)>fp(t))=O((tlog1-pt)-1)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$z_p(t)=\mathbb P(\sup _{s\in [0,1]}X_{r:n}(s)>f_p(t))=O((t\log ^{1-p} t)^{-1})$$\end{document}, that P(Efp)=1{p≥0}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb P(\mathscr {E}_{f_p})= 1_{\{p\ge 0\}}$$\end{document}. Consequently, with ξp(t)=sup{s:0≤s≤t,Xr:n(s)≥fp(s)}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\xi _p (t) = \sup \{s:0\le s\le t, X_{r:n}(s)\ge f_p(s)\}$$\end{document}, for p≥0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p\ge 0$$\end{document} we have limt→∞ξp(t)=∞\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lim _{t\rightarrow \infty }\xi _p(t)=\infty $$\end{document} and lim supt→∞(ξp(t)-t)=0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\limsup _{t\rightarrow \infty }(\xi _p(t)-t)=0$$\end{document} a.s. Complementarily, we prove an Erdös–Révész type law of the iterated logarithm lower bound on ξp(t)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\xi _p(t)$$\end{document}, namely, that lim inft→∞(ξp(t)-t)/hp(t)=-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\liminf _{t\rightarrow \infty }(\xi _p(t)-t)/h_p(t) = -1$$\end{document} a.s. for p>1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p>1$$\end{document} and lim inft→∞log(ξp(t)/t)/(hp(t)/t)=-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\liminf _{t\rightarrow \infty }\log (\xi _p(t)/t)/(h_p(t)/t) = -1$$\end{document} a.s. for p∈(0,1]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p\in (0,1]$$\end{document}, where hp(t)=(1/zp(t))ploglogt\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$h_p(t)=(1/z_p(t))p\log \log t$$\end{document}.


Introduction and Main Results
Let X = {X (t) : t ∈ R + } be a stationary Gaussian process with almost surely (a.s.) continuous sample paths, EX (t) = 0 and EX 2 (t) = 1. Suppose that the correlation function of X, r (t) = EX (t)X (0), satisfies the following regularity assumptions: The analysis of extremes of Gaussian stochastic processes has a long history. The celebrated double sum method, primarily developed by Pickands, e.g., [8], and extended by seminal works of Piterbarg, e.g., [10] or monograph [9], plays central role in the extreme value theory of Gaussian processes. The technique developed there appeared to be an universal method, which may deliver answers also to classes of non-Gaussian processes, see for example, recent contributions of [5,6]. Laws of the iterated logarithm take important place in this theory, providing properties of extremal behavior of stochastic processes on large-time scale. One of important contributions in this domain is a result on the process ξ = {ξ(t) : t ≥ 0}, defined via ξ(t) = sup{s : 0 ≤ s ≤ t, X (s) ≥ (2 log s) 1/2 }. In particular, the law of the iterated logarithm implies that, see [11,12], lim sup t→∞ (ξ(t) − t) = 0 a.s.
In this paper, we derive a counterpart of Shao's result for the order statistics process X r :n . Namely, for any n ≥ 0, we consider X 1 , . . . , X n , n mutually independent copies of X and denote by X r :n = {X r :n (t) : t ≥ 0} the r th smallest order statistics process, that is, for each t ≥ 0, 1 ≤ r ≤ n, Our first contribution is the theorem that extends classical findings of Qualls and Watanabe [11].

Theorem 1
For all functions f that are positive and non-decreasing on some interval [T, ∞), T > 0, it follows that as the integral [1, Theorem 2.2], see also [3], gave the expression for the asymptotic behavior of the probability in I f , namely P sup wherer = n − r + 1, (u) = 1 − (u) and (u) is the distribution function of unit normal law,  [1]. Therefore, Theorem 1 provides a tractable criterion for settling the dichotomy of P E f .
(6) Hence, for any p ∈ R, Next, consider the process ξ p = {ξ p (t) : t ≥ 0} defined as Since I f p = ∞ for p ≥ 0, Theorem 1 implies that The second contribution of this paper is an Erdös-Révśz type of law of the iterated logarithm for the process ξ p .
Theorem 2 shows that for t big enough, there exists an s in [t − h p (t), t] (as well as in [t, t + h p (t)] by (7)) such that X r :n (s) ≥ f p (s) and that the length of the interval h p (t) is smallest possible. One can retrieve (3)-(4) by setting n = 1, and p = 2−r α 2α + 1 = 2+α 2α . Theorem 2 not only generalizes [12, Theorem 1.1], it also unveils the lacking so far structure of the lower bound of ξ p (t) by relating it, via h p (t), to the asymptotics of the tail distribution of the supremum of the underlying process evaluated at f p (t); in (3) t (log t) (α−2)/(2α) is of the same asymptotic order as the reciprocal of P sup s∈[0,1] X (s) > (2 log t) 1/2 . This shines new light on this type of results, which appear to be intrinsically connected with Gumbel limit theorems; see, e.g., [7], where the function h p (t) plays crucial role. We shall pursue this elsewhere.
The paper is organized as follows. In Sect. 2, we provide a collection of basic results on order statistics of stationary Gaussian processes, used throughout the paper, and prove auxiliary lemmas, which constitute building blocks of the proofs of the main results. These are given in the final part of the paper, Sect. 3.

Auxiliary Lemmas
We begin with some auxiliary lemmas that are later needed in the proofs.
The following lemma is the general form of the Borel-Cantelli lemma; cf. [13].

Lemma 1 Consider a sequence of events {E
The following two lemmas constitute useful tools for approximating the supremum of X r :n on a fixed interval by its maximum on a grid with a sufficiently dense mesh.
Lemma 2 There exist positive constants K , c and u 0 such that for each θ > 0 and u ≥ u 0 .
Proof Note that, by stationarity, there exists a constant K , that may vary from line to line, such that, for sufficiently large u, The last inequality follows from (5) The next lemma follows directly from [4, Theorem 2.4] and is a generalization of the classical Berman's inequality to order statistics.

Lemma 4
For some n, d ≥ 1, and any 1 ≤ l ≤ n let {ξ Then, for any u 1 , . . . , u d > 0, for some positive constant C n,r depending only on n and r , Lemma 5 Under the conditions of Theorem 2, for any ε ∈ (0, 1), there exist positive constants K and ρ depending only on ε, α and λ such that Proof Let, for any i ≥ 0 and ε ∈ (0, 1), For some θ > 0, define grid points in the interval I i , as follows Since f p is an increasing function, it easily follows that, with For any 1 ≤ l ≤ n and i ≥ 0, let X l,i be an independent copy of the process X l . Define a sequence of processes Let Y r :n = {Y r :n (t) : t ≥ 0} be the r th order statistic of Y 1 , . . . , Y n . Put and note that Now using Lemma 4 we find that Estimate of P 1 . Since X r :n is a stationary process, from Eq. 5 combined with Lemma 3, for any ε ∈ (0, 1), sufficiently large θ and S, Estimate of P 2 .
Noting that, for any 0 Without loss of generality assume that λ < 2. From (2) it follows that there is s 0 such that for every s > s 0 ,

Finally, since the integrand in the definition ofÃ
Therefore, for sufficiently large S, We can bound the first sum from the above by

The second sum is bounded from above by
Hence, for some positive constant ρ, depending only on ε, α and λ, which finishes the proof.

Lemma 6
Under the conditions of Theorem 2, for any ε ∈ (0, 1), there exist positive constants K and ρ depending only on ε, α and λ such that Proof Let, for any i ≥ 0, a i = S + i so that y i = f p (a i ). Define grid points in the interval (a i , a i+1 ] as follows Finally, putŷ i = y i − θ α 4 i /y i . Similarly as in the proof of Lemma 5, using Lemma 4 we have a i,u a j,v is as in (9). Estimate of P 1 .
Note that, by Lemma 3 combined with Eq. 5, provided that S is sufficiently large. Estimate of P 2 . Noting that, for j ≥ i + 2, and any 0 Since the integrand in definition ofÃ (r ) a i,u a j,v is continuous and bounded on [0, r * (1)], there exists a constant K such that On the other hand, by (1), there exist positive constants s 0 < 1, such that, for every 0 ≤ s ≤ s 0 ,Ã (r ) Hence, Therefore, by (11)-(13) we obtain .
Completely similar to the estimation of P 2 in the proof of Lemma 5, we can arrive that there exist positive constants K and ρ, independent of S and T , such that, for sufficiently large S, The following lemma is a straightforward modification of Lemmas 3.1 and 4.1 of [14] and [11,Lemma 1.4].

Lemma 7 If Theorem 1 is true under the additional condition that for large t,
it is true without the additional condition.

Proofs of the Main Results
Proof of Theorem 1 Note that the case I f < ∞ is straightforward and does not need any additional knowledge on process X r :n apart from the assumption of stationarity. Indeed, for sufficiently large T , and the Borel-Cantelli lemma completes this part of the proof since f is an increasing function. Now let f be any increasing function such that I f ≡ ∞. With the same notation as in Lemma 5 with f instead of f p , we find that, for any S > 0, Furthermore, for sufficiently large S and θ , cf. estimation of P 1 , (15) Let E i = {max 1≤u≤L i X r :n (s i,u ) ≤ x i }, and note that The first limit is zero as a consequence of (15), and the second limit will be zero because of the asymptotic independence of the events E k . Indeed, there exist positive constants K and ρ, such that for any n > m, by the same calculations as in the estimate of P 2 in Lemma 5 after realizing that, by Lemma 7, we might restrict ourselves to the case when (14) holds. Therefore, P E c i i.o. = 1, which finishes the proof.
Proof of Theorem 2 Step 1. Let p > 1, then, for every ε ∈ (0, 1 4 ), . Then by Lemma 5, where the last inequality follows by the fact that h Now take T k = exp(k 1/ p ). Then Hence, by the Borel-Cantelli lemma, Since ξ(t) is a non-decreasing random function of t, for every T k ≤ t ≤ T k+1 , we have For p > 1 elementary calculus implies which finishes the proof of this step.
Step 2. Let p > 1, then, for every ε ∈ (0, 1 4 ), Proof As in the proof of the lower bound, put Let a k i = S k + i and define grid points in the interval [a k i , a k i+1 ] as follows Put Clearly, for m ≥ 1, Putŷ k i = y k i − θ k i /y k i . Then, by Lemma 2, for some constants K independent of S and T , which may vary between (and among) lines, provided m is large enough. Therefore, To finish the proof of (18), we only need to show that Similarly to (16), we have Applying Lemma 4, we get for 0 ≤ t < k where, similarly to the proof of Lemma 5, It is easy to see that, S k+1 − T k T k+1 − T k ∼ 1, as k → ∞, so that, for 0 ≤ t < k and k large enough, and assuming without loss of generality that λ < 2, along the same lines as in the proof of (18), we also have lim inf k→∞ log ξ p (T k )/T k h p (T k )/T k ≤ −(1 − ε) a.s., which proves (24).