SearcharxivSearch

arXiv · 2607.11469

Breuer-Major-Donsker invariance principle

Abstract

We prove a Breuer-Major-type Donsker's invariance principle for stationary Gaussian sequences under the natural \emph{finite-variance assumption} on the test function. This result, which we call the \emph{Breuer-Major-Donsker} principle, or simply the \emph{BMD principle}, removes the additional moment assumption imposed in the functional Breuer-Major theorem of Nourdin and Nualart (\emph{Probab. Theory Related Fields}, 2020). Our method does not rely on the Malliavin-calculus estimates used by Nourdin and Nualart, in particular Meyer's inequality. Instead, it is based on a predictable-martingale decomposition of the partial-sum process, which is of independent interest. We also make systematic use of \emph{non-determinism}, a central notion in Gaussian prediction theory. In the non-deterministic case, the martingale part is handled by the martingale functional central limit theorem, while the predictable remainder gains integrability above order two through Ornstein-Uhlenbeck smoothing. In the deterministic case, the martingale part vanishes, and the smoothing mechanism is no longer available along the full sequence. Nevertheless, under an additional mild assumption on the covariance function, a suitable decimation recovers non-determinism and reduces the proof to the non-deterministic case.

Explore related subjects

Keep this discovery

BibTeXRIS

Paul Mansanarez, Guillaume Poly, Guangqu Zheng. 2026-07-13. Breuer-Major-Donsker invariance principle. https://arxiv.org/abs/2607.11469

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