SearcharxivSearch

arXiv · 2203.12176

Baxter permuton and Liouville quantum gravity

Abstract

The Baxter permuton is a random probability measure on the unit square which describes the scaling limit of uniform Baxter permutations. We find an explict formula for the expectation of the Baxter permuton, i.e.\ the density of its intensity measure. This answers a question of Dokos and Pak (2014). We also prove that all pattern densities of the Baxter permuton are strictly positive, distinguishing it from other permutons arising as scaling limits of pattern-avoiding permutations. Our proofs rely on a recent connection between the Baxter permuton and Liouville quantum gravity (LQG) coupled with the Schramm-Loewner evolution (SLE). The method works equally well for a two-parameter generalization of the Baxter permuton recently introduced by the first author, except that the density is not as explicit. This new family of permutons, called \emph{skew Brownian permuton}, describes the scaling limit of a number of random constrained permutations. We finally observe that in the LQG/SLE framework, the expected proportion of inversions in a skew Brownian permuton equals $\frac{\pi-2\theta}{2\pi}$ where $\theta$ is the so-called imaginary geometry angle between a certain pair of SLE curves.

Explore related subjects

Keep this discovery

BibTeXRIS

Jacopo Borga, Nina Holden, Xin Sun, Pu Yu. 2022-03-23. Baxter permuton and Liouville quantum gravity. https://arxiv.org/abs/2203.12176

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