1,240 research outputs found

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

    Full text link
    Let {X(t):tR+}\{X(t):t\in\mathbb R_+\} be a stationary Gaussian process with almost surely (a.s.) continuous sample paths, EX(t)=0\mathbb E X(t) = 0, EX2(t)=1\mathbb E X^2(t) = 1 and correlation function satisfying (i) r(t)=1Ctα+o(tα)r(t) = 1 - C|t|^{\alpha} + o(|t|^{\alpha}) as t0t\to 0 for some 0α2,C>00\le\alpha\le 2, C>0, (ii) suptsr(t)0\sup_{t\ge s}|r(t)|0 and (iii) r(t)=O(tλ)r(t) = O(t^{-\lambda}) as tt\to\infty for some λ>0\lambda>0. For any n1n\ge 1, consider nn mutually independent copies of XX and denote by {Xr:n(t):t0}\{X_{r:n}(t):t\ge 0\} the rrth smallest order statistics process, 1rn1\le r\le n. We provide a tractable criterion for assessing whether, for any positive, non-decreasing function ff, P(Ef)=P(Xr:n(t)>f(t)i.o.)\mathbb P(\mathscr E_f)=\mathbb P(X_{r:n}(t) > f(t)\, \text{i.o.}) equals 0 or 1. Using this criterion we find that, for a family of functions fp(t)f_p(t), such that zp(t)=P(sups[0,1]Xr:n(s)>fp(t))=C(tlog1pt)1z_p(t)=\mathbb P(\sup_{s\in[0,1]}X_{r:n}(s)>f_p(t))=\mathscr C(t\log^{1-p} t)^{-1}, C>0\mathscr C>0, P(Efp)=1{p0}\mathbb P(\mathscr E_{f_p})= 1_{\{p\ge 0\}}. Consequently, with ξp(t)=sup{s:0st,Xr:n(s)fp(s)}\xi_p (t) = \sup\{s:0\le s\le t, X_{r:n}(s)\ge f_p(s)\}, for p0p\ge 0, limtξp(t)=\lim_{t\to\infty}\xi_p(t)=\infty and lim supt(ξp(t)t)=0\limsup_{t\to\infty}(\xi_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)\xi_p(t), i.e., lim inft(ξp(t)t)/hp(t)=1\liminf_{t\to\infty}(\xi_p(t)-t)/h_p(t) = -1 a.s., p>1p>1, lim inftlog(ξp(t)/t)/(hp(t)/t)=1\liminf_{t\to\infty}\log(\xi_p(t)/t)/(h_p(t)/t) = -1 a.s., p(0,1]p\in(0,1], where hp(t)=(1/zp(t))ploglogth_p(t)=(1/z_p(t))p\log\log t

    Note on maximally entangled Eisert-Lewenstein-Wilkens quantum games

    Full text link
    Maximally entangled Eisert-Lewenstein-Wilkens games are analyzed. For a general class of gate operators defined in the previous papers of the first author the general conditions are derived which allow to determine the form of gate operators leading to maximally entangled games. The construction becomes particularly simple provided one does distinguish between games differing by relabelling of strategies. Some examples are presented.Comment: 20 pages, no figures, appendix added, references added, concluding remarks extende

    Geometric properties of semitube domains

    Get PDF
    In the paper we study the geometry of semitube domains in C2\mathbb C^2. In particular, we extend the result of Burgu\'es and Dwilewicz for semitube domains dropping out the smoothness assumption. We also prove various properties of non-smooth pseudoconvex semitube domains obtaining among others a relation between pseudoconvexity of a semitube domain and the number of connected components of its vertical slices. Finally, we present an example showing that there is a non-convex domain in Cn\mathbb C^n such that its image under arbitrary isometry is pseudoconvex.Comment: 6 page
    corecore