SearcharxivSearch

arXiv · 1912.07291

On quasisymmetric embeddings of the Brownian map and continuum trees

Abstract

The Brownian map is a model of random geometry on the sphere and as such an important object in probability theory and physics. It has been linked to Liouville Quantum Gravity and much research has been devoted to it. One open question asks for a canonical embedding of the Brownian map into the sphere or other, more abstract, metric spaces. Similarly, Liouville Quantum Gravity has been shown to be "equivalent" to the Brownian map but the exact nature of the correspondence (i.e.\ embedding) is still unknown. In this article we show that any embedding of the Brownian map or continuum random tree into $\mathbb{R}^d$, $\mathbb{S}^d$, $\mathbb{T}^d$, or more generally any doubling metric space, cannot be quasisymmetric. We achieve this with the aid of dimension theory by identifying a metric structure that is invariant under quasisymmetric mappings (such as isometries) and which implies infinite Assouad dimension. We show, using elementary methods, that this structure is almost surely present in the Brownian continuum random tree and the Brownian map. We further show that snowflaking the metric is not sufficient to find an embedding and discuss continuum trees as a tool to studying "fractal functions".

Explore related subjects

Keep this discovery

BibTeXRIS

Sascha Troscheit. 2019-12-16. On quasisymmetric embeddings of the Brownian map and continuum trees. https://arxiv.org/abs/1912.07291

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