On the law of the iterated logarithm for trigonometric series with bounded gaps II

preprint2014arXivOpen access

Abstract

It is well-known that for a quickly increasing sequence (nk)k≥1(n_k)_{k \geq 1} the functions (cos⁡2πnkx)k≥1(\cos 2 πn_k x)_{k \geq 1} show a behavior which is typical for sequences of independent random variables. If the growth condition on (nk)k≥1(n_k)_{k \geq 1} is relaxed then this almost-independent behavior generally fails. Still, probabilistic constructions show that for \emph{some} very slowly increasing sequences (nk)k≥1(n_k)_{k \geq 1} this almost-independence property is preserved. For example, there exists (nk)k≥1(n_k)_{k \geq 1} having bounded gaps such that the normalized sums ∑cos⁡2πnkx\sum \cos 2 πn_k x satisfy the central limit theorem (CLT). However, due to a ``loss of mass'' phenomenon the variance in the CLT for a sequence with bounded gaps is always smaller than 1/21/2. In the case of the law of the iterated logarithm (LIL) the situation is different; as we proved in an earlier paper, there exists (nk)k≥1(n_k)_{k \geq 1} with bounded gaps such that lim sup⁡N→∞∣∑k=1Ncos⁡2πnkx∣Nlog⁡log⁡N=∞for almost all x. \limsup_{N \to \infty} \frac{\left| \sum_{k=1}^N \cos 2 πn_k x \right|}{\sqrt{N \log \log N}} = \infty \qquad \textrm{for almost all $x$.} In the present paper we prove a complementary results showing that any prescribed limsup-behavior in the LIL is possible for sequences with bounded gaps. More precisely, we show that for any real number Λ≥0Λ\geq 0 there exists a sequence of integers (nk)k≥1(n_k)_{k \geq 1} satisfying nk+1−nk∈{1,2}n_{k+1} - n_{k} \in \{1,2\} such that the limsup in the LIL equals ΛΛ for almost all xx. Similar results are proved for sums ∑f(nkx)\sum f(n_k x) and for the discrepancy of (⟨nkx⟩)k≥1(\langle n_k x \rangle)_{k \geq 1}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.