The bounded law of the iterated logarithm for the weighted empirical distribution process in the non-i.i.d. case (Q793430): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 01:14, 5 March 2024

scientific article
Language Label Description Also known as
English
The bounded law of the iterated logarithm for the weighted empirical distribution process in the non-i.i.d. case
scientific article

    Statements

    The bounded law of the iterated logarithm for the weighted empirical distribution process in the non-i.i.d. case (English)
    0 references
    0 references
    0 references
    1984
    0 references
    The following theorem is a consequence of a more general result obtained in the paper. Theorem. Let \(\{X_ k\}^{\infty}_{k=1}\) be a sequence of independent, non-negative r.v., \(\psi\) (t), \(t\geq 0\), be a non- negative, nondecreasing function and \(\{B_ n\}\) be an increasing sequence of positive real numbers with \(\lim_{n\to \infty}B_ n=\infty\). Assume that for some \(\lambda,\beta \in R^ 1\), \(\lim \sup_{n\to \infty}B_ n^{-1}| \sum^{n}_{k=1}\epsilon_ k\psi(X_ k)|<\lambda\) a.s. and \(\lim \sup_{n\to \infty}\sup_{\psi(t)>2\lambda B_ n}B_ n^{- 1}\psi(t)\sum^{n}_{k=1}P(X_ k\geq t)<\beta\). Then \(\lim \sup_{n\to \infty}\sup_{t>0}B_ n^{-1}| \psi(t)\sum^{n}_{k=1}(I_{(X_ k\geq t)}-P(X_ k\geq t))|<1120\lambda +20\beta\) a.s. The proof is based on the upper bounds on the probability distribution of the weighted empirical process. These bounds are also used to obtain a one sided version of Daniel's theorem in the non-i.i.d. case.
    0 references
    law of the iterated logarithm
    0 references
    weighted empirical process
    0 references
    Daniel's theorem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references