SearcharxivSearch

arXiv · 1808.02378

The functional Breuer-Major theorem

Abstract

Let $X=\{ X_n\}_{n\in \mathbb{Z}}$ be zero-mean stationary Gaussian sequence of random variables with covariance function $\rho$ satisfying $\rho(0)=1$. Let $\varphi:\mathbb{R}\to\mathbb{R}$ be a function such that $E[\varphi(X_0)^2]<\infty$ and assume that $\varphi$ has Hermite rank $d \geq 1$. The celebrated Breuer-Major theorem asserts that, if $\sum_{r\in\mathbb{Z}} |\rho(r)|^d<\infty$ then the finite dimensional distributions of $\frac1{\sqrt{n}}\sum_{i=0}^{\lfloor n\cdot\rfloor-1} \varphi(X_i)$ converge to those of $\sigma\,W$, where $W$ is a standard Brownian motion and $\sigma$ is some (explicit) constant. Surprisingly, and despite the fact this theorem has become over the years a prominent tool in a bunch of different areas, a necessary and sufficient condition implying the weak convergence in the space ${\bf D}([0,1])$ of c\`adl\`ag functions endowed with the Skorohod topology is still missing. Our main goal in this paper is to fill this gap. More precisely, by using suitable boundedness properties satisfied by the generator of the Ornstein-Uhlenbeck semigroup, we show that tightness holds under the sufficient (and almost necessary) natural condition that $E[|\varphi(X_0)|^{p}]<\infty$ for some $p>2$.

Explore related subjects

Keep this discovery

BibTeXRIS

Ivan Nourdin, David Nualart. 2018-08-07. The functional Breuer-Major theorem. https://arxiv.org/abs/1808.02378

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