SearcharxivSearch

arXiv · 2502.20930

Moment generating functions and moderate deviation principles for lacunary trigonometric sums

Abstract

In a recent paper, Aistleitner, Gantert, Kabluchko, Prochno and Ramanan studied large deviation principles (LDPs) for lacunary trigonometric sums $\sum_{n=1}^N \cos(2 \pi n_k x)$, where the sequence $(n_k)_{k \geq 1}$ satisfies the Hadamard gap condition $n_{k+1} / n_k \geq q > 1$ for $k \geq 1$. A crucial ingredient in their work were asymptotic estimates for the moment generating function (MGF) of such sums, which turned out to depend on the fine arithmetic structure of the sequence $(n_k)_{k \geq 1}$ in an intricate way. In the present paper we carry out a detailed study of the MGF for lacunary trigonometric sums (without any structural assumptions on the underlying sequence, other than lacunarity), and we determine the sharp threshold where arithmetic effects start to play a role. As an application, we prove moderate deviation principles for lacunary trigonometric sums, and show that the tail probabilities are in accordance with Gaussian behavior throughout the whole range between the central limit theorem and the LDP regime.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christoph Aistleitner, Lorenz Frühwirth, Manuel Hauke, Maryna Manskova. 2025-02-28. Moment generating functions and moderate deviation principles for lacunary trigonometric sums. https://arxiv.org/abs/2502.20930

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR