A Characterization of Chover-Type Law of Iterated Logarithm
Abstract
Let 0 < α ≤ 2 and - ∞ < β < ∞. Let \Xn; n ≥ 1 \ be a sequence of independent copies of a real-valued random variable X and set Sn = X1 + ·s + Xn, ~n ≥ 1. We say X satisfies the (α, β)-Chover-type law of the iterated logarithm (and write X ∈ CTLIL(α, β)) if n → ∞ | Snn1/α |( n)-1 = eβ almost surely. This paper is devoted to a characterization of X ∈ CTLIL(α, β). We obtain sets of necessary and sufficient conditions for X ∈ CTLIL(α, β) for the five cases: α = 2 and 0 < β < ∞, α = 2 and β = 0, 1 < α < 2 and -∞ < β < ∞, α = 1 and - ∞ < β < ∞, and 0 < α < 1 and -∞ < β < ∞. As for the case where α = 2 and -∞ < β < 0, it is shown that X CTLIL(2, β) for any real-valued random variable X. As a special case of our results, a simple and precise characterization of the classical Chover law of the iterated logarithm (i.e., X ∈ CTLIL(α, 1/α)) is given; that is, X ∈ CTLIL(α, 1/α) if and only if ∈f \b:~ E (|X|α( (e |X|))bα ) < ∞ \ = 1/α where EX = 0 whenever 1 < α ≤ 2.
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.