SearcharxivSearch

arXiv · 1610.05360

Universality of the nodal length of bivariate random trigonometric polynomials

Abstract

We consider random trigonometric polynomials of the form \[ f_n(x,y)=\sum_{1\le k,l \le n} a_{k,l} \cos(kx) \cos(ly), \] where the entries $(a_{k,l})_{k,l\ge 1}$ are i.i.d. random variables that are centered with unit variance. We investigate the length $\ell_K(f_n)$ of the nodal set $Z_K(f_n)$ of the zeros of $f_n$ that belong to a compact set $K \subset \mathbb R^2$. We first establish a local universality result, namely we prove that, as $n$ goes to infinity, the sequence of random variables $n\, \ell_{K/n}(f_n)$ converges in distribution to a universal limit which does not depend on the particular law of the entries. We then show that at a macroscopic scale, the expectation of $\ell_{[0,\pi]^2}(f_n)/n$ also converges to an universal limit. Our approach provides two main byproducts: (i) a general result regarding the continuity of the volume of the nodal sets with respect to $C^1$-convergence which refines previous findings of Rusakov et al., Iksanov et al. and Aza\"is et al., and (ii) a new strategy for proving small ball estimates in random trigonometric models, providing in turn uniform local controls of the nodal volumes.

Explore related subjects

Keep this discovery

BibTeXRIS

Jürgen Angst, Guillaume Poly, Hung Pham Viet. 2016-10-17. Universality of the nodal length of bivariate random trigonometric polynomials. https://arxiv.org/abs/1610.05360

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