SearcharxivSearch

arXiv · 2005.14610

Critical Brownian multiplicative chaos

Abstract

Brownian multiplicative chaos measures, introduced in [Jeg20, AHS20, BBK94], are random Borel measures that can be formally defined by exponentiating $γ$ times the square root of the local times of planar Brownian motion. So far, only the subcritical measures where the parameter $γ$ is less than 2 were studied. This article considers the critical case where $γ=2$, using three different approximation procedures which all lead to the same universal measure. On the one hand, we exponentiate the square root of the local times of small circles and show convergence in the Seneta--Heyde normalisation as well as in the derivative martingale normalisation. On the other hand, we construct the critical measure as a limit of subcritical measures. This is the first example of a non-Gaussian critical multiplicative chaos. We are inspired by methods coming from critical Gaussian multiplicative chaos, but there are essential differences, the main one being the lack of Gaussianity which prevents the use of Kahane's inequality and hence a priori controls. Instead, a continuity lemma is proved which makes it possible to use tools from stochastic calculus as an effective substitute.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Antoine Jego. 2021-04-11. Critical Brownian multiplicative chaos. https://doi.org/10.1007/s00440-021-01051-7

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