SearcharxivSearch

arXiv · 1708.02281

Nodal Statistics of Planar Random Waves

Abstract

We consider Berry's random planar wave model (1977) for a positive Laplace eigenvalue $E>0$, both in the real and complex case, and prove limit theorems for the nodal statistics associated with a smooth compact domain, in the high-energy limit ($E\to \infty$). Our main result is that both the nodal length (real case) and the number of nodal intersections (complex case) verify a Central Limit Theorem, which is in sharp contrast with the non-Gaussian behaviour observed for real and complex arithmetic random waves on the flat $2$-torus, see Marinucci et al. (2016) and Dalmao et al. (2016). Our findings can be naturally reformulated in terms of the nodal statistics of a single random wave restricted to a compact domain diverging to the whole plane. As such, they can be fruitfully combined with the recent results by Canzani and Hanin (2016), in order to show that, at any point of isotropic scaling and for energy levels diverging sufficently fast, the nodal length of any Gaussian pullback monochromatic wave verifies a central limit theorem with the same scaling as Berry's model. As a remarkable byproduct of our analysis, we rigorously confirm the asymptotic behaviour for the variances of the nodal length and of the number of nodal intersections of isotropic random waves, as derived in Berry (2002).

Explore related subjects

Keep this discovery

BibTeXRIS

Ivan Nourdin, Giovanni Peccati, Maurizia Rossi. 2017-08-07. Nodal Statistics of Planar Random Waves. https://doi.org/10.1007/s00220-022-04422-w

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