SearcharxivSearch

arXiv · 1704.08987

Brownian disks and the Brownian snake

Abstract

We provide a new construction of the Brownian disks, which have been defined by Bettinelli and Miermont as scaling limits of quadrangulations with a boundary when the boundary size tends to infinity. Our method is very similar to the construction of the Brownian map, but it makes use of the positive excursion measure of the Brownian snake which has been introduced recently. This excursion measure involves a random continuous tree whose vertices are assigned nonnegative labels, which correspond to distances from the boundary in our approach to the Brownian disk. We provide several applications of our construction. In particular, we prove that the uniform measure on the boundary can be obtained as the limit of the suitably normalized volume measure on a small tubular neighborhood of the boundary. We also prove that connected components of the complement of the Brownian net are Brownian disks, as it was suggested in the recent work of Miller and Sheffield. Finally, we show that connected components of the complement of balls centered at the distinguished point of the Brownian map are independent Brownian disks, conditionally on their volumes and perimeters.

Explore related subjects

Keep this discovery

BibTeXRIS

Jean-François Le Gall. 2017-04-28. Brownian disks and the Brownian snake. https://arxiv.org/abs/1704.08987

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