SearcharxivSearch

arXiv · 1908.05881

Brownian Loops, Layering Fields and Imaginary Gaussian Multiplicative Chaos

Abstract

We study vertex-like operators built from the Brownian loop soup in the limit as the loop soup intensity tends to infinity. More precisely, following Camia, Gandolfi and Kleban (Nuclear Physics B 902, 2016), we take a Brownian loop soup in a planar domain and assign a random sign to each loop. We then consider random fields defined by taking, at every point of the domain, the exponential of a purely imaginary constant times the sum of the signs associated to the loops that wind around that point. As smaller loops are included in the count, that sum diverges logarithmically with the diameter of the loops, but we show that a suitable renormalization procedure allows to define the fields in an appropriate Sobolev space. Subsequently, we let the intensity of the loop soup tend to infinity and prove that these vertex-like fields tend to a conformally covariant random field which can be expressed as an explicit functional of the imaginary Gaussian multiplicative chaos with covariance kernel given by the Brownian loop measure. Besides using properties of the Brownian loop soup and the Brownian loop measure, a main tool in our analysis is an explicit Wiener-It\^{o} chaos expansion of linear functionals of vertex-like fields.

Explore related subjects

Keep this discovery

BibTeXRIS

Federico Camia, Alberto Gandolfi, Giovanni Peccati, Tulasi Ram Reddy. 2019-08-16. Brownian Loops, Layering Fields and Imaginary Gaussian Multiplicative Chaos. https://arxiv.org/abs/1908.05881

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