SearcharxivSearch

arXiv · 2304.05781

Critical Gaussian Multiplicative Chaos for singular measures

Abstract

Given $d\ge 1$, we provide a construction of the random measure - the critical Gaussian Multiplicative Chaos - formally defined $e^{\sqrt{2d}X}\mathrm{d} \mu$ where $X$ is a $\log$-correlated Gaussian field and $\mu$ is a locally finite measure on $\mathbb R^d$. Our construction generalizes the one performed in the case where $\mu$ is the Lebesgue measure. It requires that the measure $\mu$ is sufficiently spread out, namely that for $\mu$ almost every $x$ we have $$ \int_{B(0,1)}\frac{\mu(\mathrm{d} y)}{|x-y|^{d}e^{\rho\left(\log \frac{1}{|x-y|} \right)}}<\infty, $$ for any compact set where $\rho:\mathbb R_+\to \mathbb R_+$ can be chosen to be any lower envelope function for the $3$-Bessel process (this includes $\rho(x)=x^{\alpha}$ with $\alpha\in (0,1/2)$). We prove that three distinct random objects converge to a common limit which defines the critical GMC: the derivative martingale, the critical martingale, and the exponential of the mollified field. We also show that the above criterion for the measure $\mu$ is in a sense optimal.

Explore related subjects

Keep this discovery

BibTeXRIS

Hubert Lacoin. 2023-04-12. Critical Gaussian Multiplicative Chaos for singular measures. https://arxiv.org/abs/2304.05781

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