SearcharxivSearch

arXiv · 1802.03034

Steep Points of Gaussian Free Fields in Any Dimension

Abstract

This work aims to extend the existing results on the Hausdorff dimension of the classical thick point sets of a Gaussian free field (GFF) to a more general class of exceptional sets. We adopt the circle or sphere averaging regularization to treat a singular GFF in any dimension, and introduce the notion of "$f-$steep point" of the GFF for certain test function $f$. Roughly speaking, the $f-$steep points of a generic element of the GFF are locations where, when weighted by the function $f$, the "steepness", or in other words, the "rate of change" of the regularized field element becomes unusually large. Different choices of $f$ lead to the study of various exceptional behaviors of the GFF. We investigate the Hausdorff dimension of the set consisting of $f-$steep points, from which we can recover the existing results on thick point sets for both log-correlated and polynomial-correlated GFFs, and also obtain new results on exceptional sets that, to our best knowledge, have not been previously studied. Our method is inspired by the one used to study the thick point sets of the classical 2D log-correlated GFF.

Explore related subjects

Keep this discovery

BibTeXRIS

Linan Chen. 2018-02-08. Steep Points of Gaussian Free Fields in Any Dimension. https://arxiv.org/abs/1802.03034

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