SearcharxivSearch

arXiv · 2108.10906

Central limit theorems for associated possibly moving partial sums and application to the non-stationary invariance principle

Abstract

General Central limit theorem deals with weak limits (in type) of sums of row-elements of array random variables. In some situations as in the invariance principle problem, the sums may include only parts of the row-elements. For strictly stationary arrays (stationary for each row), there is no change to the asymptotic results. But for non-stationary data, especially for dependent data, asymptotic laws of partial sums moving in rows may require extra-conditions to exist. This paper deals with central limit theorems with Gaussian limits for non-stationary data. Our main focus is on dependent data, particularly on associated data. But the non-stationary independent data is also studied as a learning process. The results are applied to finite-distributional invariance principles for the types of data described above. In Moreover, results for associated sequences are interesting and innovative. Beyond their own interest, the results are expected to be applied for random sums of random variables and next in statistical modeling in many disciplines, in Actuarial sciences for example

Explore related subjects

Keep this discovery

BibTeXRIS

Akim Adekpedjou, Aladji Babacar Niang, Chérif Mamadou Moctar Traoré, Gane samb Lo. 2021-08-24. Central limit theorems for associated possibly moving partial sums and application to the non-stationary invariance principle. https://arxiv.org/abs/2108.10906

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