SearcharxivSearch

arXiv · 2609.04138

The conformally invariant metric on CLE$_4$ I: subsequential limits of the non-simple CLE graph metric

Abstract

We consider the conformal loop ensemble (CLE) with the parameter $\kappa=4$, the critical value at or below which the loops are simple and do not intersect each other or the domain boundary. We show that the loops of a CLE$_4$ uniquely determine a conformally invariant, local, and geodesic metric so that the metric ball growth from the domain boundary coincides with the uniform exploration of Werner and Wu. This metric was previously constructed in unpublished work of Sheffield, Watson, and Wu. Our approach differs in that we show that the metric arises as the renormalized limit of the graph metric on CLE$_\kappa$ loops as $\kappa \downarrow 4$. In this first paper in a series of three, we prove that the subsequential limits exist and define a non-trivial conformally invariant metric on CLE$_4$ which is local and such that the metric ball growth from the boundary is given by the uniform exploration of Werner and Wu. In subsequent work, we will show that the subsequential limit exists as a true limit.

Explore related subjects

Keep this discovery

BibTeXRIS

Emmanuel Kammerer, Konstantinos Kavvadias, Jason Miller, Yi Tian. 2026-09-03. The conformally invariant metric on CLE$_4$ I: subsequential limits of the non-simple CLE graph metric. https://arxiv.org/abs/2609.04138

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