SearcharxivSearch

arXiv · 1905.09759

Smoothness and monotonicity of the excursion set density of planar Gaussian fields

Abstract

Nazarov and Sodin have shown that the number of connected components of the nodal set of a planar Gaussian field in a ball of radius $R$, normalised by area, converges to a constant as $R\to \infty $. This has been generalised to excursion/level sets at arbitrary levels, implying the existence of functionals $c_{ES}(\ell )$ and $c_{LS}(\ell )$ that encode the density of excursion/level set components at the level $\ell $. We prove that these functionals are continuously differentiable for a wide class of fields. This follows from a more general result, which derives differentiability of the functionals from the decay of the probability of `four-arm events' for the field conditioned to have a saddle point at the origin. For some fields, including the important special cases of the Random Plane Wave and the Bargmann-Fock field, we also derive stochastic monotonicity of the conditioned field, which allows us to deduce regions on which $c_{ES}(\ell )$ and $c_{LS}(\ell )$ are monotone.

Explore related subjects

Keep this discovery

BibTeXRIS

Dmitry Beliaev, Michael McAuley, Stephen Muirhead. 2019-05-23. Smoothness and monotonicity of the excursion set density of planar Gaussian fields. https://doi.org/10.1214/20-ejp470

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