Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1710.06897

The Fyodorov-Bouchaud formula and Liouville conformal field theory

Guillaume Remy
View original source ↗Read source document ↗Export metadata ↓

Abstract

In a remarkable paper in 2008, Fyodorov and Bouchaud conjectured an exact formula for the density of the total mass of (sub-critical) Gaussian multiplicative chaos (GMC) associated to the Gaussian free field (GFF) on the unit circle. In this paper we will give a proof of this formula. In the mathematical literature this is the first occurrence of an explicit probability density for the total mass of a GMC measure. The key observation of our proof is that the negative moments of the total mass of GMC determine its law and are equal to one-point correlation functions of Liouville conformal field theory in the disk defined by Huang, Rhodes and Vargas. The rest of the proof then consists in implementing rigorously the framework of conformal field theory (BPZ equations for degenerate field insertions) in a probabilistic setting to compute the negative moments. Finally we will discuss applications to random matrix theory, asymptotics of the maximum of the GFF and tail expansions of GMC.

Explore related subjects

math.PRmath-phmath.MP

Keep this discovery

BibTeXRIS

Guillaume Remy. 2017-10-18. The Fyodorov-Bouchaud formula and Liouville conformal field theory. https://doi.org/10.1215/00127094-2019-0045

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗