On quasisymmetric embeddings of the Brownian map and continuum trees

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 Rd\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\,\mathrm{\mathbb {R}}\,}}^d$$\end{document}, Sd\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\,\mathrm{\mathbb {S}}\,}}^d$$\end{document}, Td\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\,\mathrm{\mathbb {T}}\,}}^d$$\end{document}, 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”.


Introduction
Over the past few years two important models of random geometry of the sphere S 2 emerged. One was originally motivated by string theory and conformal field theory in physics and is known as Liouville Quantum Gravity. The other is known as the Brownian map, which originated from the study of large random planar maps. The Brownian map turned out to be a universal limit of random planar maps of S 2 and both models have attracted a great deal of interest over the past few years.
We say that a map is planar if it is an embedding of a finite connected graph onto S 2 with no edge-crossings. A quadrangulation is a planar map where all its faces are incident to exactly four edges, where edges incident to only one face are counted twice (for both "sides" of the edge). Let Q n be the set of all rooted 1 quadrangulations with n vertices. This set is finite and we randomly choose a specific quadrangulation q n ∈ Q n with the uniform probability measure. Let d gr be the graph metric. 2 It was independently proven by Le Gall [17] and by Miermont [21] that the sequence (q n , n −1/4 d gr ) converges in distribution to a random limit object (m ∞ , D), known as the Brownian map, in the space isometry classes of all compact sets (K, d G H ) equipped with the Gromov-Hausdorff distance. Remarkably, Le Gall also established that this object is universal in the sense that not just quadrangulations, but also uniform triangulations and 2n-angulations (n ≥ 2) converge in distribution to the same object, up to a rescaling that only depends on the type of p-angulation, see [17] and the survey [18]. Notably, the Brownian map is homeomorphic to S 2 but has Hausdorff dimension 4, indicating that the homeomorphism is highly singular. Finding such a canonical mapping is still an active research area and in this article we show, using elementary facts from probability and dimension theory, that the Brownian map has an almost sure metric property that we coin starry. This property implies that the Brownian map and its images under quasisymmetric mappings has infinite Assouad dimension and hence cannot be embedded by quasisymmetric mappings (such as isometries) into finite dimensional manifolds.
The other important model of random surfaces is known as Liouville Quantum Gravity (LQG) which is defined in terms of a real parameter γ . The LQG is a random geometry based on the Gaussian Free Field (GFF), a random construction that can be considered a higher dimensional variant of Brownian motion. Crucially, the law of the GFF is conformally invariant. When γ = √ 8/3, the resulting random surface has long been conjectured to be equivalent to the Brownian map. Very recently, work began to unify the two models and although the exact nature of this equivalency (that is, a canonical embedding) is still unknown, major progress was made by Miller and Sheffield in their series of works [23][24][25]; see also the recent survey [22]. In particular, they showed that the Brownian map and LQG share the same axiomatic properties and that there exists a homeomorphism of the Brownian map onto S 2 which realises LQG. As above, the quasisymmetrically invariant starry property implies that no such embedding can be quasisymmetric. In [15], Gwynne, Miller, and Sheffield gave an explicit construction of the embedding as the limit of conformal embeddings, showing that the discretised Brownian disk converges to the conformal embedding of the continuum Brownian disk. The latter corresponds to √ 8/3-LQG. Before describing our results and background in detail, we remark that the Brownian map can also be obtained from another famous random space: the Brownian continuum random tree. The Brownian continuum random tree (CRT) is a continuum tree that was introduced and studied by Aldous in [2][3][4]. It appears in many seemingly disjoint contexts such as the scaling limit of critical Galton-Watson trees and Brownian excursions using a "least intermediate point" metric. This ubiquity led to the CRT becoming an important object in probability theory in its own right. The Brownian map can be constructed from the CRT by another change in metric and it is this description that allows access to a very different set of probabilistic tools on which our proofs are based. In fact, we first prove that the CRT is starry and thus also cannot be embedded into finite dimensional manifolds almost surely. Note that this is also in stark contrast with the work on conformal weldings of the CRT in [19] and implies much higher singularity of embeddings than previously known.
This article is structured as follows: In Sect. 2, we recall the definition of the Assouad dimension and its use in embedding theory. We will also introduce the starry property for metric spaces in Sect. 2.2 and show that it is invariant under quasisymmetric mappings and implies infinite Assouad dimension. In Sect. 3, we define the Brownian continuum random tree via the Brownian excursion and show that the CRT is starry almost surely. We conclude that it cannot be embedded into R d for any d ∈ N using quasisymmetric mappings. In Sect. 4, we define the Brownian map through the CRT and prove that the Brownian map is starry, also. In particular, Theorem 2.4 states that quasisymmetric images of starry metric spaces have infinite Assouad dimension (and are thus not doubling), Theorem 3.5 proves that the CRT is starry almost surely, and Theorem 4.1 shows that the Brownian map is starry. Section 5 finishes this article by containing a discussion of our results from a fractal geometric point of view. Throughout, we postpone proofs until the end of their respective section.

Assouad dimension and embeddings
The Assouad dimension is an important tool in the study of embedding problems. It was first introduced by Patrice Assouad in [5]. More recently, the exact determination of the Assouad dimension for random and deterministic subsets of Euclidean space has revealed intricate relations with separation properties in the study of fractal sets. Notably, the Assouad dimension of random sets tends to be "as big as possible", see e.g. [12], and that for self-conformal subsets of R, Ahlfors regularity is equivalent to the Assouad dimension coinciding with the Hausdorff dimension, see [1].

Assouad dimension
Formally, let (X , d) be a metric space and write N (X , r ) for the minimal number of sets of diameter at most r needed to cover X . We set N (X , r ) = ∞ if no such collection exists.
Let B(x, r ) be the closed ball in X of radius r > 0. The Assouad dimension is then given by There are several important generalisations and variations of the Assouad dimension such as the quasi-Assouad dimension and the Assouad spectrum. The latter fixes the relationship between r and R by a parameter θ , i.e. r = R 1/θ , whereas the former is a slightly more regularised version of the Assouad dimension. One could certainly ask the questions that arise here of these variants and we forward the interested reader to the survey [11] for an overview.
The Assouad dimension is always an upper bound to the Hausdorff dimension but coincides in many "natural" examples such as k-dimensional Riemannian manifolds. However, they can also differ widely in general metric spaces and it is possible to construct a space X such that X is countable with Hausdorff dimension 0 but has infinite Assouad dimension; see e.g. Proposition 2.7. These sets are however somewhat pathological and it would be interesting to find 'natural' metric spaces that have low Hausdorff and box-counting dimension but are 'big' in the sense of Assouad dimension. A natural candidate are random sets since they tend to have a regular average behaviour, giving low Hausdorff dimension, but have rare but very 'thick' regions; see [12,13,27,28]. These regions are detected by the Assouad dimension and, as we will show in this article, are sufficient to give infinite Assouad dimension for the Brownian map and CRT.
The Assouad dimension is strongly related to the metric notion of doubling: a metric space has finite Assouad dimension if and only if it is doubling. Further, the Assouad dimension is invariant under bi-Lipschitz mappings and is a useful indicator when a space is or is not embeddable. Because of this invariance, a metric space (X , d) with Assouad dimension s a = dim A X cannot be embedded into R s a −1 with bi-Lipschitz mappings. The converse is not quite true, but "snowflaking" the metric by some α > 0 allows a bi-Lipschitz embedding [5]. Theorem 2.1 (Assouad Embedding Theorem) Let (X , d) be a metric space with finite Assouad dimension. Then there exists C > 1, N ∈ N, 1/2 < α < 1, and an injection φ : X → R N such that Explicit bounds on N and α can be obtained from the Assouad dimension, see e.g. [8].

Starry metric spaces
While the Assouad dimension is invariant under bi-Lipschitz mappings, this is not true for the more general notion of quasisymmetric mappings. We recall the definition of a quasisymmetric mapping.

Definition 2.2
Let (X , d X ) and (Y , d Y ) be metric spaces. A homeomorphism φ : X → Y is called -quasisymmetric if there exists an increasing function : (0, ∞) → (0, ∞) such that for any three distinct points x, y, z ∈ X , A basic example of quasi-symmetric mappings are isometric embeddings but the notion of quasisymmetric mappings generalises it by allowing a uniformly controlled distortion. In Euclidean space quasisymmetric mappings correspond to quasi-conformal mappings. That is, if φ : → , where , ⊂ R d are open and φ is -quasisymmetric, then φ is also K -quasiconformal for some K depending only on the function . A similar statement holds in the other direction.
In [20], Mackay and Tyson study the Assouad dimension under symmetric mappings. In particular, it is possible to lower the Assouad dimension by quasisymmetric mappings (see also [29]) and they introduce the notion of the conformal Assouad dimension. The conformal Assouad dimension of a metric space (X , d) is defined as the infimum of the Assouad dimension of all quasisymmetric images of X . This notion has been subsequently explored for many examples of deterministic sets, such as self-affine carpets in [16].
Here we define the structure of an approximate n-star, which, heuristically, is the property that a space contains n distinct points that are roughly equidistant to a central point with every geodesic between them going near the centre, the extent of which is controlled by the parameters A and μ.
We say that a metric space We note that any (A, η)-approximate n-star is also an (A, ζ )-approximate m-star for all m ≤ n and ζ ≥ η, provided that 1 + ζ < A − ζ . Further, A is always bounded above by the triangle inequality, since Our main theorem in this section states that all quasisymmetric images of starry metric spaces (including the identity) have infinite Assouad dimension. Essentially, being starry means that the conformal Assouad dimension is maximal.

Theorem 2.4 Let (X , d) be a starry metric space and let φ be a quasisymmetric map-
Recall that a metric space (X , d) is said to be doubling if there exists a constant K > 0 such that the ball B(x, r ) ⊆ X can be covered by at most K balls of radius r /2 for all x ∈ X and r > 0. Given that the Assouad dimension of a metric space is finite if and only if it is doubling, see e.g. [10, Theorem 13.1.1], we obtain Corollary 2.5 Let (X , d X ) be a starry metric space and (Y , d Y ) be a doubling metric space. Then X is not doubling and any embedding φ : X → Y cannot be quasisymmetric.
It is a simple exercise to see that any s-Ahlfors regular space 3 has Assouad (and Hausdorff) dimension equal to s and so R d has Assouad dimension d. Similarly, any d-dimensional Riemannian space is d-Ahlfors regular, as it supports a d-regular volume measure. Our result immediately implies that any starry metric space cannot be embedded into such finite dimensional spaces by quasisymmetric (and hence bi-Lipschitz) mappings.
Careful observation of the estimates in the proof of Theorem 2.4 shows that snowflaking does not allow a quasisymmetric or bi-Lipschitz embedding. That is, there is no analogy of the Assouad embedding theorem (Theorem 2.1) for starry metric spaces and we get the stronger statement.

Corollary 2.6 Let (X , d X ) be a starry metric space and let (Y , d Y ) be a doubling metric space (such as an s-Ahlfors regular space with
: (0, ∞) → (0, ∞) be an increasing function, and φ : X → Y be an embedding of X into Y . Then φ cannot satisfy In analogy to the observation that every set X ⊂ R d with Assouad dimension d ∈ N must contain [0, 1] d as a weak tangent, see [14], one might think that a metric space with infinite Assouad dimension must also be starry. However, that is not true.

Proposition 2.7 There exists a countable and bounded metric space with infinite Assouad dimension that is not starry.
We will give an example in the next section.

Proofs for Sect. 2
Proof of Theorem 2. 4 We argue by contradiction. Assume dim A φ(X ) < ∞. Then there exists s > 0 and C > 1 such that We assume that X is starry and thus there exist A and η such that X has (A, η)-approximate n k -stars. Pick k such that is the scale distortion function of the quasisymmetric mapping φ.
Let x i , , be the points and size of the approximate n k -star. First note that distances relative to the centre x 0 are preserved. That is, for all i ∈ {1, . . . , n k }, One deduces a lower bound by taking the inverse by the triangle inequality and our estimate 4 . We conclude that any r -cover of {φ(x 1 ), . . . , φ(x n k )} must consist of at least n k balls as no single r -ball can cover two distinct points. Hence, But then Proof of Proposition 2. 7 We construct an explicit example of a metric space that is bounded, has infinite Assouad dimension, but is not starry. Consider the set of points (n, m) ∈ N × N with the pseudometric Since d((n, m), (n, m)) = 0 and the distance function is symmetric, we only need to check the triangle inequality. Let (n, m), (n , m ), (n , m ) be points in our space. If n = n , then If, however n = n , we may assume that m = m and min{m, m } ≤ n and (min{m, m } = 1 or max{m, m } ≤ n) as otherwise the triangle inequality is trivially satisfied. If n = n, then When n = n then m = m or m = m . Therefore, at least one of d((n, m), (n , m )) and d((n , m ), (n , m )) is equal to 2 −n . Again we obtain and d is a pseudometric. In fact, identifying points with distance zero gives the metric To see that this space has infinite Assouad dimension one can consider balls B n centered at (n, 1) with diameter R = 2 −n . This ball contains exactly n distinct points (n, 1), (n, 2), . . . , (n, n) each at distance R from each other. Letting r = R/2 we need n balls of diameter r to cover B n . However, there are no uniform constants C, s such that n ≤ C(2) s and hence the Assouad dimension is infinite.
To show that this metric space is not starry, we assume for a contradiction that it is and that there exist 1 < A, η < (A − 1)/2 and subsets S n that form (A n , η)approximate n-stars for A < A n . Consider S n . It must contain a centre x 0 = ( p 0 , q 0 ) ∈ S n and n distinct points in the annulus D n = B(x 0 , (1 + η)ρ n )\B(x 0 , ρ n ). We see that (1 + η)ρ n > 2 −n since otherwise S n ⊆ B n and all points in B n are equidistant and do not have a centre. We split the annulus D n in two parts, Thus, S n may contain at most one element in D + n and D − n contains at least n − 1 elements. Consider the distinct elements ( p, q), ( p , q ) ∈ D − n . If p = p we must have d (( p, q), ( p , q )) ≤ p k= p 0 k −2 ≤ (1 + η)ρ n < (A n − η)ρ n . This implies that at least n − 1 elements in D − n are contained a single B p ⊂ D − n . Considering distinct elements ( p, q), ( p , q ) ∈ D − n with p = p , we obtain d(( p, q), ( p , q )) = 2 − p , where p satisfies p 0 k= p k −2 ≤ (1 + η)ρ n . Since these points form an approximate n-star, we further have 2 − p > (A n − η)ρ n > (1 + η)ρ n and so This implies p ≤ 4 and so #S n ≤ 5, a contradiction as n was arbitrary.

Result for Brownian continuum random trees
In this section we introduce the concept of R-trees. We define a pseudometric on [0, 1] in terms of an excursion function f . This pseudometric gives rise to an R-tree which we call the continuum tree of function f . Letting f be a generic realisation of the Brownian excursion, we obtain the Brownian continuum random tree (CRT). We will show that the CRT is a starry metric space and thus has infinite Assouad dimension. In Sect. 5 we ask whether this is true for a larger class of functions.

R-trees and excursion functions
An R-tree is a continuum variant of a tree. It is a metric space that satisfies the following properties.
We further say that (X , d) is rooted if there is a distinguished point x ∈ X , which we call the root.
Heuristically, X is a connected, but potentially uncountable, union of line segments. Every two points x, y ∈ X are connected by a unique arc (or geodesic) that is isomorphic to a line segment. We call any x ∈ X a leaf if X \{x} is still connected. In Sect. 4 we will further introduce a labelling on the trees that is used to identify (or glue) certain leaves. The resulting space will be the Brownian map.
There are several canonical ways of generating R-trees, such as the "stick-breaking model" but here we will focus on continuum trees generated by excursion functions.  The resulting metric space is of cardinality the continuum and can be considered a tree with root vertex 0 ≈ f 1, where the lowest common ancestor of the equivalence classes of x < y is given by the equivalence classes of any t 0 ∈ [x, y] such that f (t 0 ) = min{ f (t) : x ≤ t ≤ y}. We note that while the value for which the minimum is achieved might not be unique in [0, 1] with the Euclidean metric, all such points are identified in the metric space

The Brownian continuum random tree
The Brownian continuum random tree was first studied in the comprehensive work of Aldous [2][3][4]. It is a random metric space that can be obtained with the continuum tree metric described above by choosing the normalised Brownian excursion e(t) as the excursion function. The Brownian excursion can be defined in terms of a Brownian bridge B(t) with parameter T , which is a Wiener process conditioned on B(0) = B(1) = 0. Further, it is well known that the Brownian bridge (with T = 1) can be expressed as t, B(t)) : t ∈ [0, 1]} are compact almost surely and so B(t min ) = min{B(t) : 0 ≤ t ≤ 1} exists and t min is almost surely unique. Cutting the Brownian bridge at the minimum and translating, one obtains a Brownian excursion We use this definition of the Brownian bridge and excursion, as we will need to show a decay of correlations between e(s) and e(t), where s and t are in disjoint subintervals of [0, 1]. The CRT also appears as the limit object of the stick-breaking model and rescaled critical Galton-Watson trees as the number of nodes is taken to infinity. As such, the CRT is an important object in probability theory. It also appears in the construction of the Brownian map, which we will recall in Sect. 4.
Our main result in this section is that the CRT is starry. However, we establish a slightly stronger result below, which we will need in the proof that the Brownian map is starry.

Theorem 3.5 Let e be a Brownian excursion and T e be the associated Brownian continuum random tree. Then, for every n, T e contains infinitely many approximate n-stars, almost surely. In particular, T e is almost surely starry.
Therefore, by Theorem 2.4 and Corollary 2.5, the Brownian excursion has infinite Assouad dimension and cannot be embedded into finite dimensional manifolds using quasisymmetric mappings.
We end this section by noting that, from a fractal geometry standpoint, the continuum tree metric could hold the key to a better understanding of "fractal functions" such as the Weierstraß functions and general self-affine functions, see Sect. 5.

Proofs of Sect. 3
To prove that T e , and later that the Brownian map, is starry, we partition [1/2, 3/4) into countably many disjoint intervals A m n and show that the processes on these intervals are "almost" independent. Let A k n = [a(n, k), a(n, k) + 2 −(n+k+2) ], where a(n, k) = 3 4 − 2 −(n+k+1) (2 k−1 + 1). Noting that a(n, k + 1) − a(n, k) = 2 −(n+k+2) and a(n + 1, 1) > a(n, k) for all n, k ∈ N we see that the interiors of A k n and A k n are disjoint whenever n = n or k = k. Further, n,k∈N A k n = [ 1 2 , 3 4 ) and the half-open intervals 3 4 ). We require the following wellknown result that allows us to estimate a Wiener process with a given function. In particular, this follows directly from the construction of the classical Wiener measure on the classical Wiener space and the fact that this measure is strictly positive, see e.g. [26, §8].
We will use this lemma with a "zig-zag" function (see Fig. 1) that will give the correct structure on [0, 1] when applied with the continuum tree metric. Let F n (x) The function F n is an excursion function (F n (0) = 0 = F n (1)) that is continuous and linear between the local maxima F n ((k + 1)/n) = 1 and local minima F n ((2k +1)/(2n)) = 1/2 in (0, 1). We next show that the Brownian excursion contains arbitrarily good approximations to this function for all n. |e(s) − e(s k n ) − t k n − s k n · F n (s)| < t k n − s k n · 2 1−n .
Let H k n : [0, 1] → A k n be the map defined by x → |A k n |x + inf A k n . By the scaling property of Wiener processes, W k where p n only depends on n. Further, the disjointness of intervals A k n and A k n for (n, k) = (n , k ) implies that the events are independent for different (n, k). A simple application of the Borel-Cantelli lemma then shows that for every n there are infinitely many k such that W k n − F n ∞ < 2 −n almost surely.
While it is not true that B k n (s) is independent of B k n (t), the problematic W (1) plays a diminishing role in approximating B k n by F k n for n, k large. Fix a realisation such that for all n there are infinitely many k such that W k n − F n < 2 −n . Clearly this realisation is generic as the event has full measure. Then, for this realisation, Since W (1) is fixed for this realisation we obtain that for every n ∈ N there are infinitely many k ∈ N such that B k n − F n < 2 −(n−1) . Finally, e is a simple cut and translate transformation of B, where the cut is the (almost surely) unique t min with B(t min ) = min t∈[0,1] B(t). There are two cases to consider. Either t min ≥ 3/4 or t min < 3/4. In the former case we define the interval I k n = A k n + 1 − t min and, in the latter case, we define I k n = A k n − t min for n large enough such that inf A 1 n > t min . Analogous to H k n , define G k n : [0, 1] → I k n to be the unique orientation preserving similarity mapping [0, 1) into I k n . Therefore, almost surely, for large enough n there exist infinitely many k such that sup s∈[0,1) |(e •G k n (s) − e •G k n (0))/ |I k n | − F n (s)| < 2 1−n . This is the required conclusion.
Equipped with this lemma, we prove that the CRT is starry.

Proof of Theorem 3.5
Let G k n be as in the proof of Lemma 3.7 and assume that e is a generic realisation. Then, where the existence of k for large enough n is guaranteed by Lemma 3.7. Let z = 1/(4n). Further, let y p = (2 p + 1)/2n for 0 ≤ p ≤ n − 2. We now estimate the distances between G k n (z) and G k n (y p ) with respect to the d e metric. First, by 3.1, Similarly, for q = p, d e (G k n (y q ), G k n (y p )) = e(G k n (y q )) + e(G k n (y p )) − 2 min Let n = (1 − 2 4−n ) 1 2 |I k n |, A n = (2 + 2 4−n )/(1 − 2 4−n ), and η n = (1 + 2 4−n )/(1 − 2 4−n ) − 1. For n ≥ 6 we obtain A n > 2, 0 < η n ≤ 2/3, and Therefore the points x 0 = G k n (z), x p = G k n (y p ) (1 ≤ p ≤ n) form an (A n , η)approximate (n − 1)-star for sufficiently large n and so, as A n > 2 > 1, we conclude that T e is starry almost surely.

The Brownian map
As mentioned in the introduction, the Brownian map is a model of random geometry of the sphere that arises as the limit of many models of planar maps, e.g. uniform p-angulations ( p ≥ 3) of S 2 , as the number of vertices is increased. We refer the reader to the surveys [18] and [22] for a detailed description of the Brownian map and its relation to other random geometries, such as Liouville Quantum Gravity.
In this section we define the Brownian map in terms of the Brownian continuum random tree and show that the Brownian map is almost surely starry.

Definition of the Brownian map
To obtain the Brownian map from the CRT, one defines a random pseudometric on the CRT, which in turn results in a (quotient) metric space that is the Brownian map. This metric is defined in terms of a Gaussian process defined on the CRT.
Let Z (t) be a centered Gaussian process conditioned on e such that the covariance satisfies E(Z (s)Z (t)| e) = min{e(u) : min{s, t} ≤ u ≤ max{s, t}}.
Note that this completely determines the Gaussian process and that the second moment of distances is equal to the distance on the CRT, that is E((Z (s)− Z (t)) 2 | e) = d e (s, t). One may imagine this process as a Wiener process along geodesics of the CRT, where branches evolve independently up to the common joint value.
We use this process to define a pseudo metric on [0, 1] by first setting

The Brownian map is starry
Lemma 3.7 gives an insight in the extremal structure of T e and we will see that it also implies extremal behaviour for the Brownian map. The approximate star for the CRT (see Fig. 2 gives rise to a line segment of length approximately to which n − 1 line segments of length approximately are glued near the end. By a similar argument to the one in Lemma 3.7 we will see that there exists positive probability that the Gaussian process defined on this substructure follows a similar "zig-zag" pattern that gives rise to a further approximate (n − 1)-star, see Fig. 3.
where the intervals [s k n , t k n ] are pairwise disjoint. Then, ( ( f ), D) is almost surely starry.
In particular, this is true for almost every realisation of the Brownian excursion, see Lemma 3.7.

Corollary 4.2
The Brownian map (m ∞ , D) is almost surely starry and thus for all 0 < α ≤ 1, doubling metric spaces (X , d) and increasing functions : Note further that the intervals at which we chose to "zoom in" on the CRT and Brownian map are arbitrary. We can easily make the stronger statement that there cannot be a single neighbourhood at which the homeomorphism can be quasisymmetric, i.e. the map cannot even be locally quasisymmetric.

Proofs of Sect. 4
Proof of Theorem 4.1 Temporarily fix n, k such that (4.1) holds. Define and Consider the "subtree" ([s k n , t k n ], d f ) ⊂ (T f , d f ) and note that it contains n + 1 lines L i of length comparable to (1/2) t k n − s k n . They are and we have f and f | L i is a bijection. This structure can easily be seen on Fig. 3 (left). The point x n = x 0 corresponds to the root of the tree, the x i correspond to the branch points of line segment L i that end at the leaf y i .
The Gaussian Z on [0, 1] has the property that Z | L i is independent of Z | L j if i = j and is a Wiener process on f (L i ). Let s ∈ L i , t ∈ L j and assume without loss of generality that s < t. Then, (y 0 , Z(y 0 )) (y 1 , Z(y 1 )) (y 2 , Z(y 2 )) (y 3 , Z(y 3 ))

Fig. 3
Labelled structure of an F 4 approximation (left) with line segments L 0 , L 1 , L 2 . Gaussian process indexed by the F 4 subtree (right). From top to bottom, the four graphs show the biased Gaussian process Z along the geodesic from x 0 to y 3 , y 2 , y 1 , and y 0 , respectively Let G i be the unique orientation preserving similarity mapping the interval Then, is equal in distribution to a Wiener process W and, as | f (L i )| ∼ | f (L j )|, there exists p n independent of i such that We can argue similarly for all the joined pieces J i . They are independent (conditioned on starting value) and have length at most (1 + 2 1−n )| f (L 0 )|. Hence the probability The lower bounds are given by Analogous to the proof of Theorem 3.5 we see that the collection of points y i together with centre x 1 , form an approximate (n − 1)-star. Since this is true, almost surely, for every n we have shown that (m ∞ , D) is starry.

The continuum tree as a dual space
While it is not generally true that the operator mapping continuous excursion functions on [0, 1] to continuum trees is invertible, one can see the tree associated with a function as an indicator of its irregularity. For instance, local maxima of the excursion function are exactly the leaves of the associated continuum tree (with the exception of the root). One might conjecture a strong link between dimensions of the graph of an excursion function and its associated continuum tree. Given the extremal nature of the Assouad dimension one might further conjecture that functions whose graph has Assouad dimension strictly larger than 1 have an associated continuum tree that is starry.

Conjecture 5.2 Let f be an excursion function such that dim A G f > 1. Then T f is starry.
This is certainly not a necessary condition as Example 5.1 below shows. Establishing such relationships between dimensions and irregular curves is at the heart of fractal geometry, see e.g. [7] and [9]. The dimension theory of the family of Weierstraß functions has only recently been analysed and self-affine curves are still not fully understood, see e.g. [6]. One of the major difficulty for affine functions are complicated relationships between the scaling in the horizontal as well as vertical axis and the continuum tree might get around this problem by separating the two scales in terms of placement of nodes and length of subtrees. These may give rise to a selfsimilar set in an abstract space other than R d that may be easier to understand. Knowing bounds such as those asked in Question 5.1 may lead to a better understanding of the self-affine theory and this "dual space" could solve many open questions for singular functions.

Fig. 6 The continuum tree T g(x)+s(x)
Let us define disjoint dyadic intervals [a n , b n ] ⊂ [0, 1/2] by a n = 1/2 − 2 −(n+1) and b n = a n + 2 −(n+3) . Note that a n+1 − b n = b n − a n , and so, the gap between [a n , b n ] and [a n+1 , b n+1 ] is equal in size to the length of the former interval. We define s(x) = χ [a n ,b n ] (x) · (b n − a n ) · s (n+1) n ((x − a n )/(b n − a n )) and note that this function is triangular on [a n , b n ] with slope 2 but decreasing amplitude and increasing frequency, such that it has (n + 1) n maxima on [a n , b n ]. The map S : (x, y) → (x, y + s(x)) is easily shown to be bi-Lipschitz on [0, 1] × R with Lipschitz constant √ 5. Further, let χ [a n ,b n ] (y) dy.
It is clear that g 1 (x) is a non-decreasing function with slope 0 in [a n , b n ] and slope 1 otherwise. Let g 2 (x) = −2g 1 (1/2)x + 2g 1 (1/2) and Similarly, G : (x, y) → (x, y + g(x)) is bi-Lipschitz on [0, 1] × R with Lipschitz constant √ 2. It can be checked that g(x) + s(x) is an excursion function on [0, 1] see also Fig. 4 and Fig. 5. The graph {(x, g(x) + s(x)) : x ∈ [0, 1]} is the image of [0, 1] × {0} under S • G and hence is a bi-Lipschitz image of the unit line. Therefore the Assouad dimension of the excursion graph g(x) + s(x) is 1, i.e. as low as possible for a continuous function. To see that the resulting continuum tree T g(x)+s(x) is starry, one needs to observe that the triangle function gives the excursion functions (n + 1) n peaks in [a n , b n ] whose amplitude is small compared to g(a n+1 ). This gives rise to approximate (n + 1) n -stars centred at a n ∈ T g(x)+s(x) for all n and thus T g(x)+s(x) is starry. See Fig. 6 for an illustration of T g(x)+s(x) .