SearcharxivSearch

arXiv · 2507.15589

Tightness of approximations to metrics on non-simple conformal loop ensemble gaskets

Abstract

We study a class of approximation schemes aimed at constructing conformally covariant metrics defined in the gasket of a conformal loop ensemble (CLE$_\kappa$) for $\kappa \in (4,8)$. This is the range of parameter values so that the loops of a CLE$_\kappa$ intersect themselves, each other, and the domain boundary. Its gasket is the closure of the union of the set of points not surrounded by a loop. The class of approximation schemes includes approximations to the geodesic metric and to the resistance metric. We show that the laws of these approximations are tight, and that every subsequential limit is a non-trivial metric on the CLE$_\kappa$ gasket satisfying a natural list of properties. Subsequent work of the second two authors will show that the limits exist and are conformally covariant both in the setting of the geodesic and resistance metrics. We conjecture that the geodesic (resp. resistance) metric describes the scaling limit of the chemical distance (resp. resistance) metric associated with discrete models that converge in the limit to CLE$_\kappa$ for $\kappa \in (4,8)$ (e.g., critical percolation for $\kappa=6$).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Valeria Ambrosio, Jason Miller, Yizheng Yuan. 2025-07-21. Tightness of approximations to metrics on non-simple conformal loop ensemble gaskets. https://arxiv.org/abs/2507.15589

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