SearcharxivSearch

arXiv · 2112.08247

Cumulants asymptotics for the zeros counting measure of real Gaussian processes

Abstract

We compute the exact asymptotics for the cumulants of linear statistics associated with the zeros counting measure of a large class of real Gaussian processes. Precisely, we show that if the underlying covariance function is regular and square integrable, the cumulants of order higher than two of these statistics asymptotically vanish. This result implies in particular that the number of zeros of such processes satisfies a central limit theorem. Our methods refines the recent approach by T. Letendre and M. Ancona and allows us to prove a stronger quantitative asymptotics, under weaker hypotheses on the underlying process. The proof exploits in particular the elegant interplay between the combinatorial structures of cumulants and factorial moments in order to simplify the determination of the asymptotics of nodal observables. The class of processes addressed by our main theorem englobes as motivating examples random Gaussian trigonometric polynomials, random orthogonal polynomials and the universal Gaussian process with sinc kernel on the real line, for which the asymptotics of higher moments of the number of zeros were so far only conjectured.

Explore related subjects

Keep this discovery

BibTeXRIS

Louis Gass. 2021-12-15. Cumulants asymptotics for the zeros counting measure of real Gaussian processes. https://arxiv.org/abs/2112.08247

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