SearcharxivSearch

arXiv · 1408.2202

Limit Theorems for Multivariate Lacunary Systems

Abstract

Lacunary function systems of type $(f(M_nx))_{n\geq 1}$ for periodic functions $f$ and sequences of fast-growing matrices $(M_n)_{n\geq 1}$ exhibit many properties of independent random variables like satisfying the Central Limit Theorem or the Law of the Iterated Logarithm. It is well-known that this behaviour depends on number theoretic properties of $(M_n)_{n\geq 1}$ as well as analytic properties of $f$. Classical techniques are essentially based on Fourier analysis making it almost impossible to use a similar approach in the multivariate setting. Recently Aistleitner and Berkes introduced a new method proving the Central Limit Theorem in the one-dimensional case by approximating $\sum_{n}f(M_nx)$ by a sum of piecewise constant periodic functions which form a martingale differences sequence and using a Berry-Esseen type inequality. Later this approach was used to show the Law of the Iterated Logarithm by a consequence of Strassen's almost sure invariance principle. In this paper we develop this method to prove the Central Limit Theorem and the Law of the Iterated Logarithm in the multidimensional case.

Explore related subjects

Keep this discovery

BibTeXRIS

Thomas Löbbe. 2014-08-10. Limit Theorems for Multivariate Lacunary Systems. https://arxiv.org/abs/1408.2202

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