An Erd\"os--R\'ev\'esz type law of the iterated logarithm for order statistics of a stationary Gaussian process

Abstract

Let \X(t):t∈ R+\ be a stationary Gaussian process with almost surely (a.s.) continuous sample paths, E X(t) = 0, E X2(t) = 1 and correlation function satisfying (i) r(t) = 1 - C|t|α + o(|t|α) as t 0 for some 0α 2, C>0, (ii) t s|r(t)|<1 for each s>0 and (iii) r(t) = O(t-λ) as t∞ for some λ>0. For any n 1, consider n mutually independent copies of X and denote by \Xr:n(t):t 0\ the rth smallest order statistics process, 1 r n. 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.) equals 0 or 1. Using this criterion we find that, for a family of functions fp(t), such that zp(t)= P(s∈[0,1]Xr:n(s)>fp(t))= C(t1-p t)-1, C>0, P( Efp)= 1\p 0\. Consequently, with p (t) = \s:0 s t, Xr:n(s) fp(s)\, for p 0, t∞p(t)=∞ and t∞(p(t)-t)=0 a.s.. Complementary, we prove an Erd\"os-R\'ev\'esz type law of the iterated logarithm lower bound on p(t), i.e., t∞(p(t)-t)/hp(t) = -1 a.s., p>1, t∞(p(t)/t)/(hp(t)/t) = -1 a.s., p∈(0,1], where hp(t)=(1/zp(t))p t.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…