SearcharxivSearch

arXiv · 2606.10496

Dimension lower bounds in random geometry via Lipschitz functions

Abstract

We prove lower bounds for the Hausdorff dimensions of various natural sets associated with the Liouville quantum gravity (LQG) metric. We prove that the set of 3-star points (i.e., starting points of three disjoint geodesics) has Hausdorff dimension at least two with respect to the LQG metric, which is conjectured to be optimal. Our proof works for a general class of planar length metrics which also includes, e.g., Kendall's Poisson roads metric. We additionally prove a dimension lower bound of one for the set of 2-star points intersected with the boundary and for the metric net intersected with the boundary, as well as a dimension lower bound of two for the intersection of two metric nets. In the particular setting of LQG, we obtain sharper lower bounds for the Hausdorff dimensions of the set of 2-star points and the LQG metric net, with respect to both the Euclidean metric and the LQG metric. Our proofs are primarily topological. The key idea is to express the sets of interest in terms of non-constancy sets of Lipschitz functions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Manan Bhatia, Ewain Gwynne, Brin Harper. 2026-06-09. Dimension lower bounds in random geometry via Lipschitz functions. https://arxiv.org/abs/2606.10496

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