The Tutte embedding of the Poisson-Voronoi tessellation of the Brownian disk converges to $\sqrt{8/3}$-Liouville quantum gravity

Recent works have shown that an instance of a Brownian surface (such as the Brownian map or Brownian disk) a.s. has a canonical conformal structure under which it is equivalent to a $\sqrt{8/3}$-Liouville quantum gravity (LQG) surface. In particular, Brownian motion on a Brownian surface is well-defined. The construction in these works is indirect, however, and leaves open a basic question: is Brownian motion on a Brownian surface the limit of simple random walk on increasingly fine discretizations of that surface, the way Brownian motion on $\mathbb R^2$ is the $\epsilon \to 0$ limit of simple random walk on $\epsilon \mathbb Z^2$? We answer this question affirmatively by showing that Brownian motion on a Brownian surface is (up to time change) the $\lambda \to \infty$ limit of simple random walk on the Voronoi tessellation induced by a Poisson point process whose intensity is $\lambda$ times the associated area measure. Among other things, this implies that as $\lambda \to \infty$ the Tutte embedding (a.k.a. harmonic embedding) of the discretized Brownian disk converges to the canonical conformal embedding of the continuum Brownian disk, which in turn corresponds to $\sqrt{8/3}$-LQG. As a further consequence, we show that for any sequence of random planar maps $\{M^n\}_{n\in\mathbb N}$ which converges to the Brownian disk, certain"coarse-grained"Tutte embeddings of $M^n$ converge to $\sqrt{8/3}$-LQG. Along the way, we obtain other independently interesting facts about conformal embeddings of Brownian surfaces, including information about the Euclidean shapes of embedded metric balls and Voronoi cells. For example, we derive moment estimates that imply, in a certain precise sense, that these shapes are unlikely to be very long and thin.

1 Main results

Overview
This paper concerns relationships between several different topics, including Liouville quantum gravity and the Brownian map. Let us begin by briefly reviewing the objects under consideration.
A planar map is a graph together with an embedding into the plane so that no two edges cross. Two planar maps are considered to be equivalent if they differ by an orientation preserving homeomorphism of the plane. The study of planar maps goes back to work of Tutte [Tut68] and Mullin [Mul67] from the 1960s. A planar map can be viewed as a metric measure space by equipping it with the graph distance and assigning each vertex one unit of mass. In recent years, there has been considerable progress in studying the large scale metric behavior of planar maps chosen uniformly at random. Of particular relevance to the present article are the scaling limit results which give the convergence of uniformly random planar maps towards a continuous object in the Gromov-Hausdorff-Prokhorov topology. The first results of this type were due to Le Gall [Le 13] and Miermont [Mie13] which are both focused on random planar maps with the sphere topology. In this case, the limiting object is a random metric measure space with the topology of the sphere [LP08,Mie08] called the Brownian map. The works [Le 13, Mie13] have since been extended to uniformly random planar maps with several other topologies, including the disk [BM17,GM17b], the plane [CL14], and the half-plane [BMR16,GM17c]. The limiting objects that one obtains are collectively known as Brownian surfaces.
The aforementioned limit theorems are concerned with the metric measure space structure of large uniformly random planar maps, but not how they are embedded into the plane. However, it is an important problem to understand scaling limits for canonical embeddings of random planar maps. This is motivated in part by a desire to better understand the relationship between statistical mechanics models (e.g., percolation, self-avoiding walks, the Ising model) on random planar maps and their counterparts on planar lattices. It has long been believed that if the embedding is of a conformal type (e.g., Riemann uniformization, circle packing, or the Tutte embedding we consider here), then the large scale geometry of the statistical mechanics model should be the same as if it were considered on a planar lattice. This idea underlies the famous KPZ relation [KPZ88,DS11], which serves to convert critical exponents computed on a random geometry to the corresponding exponents on a deterministic geometry, and has been used numerous times to give predictions for exponents for critical lattice models which were later verified using SLE techniques (e.g., [Dup98,LSW01a,LSW01b,LSW02]).
Liouville quantum gravity (LQG) is another theory of random surfaces which was introduced by Polyakov [Pol81a,Pol81b] in the 1980s in the context of string theory. To define LQG, one starts with a (form of) the Gaussian free field (GFF) h on a domain D and then considers the random Riemann surface with metric tensor e γh(z) (dx 2 + dy 2 ) (1.1) where γ ∈ (0, 2] is a parameter. This definition does not make rigorous mathematical sense since h is a distribution and not a function. Making rigorous sense of various aspects of LQG has been a major topic of research in recent years. Some of this work builds on [DS11], which constructs the volume form associated with (1.1), which is a random measure µ h on D (see [Kah85,RV14] for a more general construction of random measures of this type). One can construct various kinds of LQG surfaces by varying the precise definition of h (what domain it lives on, how boundary conditions are chosen, whether one "weights" the law of h in some locally absolutely continuous way). Generally, one writes γ-LQG to refer to LQG surfaces with parameter γ. The special case γ = 8/3 has long been known to be special: 8/3-LQG surfaces, like Brownian surfaces, are related to "undecorated" planar maps, and are also called pure LQG surfaces.
In fact, a recent series of works by the second two authors has shown that the Brownian map and the so-called 8/3-LQG sphere are in some sense equivalent (and similar statements can be made for disk, whole-plane, or half-plane variants) [MS15b,MS16a,MS16b]. Although both 8/3-LQG spheres and Brownian maps come with a natural measure, they also have additional structure: a Brownian surface has a metric, and a 8/3-LQG surface has a conformal structure (i.e., an embedding into a flat domain, defined up to conformal automorphism of that domain). The works [MS15b,MS16a,MS16b] show that each of these objects can be canonically endowed with the other one's structure, and that once this is done the objects agree in law.
We have made the present work as self-contained as possible, which in particular means that the reader is not required to have read the series [MS15b,MS16a,MS16b] relating Brownian and 8/3-LQG surfaces, or any papers about quantum Loewner evolution. The results we do need will be recalled and restated.
Very roughly, the argument in this series proceeds as follows. First, [MS15b] uses h to construct a metric D h on D using a growth process called quantum Loewner evolution (QLE) [MS16d]. We will not need to recall the precise construction of D h or the definition of QLE here. Section 2.5 contains all of the background on D h that is necessary to understand this paper. Second, [MS16a] shows that in the case of the 8/3-LQG sphere the corresponding metric measure space agrees in law with the Brownian map. Thus, by sampling h (which determines the 8/3-LQG sphere), and then generating the corresponding Brownian map, one obtains a coupling of the 8/3-LQG sphere and the Brownian map. Finally, [MS16b] uses certain "welding and resampling" arguments to show that in this coupling, the latter object almost surely determines the former. In other words, one can recover the 8/3-LQG instance (i.e., the distribution h) as a measurable function of the corresponding Brownian surface instance.
This measurable function is obtained in a remarkably non-explicit way. Although the argument tells us that an instance of a Brownian map (or disk, plane, or half-plane) has a canonical conformal structure, i.e., a canonical embedding into C (or a domain in C) defined up to Möbius transformation, it gives us no way to compute or even approximate that embedding using only information about the "metric measure space" structure of the Brownian surface. Similarly, since a Brownian surface has a canonical conformal structure, we know that Brownian motion on a Brownian surface is well-defined, at least modulo a monotone reparameterization of time. 1 But the argument tells us nothing about how to construct that Brownian motion: in particular, it does not tell us whether Brownian motion on a Brownian surface is the limit of simple random walk on some natural increasingly fine discretizations of that surface, the way Brownian motion on R 2 is the → 0 limit of simple random walk on Z 2 .
The purpose of the present work is to construct the conformal structure of a Brownian surface in an explicit manner. To this end, we will start with an instance of a Brownian surface and then approximate it with the graph of cells associated with the Poisson-Voronoi tessellation. More precisely, we will fix λ > 0 and then pick a Poisson point process with intensity measure given by λ times the area measure on the Brownian surface. The cell corresponding to a given point x in the Poisson point process consists of those points that are at least as close to x as they are to any other point of the Poisson point process (w.r.t. the metric on the Brownian surface). Cells are considered to be adjacent if they have non-empty intersection.
Our main result (Theorem 1.1) says that as λ → ∞, the random walk on the adjacency graph of Voronoi cells converges modulo parameterization to a limiting continuous path. Moreover, this path is a Brownian motion (modulo parameterization) when it is embedded into C using the identification of Brownian surfaces with 8/3-LQG. This gives an intrinsic way of constructing Brownian motion (modulo time parameterization) on a Brownian surface without any reference to LQG: indeed, the Brownian motion on the surface is simply the λ → ∞ limit of the random walk on the Voronoi cells.
One can define the Tutte embedding of the adjacency graph of cells in terms of hitting probabilities for the simple random (in the same way that Riemann uniformization can be defined using the hitting probabilities for Brownian motion, i.e., harmonic measure). Our results show that this Tutte embedding converges to 8/3-LQG in an appropriate sense as λ → ∞ (Theorem 1.2). This in particular gives a new, more explicit, proof of the main result of [MS16b], which says that a 8/3-LQG surface is a.s. determined by its metric measure space structure. As a further consequence, we will show that if {M n } n∈N is any sequence of random planar maps which converges to the Brownian disk w.r.t. a version of the Gromov-Hausdorff-Prokhorov topology, then the embedding of M n into the disk obtained by the Tutte embedding of Poisson-Voronoi cells on M n converges to the 8/3-LQG disk (Theorem 1.3), provided the Poisson intensity is made to depend on n in an appropriate way. This is because the adjacency graph of Poisson-Voronoi cells on M n will approximate the adjacency graph of Poisson-Voronoi cells on the Brownian disk when n is large.
Finally, we remark that Voronoi tessellations of Brownian surfaces have also been considered in other contexts: see, e.g., [Cha16,Gui17]. These papers raise interesting questions about the law of the partitioning of volume among the Voronoi cells, but they do not consider the adjacency graph of cells as we do here.

Main results
Let (X , D, µ) be an instance of the Brownian map, disk, plane, or half-plane, equipped with its metric D and its natural area measure µ. Conditional on (X , D, µ), let P λ for λ > 0 be a Poisson Figure 1: Simulation of the Poisson-Voronoi tessellation of 8/3-LQG. Although the cells differ greatly in Euclidean size, they appear to have moderate "length-to-width ratios" in the sense that a typical cell contains a Euclidean disk of diameter comparable to its own diameter. A mathematical version of this observation plays a role in the proof that simple random walk on the adjacency graph of cells approximates Brownian motion. point process on X with intensity measure λµ. In the case of the Brownian map or disk (when µ is a finite measure) with area equal to A we can equivalently define P λ as follows: sample N ∼ Poisson(λA), independently from (X , D, µ), and then conditional on N and (X , D, µ) sample N points uniformly and independently from µ.
For z ∈ P λ , let H λ z be the Voronoi cell which is the closure of the set of points in X which are D-closer to z than to any other point of P λ . There is a natural graph structure on P λ whereby z, w ∈ P λ are connected by an edge if and only if the cells H λ z and H λ w intersect along their boundaries. Equivalently, z, w ∈ P λ are joined by an edge if and only if there exists u ∈ X such that D(u, z) = D(u, w) and D(u, x) ≥ D(u, z) for each x ∈ P λ \ {z, w}. In the case of the Brownian disk or half-plane, we define ∂P λ to be the set of z ∈ P λ for which the corresponding cell intersects ∂X .
Our first main result (from which all of our other main results will follow) says that the simple random walk on P λ converges modulo time parameterization and that the limiting process coincides with Brownian motion under the embedding of X into C which arises from its identification with a 8/3-LQG surface. This gives us an explicit, intrinsic definition of Brownian motion on a Brownian surface which coincides with the definition which comes from LQG theory.
For z ∈ X , let Y z,λ be the simple random walk on P λ started from the point of P λ whose corresponding cell contains z (if there is more than one such point, we choose one in an arbitrary manner). We extend Y z,λ from the integers to [0, ∞) by declaring that for each j ∈ N, Y z,λ | [j−1,j] traverses the D-geodesic from Y z,λ j−1 to Y z,λ j at constant speed. In the case of the Brownian disk or half-plane, we stop Y z,λ at the first time it hits a point of ∂P λ .
Theorem 1.1 (Brownian motion on a Brownian surface). If K ⊂ X is a compact set chosen in a manner which is measurable with respect to (X , D, µ), then as λ → ∞ the conditional law of the walk Y z,λ given (X , D, µ) converges in probability as λ → 0, uniformly over all z ∈ K, with respect to the topology on curves viewed modulo time parameterization (see Section 2.1.2 for a review of this topology). If we identify X with the Riemann sphere, unit disk, complex plane, or upper half-plane using the correspondence between Brownian and 8/3-LQG surfaces, then the limit of the conditional law of Y z,λ given (X , D, µ) is standard planar Brownian motion started from z (and stopped upon hitting the domain boundary in the case of a surface with boundary), viewed modulo time parameterization.
In light of Theorem 1.1, one can define Brownian motion on X to be the limit of the processes Y z,λ as λ → ∞. See Theorem 3.3 below for a more general version of Theorem 1.1 which also applies to other 8/3-LQG surfaces. Theorem 1.1 allows us to give intrinsic constructions of other objects on Brownian surfaces which can be derived from random walk. For example, by combining it with the main result of [YY11] we obtain an intrinsic definition of SLE 2 on a Brownian surface as the limit of the loop-erased random walk on Poisson-Voronoi tessellations. Our techniques also allow imply variants of Theorem 1.1 in which the edges of P λ are assigned random conductances in a sufficiently nice way. For example, Theorem 1.1 is still true if the conductances are i.i.d. and the conductances and their reciprocals have finite expectation. Essentially, this is because the key step in the proof of Theorem 1.1 uses the main result of [GMS18a], and the result in [GMS18a] allows for variable conductances. We will not state a general variable conductance theorem here, but we remark that if the reader wants to extend Theorem 1.1 to a particular variable conductance model, the key step will be checking that the hypotheses of [GMS18a] remain satisfied.
Theorem 1.1 also gives us an explicit construction of the embedding of a Brownian surface into C. More precisely, one can define an explicit way of embedding the graphs P λ into C -called the Tutte embedding -under which the metric and area measure on P λ inherited from (X , D, µ) converge to the 8/3-LQG metric and area measure, respectively, as λ → ∞. For concreteness, let us focus on the case when (X , D, µ) is the Brownian disk (we do this since our embedding has a simpler definition when our surface has a boundary).
We will now define the Tutte embedding Φ λ into the closed unit disk D of the Poisson point process P λ (equipped with the graph structure discussed above). Recall that ∂P λ denotes the points in P λ whose corresponding cells intersect ∂X . We first specify the points which will be sent (approximately) to 0 and 1. Let z be sampled uniformly from µ and let z 0 be the a.s. unique (see Lemma A.5 below) element of P λ such that z ∈ H λ z 0 . Also let x be sampled uniformly from the canonical length measure on ∂X (which can be defined, e.g., by taking a limit of the re-scaled µ-mass of D-neighborhoods of boundary arcs [Le 17]) and let x 0 be the a.s. unique element of ∂P λ for which x ∈ H λ x 0 . Enumerate the other points in ∂P λ as x 1 , . . . , x m so that if j, k ∈ {0, . . . , m}, then j < k if and only if we hit the cell H λ x j before the cell H λ x k when we traverse ∂X in the counterclockwise direction started from x.
For j ∈ {0, . . . , m}, we declare that Φ λ (x j ) = e 2πip j ∈ ∂D, where p j is the probability that a simple random walk on P λ started from z 0 first hits ∂P λ at one of the points x 0 , . . . , x j . Note that this makes it so that the harmonic measure as seen from z 0 approximates the uniform measure on ∂D. This defines an embedding of ∂P λ . We then extend this embedding to be discrete harmonic on the rest of P λ , equivalently we require that the position of each interior vertex of P λ under our embedding is the average of the positions of its neighbors.
Theorem 1.2 (Tutte embedding convergence). Let (X , D, µ) be a Brownian disk (with any fixed positive choice of area and boundary length) and let h be the GFF-type distribution on D which parameterizes the 8/3-LQG surface 2 corresponding to (X , D, µ) under the correspondence of [MS15b,MS16a,MS16b]. Also let µ h and D h be the 8/3-Liouville quantum gravity area measure and metric, respectively, induced by h, so that (X , D, µ) = (D, D h , µ h ) as metric measure spaces. If we identify P λ with its image under the Tutte embedding, then we have the following convergence in probability as λ → ∞.
• The measure which assigns to each vertex of P λ a mass equal to the µ-mass of its corresponding cell converges to µ h . The same is true of the counting measure on vertices of P λ , scaled by the factor λ −1 .
• The maximum over all pairs of embedded vertices z, w ∈ P λ of the quantity |D h (z, w)−D(z, w)| converges to zero.
• The simple random walk on vertices of P λ started from z 0 converges modulo time parameterization to Brownian motion started from 0 and stopped upon hitting ∂D in the quenched sense (i.e., its conditional law given P λ and (X , D, µ) converges).
As we will explain in Section 3.3, Theorem 1.2 is a consequence of Theorem 1.1. Indeed, to prove Theorem 1.2 we just need to show that when λ is large, the Tutte embedding of P λ is close to the image of P λ under the a priori embedding of (X , D, µ) which comes from its identification with (D, D h , µ h ). Due to the manner in which the Tutte embedding is defined, this, in turn, follows from the statement that under the a priori embedding, the random walk on P λ converges to Brownian motion modulo time parameterization, as asserted in Theorem 1.1.
We now briefly outline the proof of Theorem 1.1. We want to show that under the a priori embedding, the random walk on P λ converges to Brownian motion modulo time parameterization. This is a random walk in random environment (RWRE) problem: we have a random walk on P λ -viewed as a random graph drawn in D -and we want to show that it approximates Brownian motion. However, this problem falls outside of the usual RWRE or random conductance model framework (as surveyed, e.g., in [BAF16,Bis11]) because the Euclidean sizes of the Voronoi cells under the a priori embedding vary dramatically from one location to another, so the environment is highly spatially inhomogeneous (see Figure 1) and in particular its law is not stationary with respect to spatial translations.
Nevertheless, as explained in Section 3, if we consider a certain special 8/3-LQG surface called a 0-quantum cone (which does not correspond to one of the "standard" Brownian surfaces) then the associated adjacency graph of Poisson-Voronoi cells is in a certain sense "translation invariant modulo a global rescaling." The paper [GMS18a] gives conditions under which random walk converges to Brownian motion modulo time parameterization in a random environment which is only required to satisfy this weaker form of translation invariance. We re-state the particular theorem from [GMS18a] which we will use as Theorem 2.2 below. Once certain properties of our Voronoi cells have been established, this theorem shows that random walk on the Poisson-Voronoi tessellation of the 0-quantum cone converges to Brownian motion modulo time parameterization.
One can then transfer to other 8/3-LQG surfaces (such as the ones corresponding to the Brownian map, disk, plane, and half-plane) via local absolute continuity considerations.
The key quantitative condition needed to apply the above RWRE theorem is that the quantity diam(H 0 ) 2 deg(H 0 )/ area(H 0 ) has finite expectation, where H 0 is the Voronoi cell containing the origin and diam, deg, and area denote its Euclidean diameter, degree (in the adjacency graph of Voronoi cells), and Lebesgue measure, respectively. In order to verify this condition in our setting, we need to establish a number of estimates for 8/3-LQG metric balls and Voronoi cells which are of independent interest (see Section 4). In particular, we show that a 8/3-LQG metric ball is extremely unlikely to be "long and skinny" in the sense that it typically contains a Euclidean ball of radius comparable to its Euclidean diameter (Proposition 4.4) and that its 8/3-LQG mass is highly concentrated around the fourth power of its 8/3-LQG diameter (Proposition 4.8).
A similar strategy was used in [GMS17] to prove the convergence to LQG of the Tutte embedding of the so-called mated CRT map, a random planar map built by mating a pair of continuum random trees, which has an a priori embedding into C due to the results of [DMS14].

Scaling limit of embedded random planar maps
Suppose {M n } n∈N is a sequence of random planar maps with boundary which converge in law to the Brownian disk (in a sense to be made precise just below). As we will explain in this subsection, Theorem 1.2 implies the convergence to 8/3-LQG of the Tutte embeddings of Poisson-Voronoi tessellations of M n (with a normalized intensity tending to ∞ sufficiently slowly as n → ∞), which we interpret as "coarse grained versions" of the Tutte embedding of M n . (It remains an open problem to prove that the Tutte embedding of M n itself converge to 8/3-LQG.) Let (X , D, µ) be the Brownian disk as above and let ξ be the path which parameterizes ∂X according to the natural length measure on the boundary. We consider a sequence of random planar maps with boundary {M n } n∈N which converge in law in the scaling limit to (X , D, µ, ξ) in the following sense. There are sequences of scaling constants a n , b n , c n → ∞ such that the following is true. View M n as a curve-decorated metric measure space equipped with its graph distance re-scaled by a −1 n , the counting measure on its vertices re-scaled by b −1 n , and the path which traverses its boundary in such a way that it hits c n t edges in t units of time. Then M n converges to (X , D, µ, ξ) in the Gromov-Hausdorff-Prokhorov-uniform (GHPU) topology, i.e., for each > 0 and each large enough n ∈ N there is a coupling of M n and (X , D, µ, ξ) and isometric embeddings of M n and X into a common metric space such that if we identify M n and X with their embeddings, then the following quantities are each at most .
• The Hausdorff distance between X and M n .
• The Prokhorov distance between µ and the re-scaled counting measure on vertices of M n .
• The uniform distance between ξ and the re-scaled boundary path of M n . See Section 2.3 for further background on this topology. The above type of convergence has been established for several types of random planar maps with boundary, including quadrangulations with general boundary [BM17] (see also [GM17c,Theorem 4.1]) and with simple boundary [GM17b].
For λ > 0, let P n,λ be a Poisson point process with intensity measure given by λb −1 n times the counting measure on vertices of M n . For z ∈ P n,λ , let H n,λ z be the Voronoi cell consisting of the set of vertices of M n which are closer (with respect to the graph distance) to z than to any other element of P n,λ . We view P n,λ as a graph whereby two elements of z, w ∈ P n,λ are joined by an edge if there is an element of H n,λ z and an element of H n,λ w which are joined by an edge. We define ∂P n,λ to be the set of vertices of P n,λ whose corresponding cells intersect ∂M n .
We can define the Tutte embedding of P n,λ into D in exactly the same manner as the Tutte embedding of P λ defined just above Theorem 1.2, with a uniform random vertex of M n used in place of z. This gives an "embedding" of M n into D by sending each vertex of M n to the point corresponding to the center of the Voronoi cell which contains it under the Tutte embedding of P n,λ . (If one wants an embedding where the vertices are sent to distinct points, one can slightly perturb their positions). We call this embedding the λ-coarse grained Tutte embedding of M n . As a consequence of Theorem 1.2, we will obtain the following scaling limit result for embedded planar maps.
Theorem 1.3. There is a deterministic sequence λ n → ∞, depending on the laws of {M n } n∈N , and a coupling of {M n } n∈N with the GFF-type distribution h of Theorem 1.2 such that the following is true. If we identify each vertex of M n with its image under the λ n -coarse grained Tutte embedding, then we have the following convergence in probability.
• The counting measure on vertices of M n , re-scaled by b −1 n , converges to µ h .
• If we write D n for the graph distance on M n , re-scaled by a −1 n , then the maximum over all pairs of embedded vertices u, v ∈ M n of the quantity |D h (u, v) − D n (u, v)| converges to zero.
In order to deduce Theorem 1.3 from Theorem 1.2, we will show in Section 3.3 that if {M n } n∈N is coupled together with the Brownian disk (X , D, µ, ξ) in such a way that M n → (X , D, µ, ξ) in the GHPU sense described above, then for each fixed λ > 0, it is a.s. the case that for large enough n ∈ N the adjacency graphs of Voronoi cells P λ and P n,λ are isomorphic. This is a relatively straightforward consequence of the GHPU convergence, but requires some "general position" lemmas for Voronoi cells on X which are proven in Appendix A.
Remark 1.4. The embedding used in Theorem 1.3 depends on additional randomness besides the map M n itself (namely, the Poisson point process P n,λ n ). One may want a scaling limit result for embeddings of M n which are deterministic functions of M n . Our results can be extended to get convergence results for certain embeddings with this property. For example, one can consider an "averaged λ n -coarse-grained Tutte embedding" where we send each vertex to the point in D which is the conditional expectation, given M n , of the vertex's position under the λ n -coarse grained Tutte embedding. One gets an analog of Theorem 1.3 for this embedding since our proof of Theorem 1.3 shows that for any N ∈ N, one has joint convergence to the same Brownian disk for the coarse grained Tutte embeddings of M n defined with respect to N copies of P n,λ n which are conditionally independent given M n . It should also possible to prove analogs of Theorem 1.3 with P n,λ n replaced by a similar point process which is a deterministic function of M n .
This situation stands in contrast to the situation in [GMS17] where the planar map was generated as a coarse-graining of an SLE-decorated LQG surface. In that case, the extra randomness (the space-filling SLE curve or its discrete analog) was highly non-local, and could not be replaced by a deterministic function of the planar map in a natural way.

Outline
The remainder of this article is structured as follows. In Section 2, we will fix some notation, state the scaling limit result from [GMS18a] which is used in the proof of our main results, and recall some facts about metric spaces and 8/3-Liouville quantum gravity surfaces. In Section 3, we prove Theorems 1.1, 1.2, and 1.3 assuming that a certain moment bound for Voronoi cells is satisfied. In Section 4 we will prove the required moment bound, along with a number of estimates for 8/3-LQG metric balls which are intermediate steps.  For z ∈ C and r > 0, we write B r (0) for the open Euclidean ball of radius r centered at z. We write diam(·) and area(·) for Euclidean diameter and Lebesgue measure on C, respectively.
For a metric space (X, d), x ∈ X, and r > 0, we write B r (x; d) for the open d-metric ball of radius r centered at x.
there is a constant C > 0 (independent from and possibly from other parameters of interest) such that f ( ) ≤ Cg( ). We write f ( ) g( ) if f ( ) g( ) and g( ) f ( ).
Let {E } >0 be a one-parameter family of events. We say that E occurs with  We similarly define events which occur with polynomially, superpolynomially, and exponentially high probability as a parameter tends to ∞.
We will often specify any requirements on the dependencies on rates of convergence in O(·) and o(·) errors, implicit constants in , etc., in the statements of lemmas/propositions/theorems, in which case we implicitly require that errors, implicit constants, etc., appearing in the proof satisfy the same dependencies.

Metric on curves modulo time parameterization
Our scaling limit results for random walk on embedded planar maps are with respect to the topology on curves modulo time parameterization, which we now recall. If β 1 : [0, T β 1 ] → C and β 2 : [0, T β 2 ] → C are continuous curves defined on possibly different time intervals, we set (resp. T 2,r ) be the first exit time of β 1 (resp. β 2 ) from the ball B r (0) (or 0 if the curve starts outside B r (0)). We define (2.2) so that d CMP loc (β n , β) → 0 if and only if for Lebesgue a.e. r > 0, β n stopped at its first exit time from B r (0) converges to β stopped at its first exit time from B r (0) with respect to the metric (2.1).
If (X, d, x 0 ) is a general metric space with a marked point, one can similarly define the metric on curves modulo time parameterization on X but with d-distances in place of Euclidean distances and d-metric balls centered at x 0 in place of Euclidean balls centered at 0.

Scaling limit for random walk on graphs of cells
In this subsection we state a version of the main result of [GMS18a] which gives general conditions under which random walk on the adjacency graph of a random collection of cells (e.g., Voronoi cells) on C converges to Brownian motion. This same result is also used in [GMS17] to prove an embedding convergence result for a different discretization of LQG. Let us first describe what we mean by an "adjacency graph of cells".
Definition 2.1. A cell configuration on C consists of the following objects. 1. A locally finite collection H of compact connected subsets of C ("cells") with non-empty interiors whose union is all of C and such that the intersection of any two elements of H has zero Lebesgue measure. We will typically slightly abuse notation by making the relation ∼ implicit, so we write H instead of (H, ∼). We view H as a weighted graph whose vertices are the cells of H and whose edge set is In [GMS18a], one also allows for a conductance function on the edges of H. Here we will only consider cell configurations with unit conductances. We note that the intersections of the cells of H are required to have zero Lebesgue measure. We will check this condition for Voronoi cells in Lemma A.6 below.
We define a metric on the space of cell configurations by where each of the infima is over all homeomorphisms f r : C → C such that f r takes each cell in H which intersects B r (0) to a cell in H which intersects B r (0) and preserves the adjacency relation between these cells, and f −1 r does the same with H and H reversed. In [GMS18a], we proved that the simple random walk on a random cell configuration H which satisfies the following hypotheses converges to Brownian motion. Here, for C > 0 and z ∈ C we write C(H − z) for the cell configuration obtained by translating all of the cells by −z then scaling all of the cells by C.
1. Translation invariance modulo scaling. There is a (possibly random and H-dependent) increasing sequence of open sets U j ⊂ C, each of which is either a square or a disk, whose union is all of C such that the following is true. Conditional on H and U j , let z j for j ∈ N be sampled uniformly from Lebesgue measure on U j . Then the shifted cell configurations H − z j converge in law to H modulo scaling as j → ∞, i.e., there are random numbers C j > 0 (possibly depending on H and z j ) such that C j (H − z j ) → H in law with respect to the metric (2.4).
where diam, area, and deg denote Euclidean diameter, Lebesgue measure, and vertex degree in H, respectively.
4. Connectedness along lines. Almost surely, for each horizontal or vertical line segment L ⊂ C, the subgraph of H induced by the set of cells which intersect L is connected.
The combination of hypotheses 1 and 2 is referred to as ergodicity modulo scaling in [GMS18a]. Several equivalent formulations of hypothesis 1 are given in [GMS18a, Definition 1.2] (we will use a different formulation, in terms of a "mass transport principle" in Section 3.4). The version of hypothesis 3 given here is slightly simpler than the version in [GMS18a] since we are assuming unit conductances. Hypothesis 4 is automatically satisfied if any two cells which intersect are considered to be adjacent. This will always be the case for cell configurations considered in this paper. The following is [GMS18a, Theorem 3.10].
Theorem 2.2 ( [GMS18a]). Let H be a random cell configuration satisfying the above four hypotheses.
For z ∈ C, let Y z denote the simple random walk on H started from H z (with conductances c). For j ∈ N 0 , let Y z j be an arbitrarily chosen point of the cell Y z j and extend Y z from N 0 to [0, ∞) by piecewise linear interpolation. There is a deterministic covariance matrix Σ with det Σ = 0 such that the following is true. For each fixed compact set A ⊂ C, it is a.s. the case that as → 0, the maximum over all z ∈ A of the Prokhorov distance between the conditional law of Y z/ given H and the law of Brownian motion started from z with covariance matrix Σ, with respect to the topology on curves modulo time parameterization (as defined in Section 2.1.2), tends to 0.

Metric spaces
Let (X, d) be a metric space. For a curve γ : [a, b] → X, the d-length of γ is defined by where the supremum is over all partitions P : a = t 0 < · · · < t #P = b of [a, b]. Note that the d-length of a curve may be infinite. A d-geodesic between two points x, y ∈ X is a path from x to y of minimal d-length.
A metric space (X, d) is called a length space if for each z, w ∈ X, the distance d(z, w) is the infimum of the d-lengths of paths joining z and w. For example, a domain in C equipped with the 8/3-LQG metric induced by a GFF-type distribution is a length space (see Section 2.5).
The vertex set of a finite graph G equipped with the graph distance is not a length space since a continuous path in a finite set is just a single point. However, we can make G into a length space by identifying each edge of G with an isometric copy of the unit interval and replacing G with the union of these edges (i.e., we consider the so-called "metric graph" associated with G). In the proof of Theorem 1.3, we will use the following elementary fact about length spaces.
Lemma 2.3. Let (W, d) be a metric space and let {X n } n∈N and X be compact subspaces of W such that X n → X with respect to the d-Hausdorff distance. Let γ : [0, 1] → X be a curve. If each of the metric spaces (X n , d| Xn ) is a length space, then there is a sequence of curves γ n : [0, 1] → X n such that γ n → γ with respect to the d-uniform distance.
Proof. For > 0, choose points 0 = t 0, < t 1, < · · · < t N , = 1 such that For each n ∈ N, we can find points x n j, for j = 0, . . . , N ∈ X n such that x n j, → γ(t j, ). This means in particular that d(x n j−1, , x n j, ) → d(γ(t), γ(t j, )) for each j = 1, . . . , N . Since each (X n , d) is a length space, we can find for each j = 1, . . . , N a path γ n j, in X n from x n j−1, to x n j, with d-length at most d(x n j−1, , x n j, ) + . Let γ n : [0, 1] → X n be the concatenation of the curves γ n j, , parameterized so that it traverses γ n j, during the time interval [t j−1, , t j, ]. Then for large enough n, the d-uniform distance between γ n j, and γ is at most 3 . We now conclude by choosing a sequence n → 0 sufficiently slowly and setting γ n := γ n n .
To formulate Theorem 1.3, we considered a generalization of the Gromov-Hausdorff topology for metric spaces decorated by a measure and a curve called the Gromov-Hausdorff-Prokhorov-uniform (GHPU) topology, which was introduced in [GM17c]. We now briefly review its definition.
For a metric space (X, d), we let C 0 (R, X) be the space of continuous curves η : R → X which are "constant at ∞," i.e. η extends continuously to the extended real line [−∞, ∞]. Each curve η : [a, b] → X can be viewed as an element of C 0 (R, X) by defining η(t) = η(a) for t < a respectively, for the d-Hausdorff metric on compact subsets of X, the d-Prokhorov metric on finite measures on X, and the d-uniform metric on C 0 (R, X).
The GHPU topology comes from a metric on the space M GHPU of 4-tuples X = (X, d, µ, ξ) where (X, d) is a compact metric space, µ is a finite Borel measure on X, and ξ ∈ C 0 (R, X).
Given elements X 1 = (X 1 , d 1 , µ 1 , ξ 1 ) and X 2 = (X 2 , d 2 , µ 2 , ξ 2 ) of M GHPU , we define their Gromov-Hausdorff-Prokhorov-Uniform (GHPU) distance d GHPU (X 1 , X 2 ) to be the infimum over all compact metric spaces (W, d) and isometric embeddings ι 1 : (X 1 , d 1 ) → (W, d) and ι 2 : (2.7) A graph equipped with its graph distance, a measure on its vertices, and a path of edges can be viewed as an element of M GHPU by identifying each edge with an isometric copy of the unit interval (in the manner discussed above).
It is shown in [GM17c, Proposition 1.3] that d GHPU defines a complete separable metric on M GHPU provided we identify two elements of M GHPU which differ by a measure-and curvepreserving isometry. Furthermore, it is shown in [GM17c, Proposition 1.5] that GHPU convergence is equivalent to convergence of curve-decorated metric measure spaces which are all embedded into a common space, in the following sense. GM17c]). Let X n = (X n , d n , µ n , ξ n ) for n ∈ N and X = (X, d, µ, ξ) be elements of M GHPU . Then X n → X in the GHPU topology if and only if there exists a compact metric space (W, d) and isometric embeddings (X n , d n ) → (W, d) for n ∈ N and (X, d) → (W, d) such that the following is true. If we identify X n and X with their embeddings into W , then X n → X w.r.t. the d-Hausdorff metric, µ n → µ w.r.t. the d-Prokhorov metric, and ξ n → ξ w.r.t. the D-uniform metric.

Liouville quantum gravity surfaces
Fix γ ∈ (0, 2) (in fact, we will always take γ = 8/3). For k ∈ N 0 , a γ-Liouville quantum gravity surface with k marked points is an equivalence class of (k is an open domain, h is a distribution on U (which we will always take to be a realization of some variant of the GFF on U ), and z 1 , . . . , z k ∈ U ∪ ∂U . Two such (k + 2)-tuples (U, h, z 1 , . . . , z k ) and ( U , h, z 1 , . . . , z k ) are declared to be equivalent if there is a conformal map φ : U → U such that (2.8) We think of two equivalent (k + 2)-tuples as above as corresponding to different parameterizations of the same surface. We refer to the distribution h corresponding to an LQG surface as the embedding of the surface. The above definitions first appeared in [DS11], and also play an important role, e.g., in [She16,DMS14]. If the law of the field h is locally absolutely continuous with respect to the law of the Gaussian free field on U , then we can define the γ-LQG area measure µ h on U , which is the a.s. limit of regularized versions of e γh(z) dz as well as the γ-LQG boundary length measure ν h on ∂U (in the case when U has a boundary). There are several equivalent ways to construct these measures: see, e.g., [Kah85,DS11,RV14]. By [DS11, Proposition 2.1], if h and h are related by a conformal map as in (2.8), then This means that µ h and ν h can be viewed as measures on the LQG surface.
In the special case when γ = 8/3, an LQG surface also admits a metric D h , as shown in [MS15b,MS16a,MS16b], and this metric is compatible with coordinate changes of the form (2.8). We will review the basic properties of this metric in Section 2.5.

Quantum cones
The LQG surface which we will work with must frequently is the α-quantum cone for α ∈ (−∞, Q), which is defined in [DMS14,Definition 4.10]. The α-quantum cone is a doubly marked surface (C, h, 0, ∞) whose γ-LQG measure µ h has infinite total mass, but assigns finite mass to every bounded subset of C. One way to obtain an α-quantum cone is to start with a whole-plane GFF plus α log(1/| · |) then "zoom in" near the origin and re-scale (i.e., add a constant to the field) so that the LQG area of a fixed set remains of constant order. See [DMS14, Proposition 4.13(i)] for a precise statement.
Quantum cones with parameter α ∈ {0, 8/3} are especially natural, and these will be the main types of quantum cones which we will consider. The case α = 8/3 is special since a GFF a.s. has a − 8/3-log singularity at a point sampled from its 8/3-LQG measure [DS11, Section 3.3], so this surface can be thought of as describing the behavior of a general 8/3-LQG surface near such a point. Moreover, the 8/3-quantum cone, equipped with its 8/3-LQG metric and area measure, is equivalent to the Brownian plane as defined in [CL14] (see Section 2.5). In a similar vein, the 0-quantum cone describes the local behavior of a 8/3-LQG surface near a Lebesgue typical point. The 0-quantum cone can be used to construct cell configurations which satisfy the translation invariance modulo scaling condition of Theorem 2.2, which says that the origin is in some sense "Lebesgue typical".
We will need some properties of quantum cones which follow from the definition in [DMS14, Definition 4.10], so we now recall this definition. Let α < Q and let A : R → R be the process for all t > 0 and taken to be independent of B. We define h to be the random distribution such that if h r (0) denotes the average of h on ∂B r (0) (see [DS11,Section 3.1] for the definition and basic properties of the circle average), then t → h e −t (0) has the same law as the process A; and h − h |·| (0) is independent from h |·| (0) and has the same law as the analogous process for a whole-plane GFF. Since a quantum cone has only two marked points, one can get a different choice of h corresponding to the same LQG surface (i.e., a different embedding of the quantum cone) by re-scaling space and applying the LQG coordinate change formula (2.8). We will almost always consider the particular choice of distribution h defined just above. This choice of h is called the circle average embedding, and is characterized by the fact that 1 = sup{r > 0 : h r (0) + Q log r = 0}. If h is the circle-average embedding of an α-quantum cone, then h| D agrees in law with the corresponding restriction of a whole-plane GFF plus −α log | · |, normalized so that its average over ∂D is 0.
The α-quantum cone possesses a certain special scale invariance property, which we now describe.
Let α < Q, let h be the circle-average embedding of an α-quantum cone, and let {h r (z) : r > 0, z ∈ C} be its circle average process. We define where here Q is as in (2.8). That is, R b gives the largest radius r > 0 so that if we scale spatially by the factor r and apply the change of coordinates formula (2.8), then the average of the resulting field on ∂D is equal to 1 √ (2.10) It is immediate from the definitions of µ h and the 8/3-LQG metric D h that adding 1 √ to the field scales 8/3-LQG areas by b and 8/3-LQG distances by b 1/4 (in the case of the metric, see [MS16a, Lemma 2.2] or Lemma 2.5 below). By the 8/3-LQG coordinate change formulas for µ h and D h , we therefore see that (2.10) implies that where here we mean equality in law as metric measure spaces. We note that the property (2.11) is not true with, say, a whole-plane GFF in place of a quantum cone. This property is a major reason for considering quantum cones.
We will also have occasion to consider other special quantum surfaces besides just quantum cones. We will not need as many properties of these, so we just briefly mention their definitions and refer to the cited references for more details.
A quantum disk is a quantum surface (D, h) defined in [DMS14,Definition 4.21] which behaves locally like a free-boundary GFF on D, but is defined in a slightly different way. Its 8/3-LQG area measure and boundary length measure each have finite total mass, and one can consider quantum disks with specified boundary length (and random area) or with specified boundary length and area. One can also define a quantum disk with any number of marked boundary points and interior points sampled uniformly from its 8/3-LQG boundary length and area measures, respectively. A quantum sphere is a quantum surface (C, h) introduced in [DMS14, Definition 4.21] with µ h (C) < ∞. Typically one considers a unit-area quantum sphere, which means we fix µ h (C) = 1. Quantum spheres with other areas are obtained by re-scaling (equivalently, adding a constant to h). As in the case of the quantum disk, one can consider quantum spheres with one or more marked points sampled uniformly from the 8/3-LQG area measure.
For α ≤ Q, an α-quantum wedge is a quantum surface (H, h, 0, ∞) defined in [DMS14, Definition 4.5] which has finite mass in every neighborhood of 0 but infinite total mass. It is the half-plane analog of the α-quantum cone considered above and satisfies the same scaling property (2.11) as the α-quantum cone.

The 8/3-Liouville quantum gravity metric
Suppose that U ⊂ C is a connected open set and h is a random distribution on U which is locally absolutely continuous with respect to the GFF on U , in the sense that for every z ∈ U , there is a neighborhood V of z such that the law of h| V is absolutely continuous with respect to the corresponding restriction of the GFF. The papers [MS15b,MS16a,MS16b] show that one can define a 8/3-LQG metric D h associated with h. We will not need the precise definition of this metric here. Rather, we will only use a small number of basic properties of D h , which we now record.
1. Bi-Hölder with respect to Euclidean metric. The identity map from U , equipped with the Euclidean metric, to (U, D h ) and its inverse are each a.s. locally Hölder continuous with a (non-explicit) Hölder exponent. In particular, D h induces the same topology on U as the Euclidean metric.
2. Existence of geodesics. Almost surely, for any z, w ∈ U with D h (z, w) < D h (z, ∂U ) there is a D h -geodesic from z to w, i.e., a path from z to w of minimal D h -length. If the law of h is absolutely continuous with respect to that of a free-boundary GFF in a neighborhood of every point of ∂U , then D h extends to a metric on U and a.s. for each z, w ∈ U , there is a D h -geodesic in U from z to w.
3. LQG coordinate change formula. If U, U ⊂ C and φ : U → U is a conformal map, then In particular, metric balls are locally determined by h. We will also use the fact that certain special LQG surfaces (U, h) are equivalent to Brownian surfaces, in the sense that the metric measure space (U , D h , µ h ) agrees in law with a Brownian surface. 3 See [MS16a, Corollary 1.5] for the sphere, disk, and plane cases and [GM17c, Proposition 1.10] for the half-plane case.
• The quantum sphere is equivalent to the Brownian map.
• The quantum disk is equivalent to the Brownian disk.
• The 8/3-quantum cone is equivalent to the Brownian plane.
• The 8/3-quantum wedge is equivalent to the Brownian half-plane.
We will now explain another elementary property of D h which allows us to define D h+f whenever f : U → R is a random continuous function coupled with h, even if the law of h + f is not locally absolutely continuous with respect to the GFF.
Lemma 2.5. Suppose h is a random distribution on a connected open set U ⊂ C and let f : U → R be a random continuous function (not necessarily independent from h). If the laws of h and h + f are both locally absolutely continuous with respect to the GFF on U , then In fact, it is a.s. the case that for each z, w ∈ U , where the infimum is over all simple paths from z to w parameterized by their D h -length.
Proof. If f ≡ c is constant, then by [MS16a, Lemma 2.2], one has D h+f = e c/ √ 6 D h . In fact, the proof of [MS16a, Lemma 2.2] shows that a.s. (2.13) holds. We will now deduce (2.14) from (2.13). To this end, fix > 0. Since f is continuous, we can find a (possibly random) δ > 0 such that Now fix z, w ∈ U and let γ : [0, T ] → U be a path from z to w whose D h+f -length is at most D h+f (z, w) + . Choose finitely many times 0 = t 0 < t 1 < · · · < t n = T such that and our choice of δ, we have (in the notation (2.6)) exp This shows that the D h -length of γ is finite and, if γ is parameterized by D h -length, that the D h+f -length of γ and the integral 6 dt differ by a factor of at most e / √ 6 . Sending → 0 shows that D h+f (z, w) is at least the right side of (2.14). We similarly get the reverse inequality.
Let h be a random distribution on a connected open set U ⊂ C and f : U → R be a random continuous function (not necessarily independent from h). If D h is defined, we define D h+f by the formula (2.14). We need to make sure that D h+f is well-defined (i.e., we get the same metric if we make a different choice of h and f with h + f = h + f ) and that it is a measurable function of h + f (a priori we only know that D h+f is a measurable function of (h, f )). The following lemma is an easy consequence of Lemma 2.5. We will give the proof just below.
Lemma 2.6. In the setting described just above, D h+f is a.s. well-defined and determined by h + f .
Once Lemma 2.6 is established, it follows from the above properties of D h that D h+f is locally bi-Hölder continuous with respect to the Euclidean metric in the sense of property 1 above (so induces the same topology on U as the Euclidean metric) and satisfies the LQG coordinate change formula (2.8) and the locality property 4.
Proof of Lemma 2.6. For a length metric D on U and a continuous function f : U → R, write e f / √ 6 ·D for the metric defined by the formula (2.14) with D in place of D h . From the definition (2.14), one immediately gets the following additivity property: for every metric D on U which induces the Euclidean topology and any two continuous functions f, g : U → R, (2.15) Indeed, this follows since the two metrics in (2.15) induce the same length measure on each path in U . Suppose now that we are given two couplings (h, f ) and (h , f ) of a distribution whose law is locally absolutely continuous w.r.t. the GFF and a random continuous function such that are conditionally independent given h + f . By (2.15) applied to the functions f and f − f together with Lemma 2.5 applied to the distributions h and h = h + f − f , we get that a.s. (2.16) (3.1) Extending the notation above, for w ∈ D we write H λ h,w for the (a.s. unique for w deterministic, by Lemma A.6 just below) Voronoi cell which contains w. We define We will often omit the subscript h and/or the superscript λ when these objects are clear from the context. In this subsection, we will prove all of our main results conditional on the following proposition.
Define the Voronoi cell configuration H = H 1 h as above with λ = 1 and let H 0 be the cell which contains the origin. Then where here deg(H 0 ) denotes the degree of H 0 as a vertex of H.
Proposition 3.1 is used in Section 3.1 to check the finite expectation hypotheses of Theorem 2.2 for the Voronoi cell configuration associated with 0-quantum cone. The proof of Proposition 3.1 is given in Section 4. This proof is the most difficult step in the proofs of our main results, and requires us to establish several estimates for 8/3-LQG metric balls which are of independent interest.
The rest of this section is structured as follows. In Section 3.1, we explain why Proposition 3.1 together with Theorem 2.2 implies a scaling limit result for random walk on the adjacency graph of Voronoi cells associated with a 0-quantum cone. In Section 3.2, we transfer this result to random walk on Voronoi cells on other types of 8/3-LQG surfaces (including the ones corresponding to the Brownian map, disk, plane, and half-plane) using local absolute continuity and thereby prove Theorem 1.1. In Section 3.3, we deduce Theorems 1.2 and 1.3 from our scaling limit result for random walk. The arguments in these three subsections are similar to the analogous arguments in [GMS17, Section 3]. In Section 3.4, we give a re-formulation of Proposition 3.1 which involves bounds for 8/3-LQG metric balls instead of Voronoi cells, and which turns out to be easier to prove than Proposition 3.1 itself.
Throughout this section, we will use several elementary properties of Voronoi cells whose proofs are collected in Appendix A to avoid interrupting the main argument.
3.1 Cell configuration corresponding to a 0-quantum cone Let (C, h, 0, ∞) be a 0-quantum cone and write P = P 1 h and H = H 1 h for its associated Poisson point process and collection of Voronoi cells with λ = 1.
Proposition 3.2. The conclusion of Theorem 2.2 holds for the cell configuration H above. Moreover, the covariance matrix Σ of the limiting Brownian motion is a positive scalar multiple of the identity matrix.
Proof. By Lemma A.4, the cells of H are a.s. compact with non-empty interior and H is locally finite. By Lemma A.6, a.s. the intersection of any two cells of H has zero Lebesgue measure, and by definition any two cells which are adjacent in H intersect. Therefore H satisfies the conditions of Definition 2.1. We will now check the conditions of Theorem 2.2.
Translation invariance modulo scaling. For j ∈ N, let R j be the largest r > 0 for which where h r (0) denotes the circle average, as in (2.9). We will check the needed resampling property for U j = B R j (0). By (2.10), the field h j := h(R j ·) + Q log R j − γ −1 log j agrees in law with h. In particular, by the discussion just after [DMS14, Definition 4.10], h j | D agrees in law with the corresponding restriction of a whole-plane GFF, normalized so that its circle average over ∂D is 0. Consequently, if we sample z j uniformly from Lebesgue measure on B R j (0), then the proof of [DMS14, Proposition 4.13(ii)] along with the translation invariance of the law of the whole-plane GFF, modulo additive constant, shows that the there is a sequence of random constants C j → ∞ such that the law of h(C j (· − z j )) + Q log C j , restricted to any compact subset K ⊂ C, converges to the law of h| K in the total variation sense as j → ∞. By the LQG coordinate change formula, this implies that the joint law of Ergodicity modulo scaling. It is easily checked that R>0 σ h| C\B R (0) is the trivial σ-algebra (see, e.g., [HS16, Lemma 2.2] for the case of the whole-plane GFF; the case of h can be treated in an identical manner due to [DMS14, Definition 4.10]). From this, it follows that also the intersection over all R > 0 of the σ-algebra generated by h| C\B R (0) and the set of points of P which are contained To deduce condition 2 from this, consider a real-valued function F = F (H) satisfying F (C(H − z)) = F (H) for each C > 0 and z ∈ C. If F is determined by H(B R (0)) for any R > 0, then F is equal to a deterministic constant a.s. since F = F (B R (0)−z) for every z ∈ C so F is measurable with respect to the σ-algebra R>0 σ(H(B R (0))). In general, the conditional law of F given H(B R (0)) must be deterministic by the preceding sentence, so F is independent from H(B R (0)), whence the above claim implies that F is equal to a deterministic constant a.s.
Finite expectation. This is the content of Proposition 3.1, which will be proven in Section 4.

Connectedness along lines. This follows since by definition two cells of H are connected by an edge of EH if and only if they intersect and the collection of cells is locally finite.
The covariance matrix Σ is a scalar multiple of the identity since the law of h, and therefore the law of H, is invariant under rotations around the origin.

Random walk on cells converges to Brownian motion
The following theorem is a generalization of Theorem 1.1 (recall the correspondence between Brownian and 8/3-LQG surfaces as described in Section 2.5).
Theorem 3.3. Suppose that we are in one of the following situations.
• D = D and (D, h) is a quantum disk with fixed boundary length or fixed boundary length and area.
For z ∈ D and λ > 0, let Y z,λ be the simple random walk on the adjacency graph of the Voronoi cell configuration H λ h . Let Y z,λ be the image of Y z,λ under the map which sends each Voronoi cell to its center point and extend Y z,λ to a function from [0, ∞) to D by piecewise linear interpolation at constant speed.
For each deterministic compact set K ⊂ D, the supremum over all z ∈ K of the Prokhorov distance between the conditional law of Y z,λ given (h, P λ h ) and the law of a standard two-dimensional Brownian motion started from z (and stopped when it hits the boundary in the case of a quantum wedge or quantum disk), with respect to the metric on curves viewed modulo time parameterization (i.e., the metric (2.1) in the disk or half-plane case or the metric (2.2) in sphere or whole-plane case) converges to 0 in probability as λ → ∞.
We note that in Theorem 3.3, the walk is extended by piecewise linear interpolation whereas in Theorem 1.1 it follows D-geodesics between the points of P λ . This does not affect the conclusion of the theorem: indeed, by Lemma A.3 and the fact that D h induces the Euclidean topology, for any fixed compact set K ⊂ D, the maximum over all adjacent pairs of vertices z, w ∈ P λ h ∩ K of the Euclidean diameter of every D h -geodesic from z to w tends to zero in law as λ → ∞. The same is true with D h -diameters in place of Euclidean diameters and/or line segments in place of D h -geodesics.
We first prove Theorem 3.3 in the case of the 0-quantum cone, using Proposition 3.2. This is the step in the proof where we go from a.s. converges to convergence in probability.
Lemma 3.4. Theorem 3.3 is true with a 0-quantum cone in place of a γ-quantum cone.
Proof. By Brownian scaling the statement of the lemma is invariant under the operation of changing the embedding h (i.e., replacing h by h(r·) + Q log r for some possibly random r > 0), so we can assume without loss of generality that h has the circle-average embedding, as described in Section 2.4 and [DMS14, Definition 4.10] (we could also, e.g., embed so that µ h (D) = 1).
Proposition 3.2 together with Theorem 2.2 tells us that a.s. the conditional law given H 1 h of the random walk on H 1 h converges in law as → 0 to standard two-dimensional Brownian motion modulo time parameterization, and the convergence is uniform over all starting points in any fixed compact subset of C.
log b, so that by (2.10), h b is a Poisson point process with intensity measure µ h b , then R −1 b P 1 h b is a Poisson point process with intensity measure bµ h . Therefore, for λ > 0, Since R λ → ∞ as λ → ∞, we now get the desired convergence in probability from Proposition 3.2 and Theorem 2.2.
Using local absolute continuity, we can now transfer to other quantum surfaces, starting with the case of quantum cones.
Lemma 3.5. Theorem 3.3 is true in the case of the α-quantum cone for α < Q.
Proof. As in the proof of Lemma 3.4, we work with the circle-average embedding of the α-quantum cone, which has the property that h| D agrees in law with the corresponding restriction of a wholeplane GFF plus −α log | · |, normalized so that its circle average over ∂D is 0. We also let h be the circle-average embedding of a 0-quantum cone in (C, 0, ∞), so that h| D The statement of the lemma is essentially a consequence of Lemma 3.4 and local absolute continuity (in the form of [MS16c, Proposition 3.4]), but a little care is needed since we only have local absolute continuity between the laws of a h and h on domains at positive distance from 0 (due to the α-log singularity of h) and from ∂D (due to our choice of embedding). Throughout the proof, the Prokhorov distance is always taken with respect to the metric on curves viewed modulo time parameterization.
For ρ > 0 and z ∈ B ρ (0), let J z,λ ρ for n ∈ N be the exit time from B ρ (0) of the embedded walk Y z,λ on H λ h . Also let B z be a standard two-dimensional Brownian motion started from z and let τ z ρ be its exit time from B ρ (0). We need to show that for each ρ > 0, the supremum over all z ∈ B ρ (0) of the Prokhorov distance between the conditional laws of Y z,n | [0,J z,n ρ ] and B z | [0,τ z ρ ] given h, P λ h converges to zero in probability as λ → ∞.
We first consider a radius ρ ∈ (0, 1) and deal with the log singularity at 0. For δ ∈ (0, ρ), choose ζ = ζ(δ) ∈ (0, δ) such that the probability that a Brownian motion started from any point of D \ B δ (0) hits B ζ (0) before leaving D is at most δ. By Lemma 3.4 and local absolute continuity it holds with probability tending to 1 as λ → ∞ that for each z ∈ B ρ (0) \ B δ (0), the Prokhorov distance between the conditional laws of Y z,λ | [0,J z,λ ρ ] and B z | [0,τ z ρ ] given h is at most δ. Since the law of B z | [0,τ z ρ ] depends continuously on z, the Prokhorov-distance diameter of the set of laws of the curves B z | [0,τ z ρ ] for z ∈ B δ (0) tends to 0 as δ → 0. By the last two sentences of the preceding paragraph and the strong Markov property of Y z,λ and of B z , it holds with probability tending to 1 as λ → ∞ that for each z ∈ B δ (0), the Prokhorov distance between the conditional laws of Y z,λ | [J z,λ δ ,J z,λ ρ ] and B z | [0,τ z ρ ] given (h, P λ h ) is o δ (1), at a deterministic rate depending only on ρ. The distance between the curves Y z,λ | [J z,λ δ ,J z,λ ρ ] and Y z,λ | [0,J z,λ ρ ] , viewed modulo time parameterization, is at most 2δ. Sending δ → 0 now gives the theorem statement in the case ρ < 1.
The case when ρ ≥ 1 follows from the case when ρ ∈ (0, 1) and the scale invariance property of the α-quantum cone [DMS14, Proposition 4.13(i)], applied similarly as in Proposition 3.2.
Lemma 3.6. Theorem 3.3 is true in the case of the quantum sphere.
Proof. This is immediate from Lemma 3.5 and local absolute continuity.
Lemma 3.7. Theorem 3.3 is true in the case of the quantum disk.
Proof. Let (C, h, 0, ∞) be a doubly marked quantum sphere conditioned on the event that the D h -distance from 0 to ∞ is at least 1 and let U be the connected component of C \ B 1 (∞; D h ) which contains 0. Then the conditional law of the quantum surface (U, h| U , 0) given ν h (∂U ) is that of a quantum disk with one marked point in its interior, with given boundary length (this follows, e.g., from the construction of D h using QLE in [MS15b]).
If we let P λ h be a Poisson point process with intensity measure λµ h , then P λ h ∩ U is a Poisson point process on U with intensity measure λµ h| U . Let H λ h| U be the configuration of Voronoi cells defined using the set of points P λ h ∩ U and the metric D h| U . Then each cell of H λ h|U which does not intersect ∂U is identical to the corresponding cell of H λ h with the same center point. It therefore follows from Lemma 3.6 that the maximum over all z ∈ U of Prokhorov distance between the following two laws, with respect to the topology on curves viewed modulo time parameterization, tends to 0 as λ → ∞: • The conditional law given (h, H λ h ) of the random walk on H λ h| U stopped upon hitting a cell which intersects ∂U , embedded into U and linearly interpolated as in Theorem 3.3.
• The law of Brownian motion a started from 0 and stopped upon hitting ∂U .
By the conformal invariance of Brownian motion and the first paragraph, this gives the statement of the lemma for the quantum disk with random boundary length ν h (∂U ). By scale invariance, this implies the statement of Theorem 3.3 for a doubly marked quantum disk with any fixed boundary length. By conditioning on the area of such a quantum disk, we also get the statement for a quantum disk with fixed area and boundary length.
Proof of Theorem 3.3. Lemmas 3.5, 3.6, and 3.7 give the theorem statement in the quantum cone, quantum sphere, and quantum disk cases, respectively. The case of the quantum wedge follows from the case of the quantum disk and the same argument as in the proof of Lemma 3.5.

Proof of Tutte embedding convergence results
Proof of Theorem 1.2. Let (D, h, 0, 1) be a quantum disk with fixed boundary length and area, with one marked boundary point and one marked interior point. Let D h and µ h be the 8/3-LQG metric and area measure and let ξ h be the path which traverses ∂D counterclockwise from 1 to 1 in such a way that it traverses one unit of 8/3-LQG length in one unit of time. By [MS16a, Corollary 1.5], we know that the curve-decorated metric measure space (D, D h , µ h , ξ h ) is a Brownian disk with unit area and boundary length. Furthermore, by the definition of a marked quantum disk, if we condition on this curve-decorated metric measure space then the marked point 0 is a uniform sample from µ h .
For λ > 0, define the Poisson point process P λ , the Voronoi tessellation H λ , and the Tutte embedding Φ λ : P λ → D as in the discussion just above Theorem 1.2 for the Brownian disk (X , D, µ, ξ) = (D, D h , µ h , ξ h ). Note that here the space X is identified with D, so in particular P λ ⊂ D.
(3.5) Indeed, Theorem 3.3 implies that the maximum over all vertices z ∈ P λ h of the Prokhorov distance between the Euclidean harmonic measure on ∂D as viewed from z and the P λ -harmonic measure on ∂P λ as viewed from z tends to zero in probability as n → ∞. From this and the definition of Φ λ , we get (3.5).
The first two convergence statements in the theorem statement are immediate from (3.5) (for the convergence of re-scaled counting measure, we use that λ −1 times the counting measure on P λ converges in probability to µ h since the intensity measure of P λ is λµ h ). The convergence statement for the random walk on P λ follows from (3.5) and Theorem 3.3.
To extract Theorem 1.3 from Theorem 1.2, we will argue that the GHPU convergence (Section 2.3) of M n to the Brownian disk implies that for each fixed choice of λ > 0, the laws of their corresponding adjacency graphs of Voronoi cells converge in the total variation sense. We assume for concreteness that our Brownian disk X has fixed area A > 0 and boundary length L > 0.
Throughout the proof, we identify each edge of M n with a line segment of unit length, so that M n is a connected metric space and the restriction of the distance on M n to the vertices is the same as the graph distance. Let D n be the metric on M n , re-scaled by a −1 n . Let µ n be the counting measure on vertices of M n , re-scaled by b −1 n . Let ξ n be the path which traverses ∂M n , parameterized so that it traverses c n t units of edge-length in t units of time and so that ξ n (0) is a uniform random vertex of ∂M n . By possibly multiplying b n by a random variable which converges to 1 in law, we can assume without loss of generality that µ n has total mass A for each n ∈ N.
We note that with the above identification, the D n -Voronoi cell corresponding to a vertex z ∈ P n,λ consists of the union of the vertices of M n which are D n -closer to w than to any other vertex of P n,λ ; the edges joining two such vertices; and the half-edges joining one such vertex to a vertex not in the cell. By the definition of Voronoi cells, this implies that z, w ∈ P n,λ are joined by an edge in P n,λ if and only if ∃u ∈ M n such that D n (u, z) = D n (u, w) and D n (u, x) ≤ D n (u, w), ∀x ∈ P n,λ \ {z, w}. (3.6) Note that u in (3.6) will always be the midpoint of an edge joining a vertex of the cell corresponding to z to a vertex of the cell corresponding to w. By our hypothesis on the convergence of M n to the Brownian disk and the Skorokhod representation theorem, we can couple {M n } n∈N with the Brownian disk (X , D, µ, ξ) in such a way that a.s. (M n , D n , µ n , ξ n ) → (X , D, µ, ξ) with respect to the GHPU topology. By Proposition 2.4, we can find a compact metric space (W, d) and isometric embeddings X → W and M n → W for n ∈ N such that the following is true. If we identify X and M n with their images under these embeddings, then a.s. M n → X with respect to the d-Hausdorff distance, µ n → µ with respect to the d-Prokhorov distance, and ξ n → ξ with respect to the d-uniform distance. Henceforth fix such a coupling and such a metric space (W, d).
We now couple the Poisson point processes P λ and P n,λ in the following way. Conditional on everything else, let N ∼ Poisson(λA). Since µ n → µ a.s. in the d-Prokhorov topology, we can add to our coupling sequences (z 1 , . . . , z N ) and (z n 1 , . . . , z n N ) for n ∈ N such that conditional on X and N , (z 1 , . . . , z N ) is a sample of N i.i.d. points from µ; conditional on M n and N , (z n 1 , . . . , z n N ) is a sample of N i.i.d. points from µ n ; and a.s. z n j → z j w.r.t. d for each j = 1, . . . , N . We set P λ = {z 1 , . . . , z N } and P n,λ := {z n 1 , . . . , z n N }.
Lemma 3.8. In the setting just above, it is a.s. the case that for each large enough n ∈ N, the map z n i → z i for i = 1, . . . , N is a graph isomorphism from P n,λ to P λ .
Proof. Since N < ∞, it suffices to show that if i, j ∈ [1, N ] Z , i = j, then z i and z j are joined by an edge in P λ if and only if z n i and z n j are joined by an edge in P n,λ for large enough n ∈ N.
First suppose that z n i and z n j are joined by an edge in P n,λ for all large enough n ∈ N.
By (3.6), for each such n, we find u n ∈ M n with D n (u n , z n i ) = D n (u n , z n j ) ≥ D n (u n , z n k ) for each k ∈ [1, N ] Z \ {i, j}. Since (W, d) is compact, by possibly passing to a subsequence we can arrange that u n → u ∈ X . Then D(u, z i ) = D(u, z j ) ≥ D(u, z k ) for each k ∈ [1, N ] Z \ {i, j}, which implies that z i and z j are joined by an edge in P λ .
Conversely, suppose z i and z j are joined by an edge in P λ . By Lemma A.8 (and the equivalence of the Brownian disk and the quantum disk) a.s. there is a curve γ : [0, 1] → X from z i to z j in X with D(γ(t), z k ) > D(γ(t), {z i , z j }) for each k ∈ [1, N ] Z \ {i, j} and t ∈ [0, 1]. By Lemma 2.3, in this case there is a.s. a sequence of curves γ n : [0, 1] → M n which converge d-uniformly to γ. The proof of Lemma 2.3 shows that in fact one can take the endpoints of γ n to be z n i and z n j . Since z n i → z i for each i = 1, . . . , N , a.s. for large enough n ∈ N it holds that D n (γ n (t), z n for each t ∈ [0, 1] and k ∈ [1, N ] Z \ {i, j}. Since γ n is a path from z n i to z n j , there exists t n ∈ [0, 1] for which D n (γ n (t n ), z n i ) = D n (γ n (t n ), z n j ). This implies that z n i and z n j are joined by an edge in P n,λ .
Lemma 3.9. Almost surely, for large enough n ∈ N the graph isomorphism of Lemma 3.8 takes ∂P n,λ to ∂P λ .
Proof. Lemma A.9 implies that if i ∈ [1, N ] Z , then a.s. z i ∈ ∂P λ , i.e., H λ for each t ∈ [0, 1] and each k = i. The uniform convergence of boundary paths ξ n → ξ implies that u ∈ ∂X if and only if u is the d-limit of a sequence of points u n ∈ ∂M n . The statement of the lemma follows from this and Lemma 2.3 via exactly the same argument used to prove Lemma 3.8.
Proof of Theorem 1.3. Due to Lemmas 3.8 and 3.9, this follows from Theorem 1.2 upon sending λ → 0 sufficiently slowly as n → ∞.

A reformulation of the finite expectation hypothesis
As in Section 3.1, let (C, h, 0, ∞) be a 0-quantum cone and write P = P 1 h and H = H 1 h for its associated Poisson point process and collection of Voronoi cells with λ = 1. Proving Proposition 3.1 (i.e., the finite expectation hypothesis in Theorem 2.2 for H) directly turns out to be difficult since Voronoi cells depend on the field in a rather delicate way, so it is not clear how to lower-bound the Lebesgue measure of the origin-containing cell H 0 . Instead, we will use the following lemma which allows us to lower-bound the Lebesgue measure of an LQG metric ball instead. Lemma 3.10 is essentially a consequence of the "mass transport" definition of translation invariance modulo scaling in [GMS18a, Definition 1.2]. However, the balls B H are not functions of the cell configuration H itself (they depend on additional randomness from the field) so we will need a trivial reformulation of the mass transport condition which allows for this. increasing sequence of open sets U j ⊂ C, each of which is either a square or a disk, whose union is all of C such that the following is true. Conditional on (H, {K H } H∈H ) and U j , let z j for j ∈ N be sampled uniformly from Lebesgue measure on U j . Then there are random numbers C j > 0 (possibly depending on (H, {K H } H∈H ) and z j ) such that in law with respect to the metric (3.8).
Exactly as in [GMS18a, Definition 1.2], one can formulate various equivalent definitions of translation invariance modulo scaling for cell configurations and prove that these definitions are equivalent via exactly the same arguments as in [GMS18a, Appendix A]. For our purposes, we will need the "mass transport" formulation of translation invariance modulo scaling for decorated cell configurations. In light of Lemma 3.10, we only need to prove that the expectation on the right side of (3.7) is finite. Actually, we will prove the following much stronger statement.
Proposition 3.13. For each p > 0, we have (3.14) We emphasize that Proposition 3.13 does not imply that diam(H 0 ) 2 area(H 0 ) deg(H 0 ) has finite moments of all positive orders (rather, we only get that it has a finite first moment) since Lemma 3.10 does not allow us to compare moments of order greater than 1. The rest of the paper is devoted to the proof of Proposition 3.13.

Estimates for LQG metric balls
The goal of this section is to establish Proposition 3.13, which together with Lemma 3.10 will conclude the proof of our main results. Along the way, we will establish a number of estimates for LQG metric balls which are of independent interest (see in particular Propositions 4.3, 4.4, 4.5, and 4.8).
We start out in Section 4.1 by introducing two random distributions on C which are defined using the white noise decomposition of the GFF and which have certain nice properties that the GFF itself does not. The first of these distributions, which we call h, possesses exact scale and translation invariance properties (not just scale and translation invariance modulo additive constant, like the whole-plane GFF). The second, which we call h tr , has the property that its restrictions to two sets at distance at least 1/5 from each other are independent. We then state a general lemma (Lemma 4.1) which allows us to compare h, h tr , and the whole-plane GFF.
In Section 4.2, we prove an upper bound for the LQG distance across a Euclidean annulus (Proposition 4.3) as well as estimates to the effect that an LQG metric ball B typically contains a Euclidean ball of radius comparable to the Euclidean diameter of B (Propositions 4.4 and 4.5). These are proven using percolation arguments which rely crucially on the local independence property of h tr . In Section 4.3, we prove that the LQG area of an LQG metric ball of radius r is tightly concentrated around r 4+or(1) (Proposition 4.8). This is proven by starting with known estimates for metric balls in the Brownian map, then transferring to the GFF using the equivalence of Brownian surfaces and LQG surfaces [MS16a], and finally using the local independent property of h tr to go from events of high probability to events of superpolynomially high probability.
In Section 4.4, we transfer the estimates of the preceding subsections from the whole-plane GFF to the 0-quantum cone. In Section 4.5, we conclude the proof of Proposition 3.13.

White-noise approximation of the Gaussian free field
In this subsection we will introduce various white-noise approximations of the GFF which are often more convenient to work with than the GFF itself. Similar approximations to the ones used here were also studied in [DG16,DZZ18,DG18]. Let W be a space-time white noise on [0, ∞)) and Borel measurable sets A ⊂ C and I ⊂ [0, ∞), we slightly abuse notation by writing For an open set U ⊂ C, we write p U (s; z, w) for the transition density of Brownian motion killed upon exiting U , so that for s ≥ 0, z ∈ C, and A ⊂ U , the integral A p U (s; z, w) dw gives the probability that a standard planar Brownian motion B started from z satisfies B([0, s]) ⊂ U and B s ∈ A. We also write p(s; z, w) := p C (s; z, w) = 1 2πs exp − |z − w| 2 2s .
We define the centered Gaussian process (4.1) We set h := h 0 . By [DG16, Lemma 3.1] and Kolmogorov's criterion, each h t for t ∈ (0, 1] admits a continuous modification. Henceforth whenever we work with h t we will assume that it is been replaced by such a modification. The process h does not admit a continuous modification, but its integral against any smooth compactly supported test function has finite variance, so it makes sense as a distribution. We record for reference the formula Var h t (z) − h t (z) = log( t/t), ∀z ∈ C, ∀0 < t < t < 1, which is immediate from (4.1). The distribution h is often more convenient to work with than the GFF thanks to the following symmetries, which are immediate from the definition.
• Rotation/translation/reflection invariance. The law of h is invariant with respect to rotation, translation, and reflection of the plane.
One property which h does not possess is spatial independence. To get around this, we will sometimes work with a truncated variant of h where we only integrate over a ball of finite radius. The following lemma is proven using elementary calculations for the transition density p U (t; z, w) together with the Kolmogorov continuity theorem (see, e.g., [DG18, Lemma 3.1]). It will allow us to use h tr or h in place of the GFF in many of our arguments.
Lemma 4.1. For any compact set K ⊂ C, there is a coupling (h, h, h tr ) of a whole-plane GFF normalized so that h 1 (0) = 0 and the distributions from (4.1) and (4.3) such that the following is true. For h 1 , h 2 ∈ {h, h, h tr }, the distribution (h 1 − h 2 )| K a.s. admits a continuous modification and there are constants c 0 , c 1 > 0 depending only on K such that for A > 1, (4.4) In fact, in this coupling one can arrange so that h and h tr are defined using the same white noise W .
The existence of continuous modifications in Lemma 4.1 allows us to define the 8/3-LQG metrics D h and D h tr . Indeed, this is because we know how to define D h+f when h is a GFF and f is a continuous function (see the discussion just after Lemma 2.5). Moreover, we get that D h and D h tr each a.s. induces the Euclidean topology on C. Due to Lemma 2.5, the estimate (4.4) will allow us to compare D h and D h tr to the 8/3-LQG metrics induced by a GFF.

Comparing LQG metric balls and Euclidean balls
Throughout this subsection, we let h be a whole-plane GFF normalized so that h 1 (0) = 0. We will prove the following three propositions, which relate D h -metric balls and Euclidean balls. Our first estimate implies in particular that a D h -metric ball is extremely unlikely to have an unusually large Euclidean diameter. This estimate is related to the fact that µ h (D) has negative moments of all orders (see [DS11,Lemma 4.5] or [RV14, Theorem 2.12]) but is proven in a very different way.
Proposition 4.3. For each fixed ρ ∈ (0, 1), it holds with superpolynomially high probability as → 0 that We next state two closely related estimates to the effect that a D h -metric ball typically contains a Euclidean ball of radius comparable to its Euclidean diameter. These are analogs for D h -metric balls of estimates for space-filling SLE cells from [GHM15, Section 3] and [GMS17, Section 4], and will be used to control the ratio diam(H 0 ) 2 / area(B H 0 ) appearing in Proposition 3.13.
Proposition 4.4. With superpolynomially high probability as → 0, each D h -metric ball which intersects both ∂B ρ (0) and ∂D contains a Euclidean ball of radius at least . We will prove Propositions 4.3 and 4.4 simultaneously using a percolation argument which is similar to ones from [DD16,DG16,DG18]. Proposition 4.5 will be deduced from Proposition 4.4 and a union bound.
For ρ > 0, define the square annulus A ρ and its inner and outer boundaries by The main step in the proof of the above propositions is Lemma 4.6 just below. For n ∈ N, we consider the restriction to A n of the truncated white noise field h tr of (4.3). The reason for considering A n instead of A 1 , say, is that two sets need to be at Euclidean distance at least 1/5 from each other for the restrictions of h tr to be independent and we want to define lots of independent events. Basic properties of the 8/3-LQG metric show that for each 1 × 1 square S ⊂ A n , it holds with probability tending to 1 as C → ∞ that the D h tr -distance from the boundary of the 1/2neighborhood ∂B 1/2 (S) to S is at least 1/C and each Euclidean ball of radius e −Cn 2/3 which intersects S has D h tr -diameter at most e −n 2/3 (this last condition would also hold with e −Cn 2/3 and e −n 2/3 replaced by, e.g., n −C and n −1 or 1 and 1/C, but we use e −n 2/3 since we will get an error of order e n 1/2 in Lemma 4.7 below). The restrictions of h tr to squares which lie at distance at least 1/5 from one another are independent, so the adjacency graph of "good" squares which satisfy the above properties looks like a very supercritical percolation on Z 2 when C is large. Hence with exponentially high probability in n, there is path of such good squares which separates the inner and outer boundaries of A n . This implies analogs of Propositions 4.3 and 4.4 for h tr | An . In Lemma 4.7, we set n (log −1 ) 3/2 and transfer from h tr | An to h| Aρ (and thereby to h| Aρ ) using Lemma 4.1 and the scale invariance properties of the field h.
Lemma 4.6. Define A n for n ∈ N as in (4.7). There are universal constants a 0 , a 1 > 0 and C > 1 such that for each n ∈ N, it holds with probability at least 1 − a 0 e −a 1 n that the following is true.
1. The D h tr -distance from ∂ in A n to ∂ out A n is at least 1/C.

2.
Each path from ∂ in A n to ∂ out A n intersects a Euclidean ball with Euclidean radius e −Cn 2/3 and D h tr -diameter at most e −n 2/3 . See Figure 2 for an illustration of the statement and proof of Lemma 4.6. We will eventually apply the lemma with n (log −1 ) 3/2 , so that e −n is smaller than any power of and e −n 2/3 ≈ .
∂ out A n ∂ in A n Figure 2: The square annulus A n of (4.7) is shown in light green. To prove Lemma 4.6, we use a percolation argument (based on the local independence property of h tr ) to show that with extremely high probability, we can find a collection of 1 × 1 squares S (light blue) whose union disconnects the inner and outer boundaries of A n and such that each path which crosses one of these squares has to have D h tr -length at least 1/C and has to hit a Euclidean ball of radius e −Cn 2/3 and D h tr -diameter at most e −n 2/3 . After re-scaling by 1/n, this statement is used to prove Propositions 4.3, 4.4, and 4.5.
Proof of Lemma 4.6. Let p ∈ (0, 1) be a small universal constant to be chosen later, in a universal manner. For n ∈ N, let S(A n ) be the set of unit side length squares with corners in Z 2 whose Euclidean 1-neighborhood satisfies B 1 (S) ⊂ A n . For S ∈ S(A n ) and C > 1, let E S (C) be the event that the following is true.
1. D h tr S, ∂B 1/2 (S) ≥ 1/C. View S(A n ) as a graph with two squares considered to be adjacent if they share an edge. We claim that if p is chosen sufficiently small, then for appropriate constants a 0 , a 1 > 0 as in the statement of the lemma, it holds for each n ∈ N that with probability at least 1 − a 0 e −a 1 n , we can find a path P of squares in S(A n ) which disconnects ∂ in A n from ∂ out A n such that E S (C) occurs for each S ∈ P.

Each Euclidean ball of radius e −Cn
Assume the claim for the moment. If a path P as in the claim exists, then each Euclidean path from ∂ in A n to ∂ out A n must pass through one of the squares S ∈ P. Since E S (C) occurs for each such square, each such path must hit a Euclidean ball of radius e −Cn 2/3 centered at a point of S which has D h tr ≤ D h tr | B 1/2 (S) -diameter at most e −n 2/3 , i.e., condition 2 in the lemma statement holds. Furthermore, since B 1/2 (S) ⊂ A n for each S ∈ S(A n ), any path from ∂ in A n to ∂ out A n must cross one of the annuli B 1/2 (S) \ S for some S ∈ P. Since E S (C) occurs for each such S, condition 1 in the lemma statement holds. It remains only to prove the claim. Let S * (A n ) be the graph whose squares are the same as the squares of S(A n ), but with two squares considered to be adjacent if they share a corner or an edge, instead of only considering squares to be adjacent if they share an edge. We define the inner and outer boundaries of S * (A n ) to be the set of squares which lie at Euclidean distance 1 from ∂ in A n and ∂ out A n , respectively (recall that squares in S(A n ) satisfy B 1 (S) ⊂ A n ). By planar duality, it suffices to show that if p, a 0 , a 1 are chosen appropriately, then it holds with probability at least 1 − a 0 e −a 1 n that there does not exist a simple path in S * (R n ) from the inner boundary of A n to the outer boundary of A n consisting of squares for which E S (C) does not occur. This will be proven by a standard argument for subcritical percolation.
By the definition (4.3) of h tr , the event E S (C) is a.s. determined by the restriction of the white noise W to B 1 (S)×R + . In particular, E S (C) and E S (C) are independent whenever B 1 (S)∩B 1 ( S) = ∅. For each fixed deterministic simple path P in S * (R n ), we can find a set of at least |P |/100 squares hit by P for which the neighborhoods B 1 (S) are disjoint. Since the events E S (C) for these |P |/100 squares are independent and each has probability at least 1 − p, the probability that E S (C) fails to occur for every square in P is at most p |P |/100 . We now take a union bound over all simple paths P in S * (A n ) connecting the inner and outer boundaries. For k ∈ [n, 16n 2 ] Z , the number of such paths with |P | = k is at most 4n8 k since there are 4n possible initial squares along the inner boundary of A n and 8 choices for each step of the path. Combining this with the estimate in the preceding paragraph, we find that the probability of an inner-outer crossing in S * (A n ) consisting of squares for which E S (C) does not occur is at most 4n 16n 2 k=n p k/100 8 k+1 , which is bounded above by an exponential function of n provided we take p < 8 −100 .
We now transfer from h tr | An to h| Aρ .
Lemma 4.7. There is a universal constant C > 1 such that for each ρ ∈ (0, 1), it holds with superpolynomially high probability as → 0 that the following is true.
2. Each path from ∂ in A ρ to ∂ out A ρ intersects a Euclidean ball with Euclidean radius at least C and D h -diameter at most .
Proof. We will apply Lemma 4.6 with n (log −1 ) 3/2 together with a scaling argument. We first establish an estimate for D h -distances in A n . By Lemma 4.1 and a union bound over O n (n 2 ) Euclidean balls of unit radius which cover A n , we can find constants c 0 , c 1 > 0 and a coupling of h and h tr such that If max z∈An |( h − h tr )(z)| ≤ A, then by the scaling property of LQG distances (Lemma 2.5), Setting A = √ 6n 1/2 and applying Lemma 4.6, we see that there is a universal constant C > 1 such that with exponentially high probability as n → ∞, the following is true.
2. Each path from ∂ in A n to ∂ out A n intersects a Euclidean ball with Euclidean radius e −Cn 2/3 and D h -diameter at most e −n 2/3 +On(n 1/2 ) , with the rate of the O n (n 1/2 ) universal.
We now use a scaling argument to transfer from A n to A ρ . Recall that ( h − h ρ/n )((ρ/n)·) d = h. By the LQG coordinate change formula (2.12) and Lemma 2.5, By Lemma 4.2 (applied with δ = ρ/n and C = n 1/2 ) and a union bound over O n (n 2 ) Euclidean balls of radius 1 whose union covers A n , we can find constants c 0 , c 1 > 0, depending only on ρ, such that P max x∈An | h ρ/n (x)| ≤ n 1/2 ≥ 1 − c 0 n 4 e −c 1 n .
Hence, with probability at least 1 − c 0 n 4 e −c 1 n , with the rate of the O n (n 1/2 ) deterministic and depending only on ρ.
We know that ( h − h ρ/n )((ρ/n)·) d = h, so by combining (4.8) and the conclusion of the first paragraph with ( h − h ρ/n )((ρ/n)·) in place of h, we get that (after possibly shrinking c 0 and c 1 ) it holds with probability at least 1 − c 0 n 4 e −c 1 n that the following is true.
1. The D h -distance from ∂ in A ρ to ∂ out A ρ is at least e −On(n 1/2 ) .
We now choose n = (log −1 ) 3/2 . This makes it so that n 4 e −c 1 n decays faster than any positive power of , e −n 1/2 decay slower than any positive power of , (ρ/n)e −Cn 2/3 = C+o (1) , and e −n 2/3 +On(n 1/2 ) = 1+o (1) . Making this choice of n and possibly slightly adjusting C and concludes the proof.
Proof of Proposition 4.3. By Lemma 4.1, we can couple h and h in such a way that (h − h)| D is a continuous function and with superpolynomially high probability as → 0, one has max z∈D |(h − h)(z)| ≤ (log −1 ) 2/3 . Combining this with Lemma 4.7 and the scaling property of LQG distances shows that for each fixed square annulus A ⊂ D such that the ratio of its inner and outer side lengths is 4, it holds with superpolynomially high probability as → 0 (at a rate depending on A) that the D h -distance between the inner and outer boundaries of A is at least . We can find finitely many such square annuli contained in D \ B ρ (0) such that the union of their inner boundaries disconnects the inner and outer boundaries of D \ B ρ (0). Each path between the inner and outer boundaries of D \ B ρ (0) must cross between the inner and outer boundaries of one of these square annuli, so applying the preceding estimate once to each such annulus and taking a union bound concludes the proof.
Proof of Proposition 4.4. Via the same argument as in the proof of Proposition 4.3, Lemma 4.7 implies that there is a universal constant C > 1 such that with superpolynomially high probability as → 0, each path from B ρ (0) to ∂B (1+ρ)/2 (0) intersects a Euclidean ball with Euclidean radius at least C and D h -diameter at most . In particular, each D h -ball B which intersects both ∂B ρ (0) and ∂D intersects a Euclidean ball of radius at least C and D h -diameter at most which is contained in B (1+ρ)/2 (0). On the other hand, Proposition 4.3 shows that with superpolynomially high probability as → 0, the D h -distance from B (1+ρ)/2 (0) to ∂D is at least 2 , in which case the aforementioned Euclidean ball is contained in the D h -metric ball B. Replacing C by concludes the proof.
Proof of Proposition 4.5. Observe that the conclusion of Proposition 4.4 does not depend on the choice of additive constant for h. By the scale and translation invariance of the law of h, modulo additive constant, we see that Proposition 4.4 implies that for each ρ ∈ (0, 1), r > 0, and z ∈ C, it holds with superpolynomially high probability as → 0, at a rate which is uniform in r and z, that each D h -metric ball which intersects both ∂B ρr (z) and ∂B r (z) contains a Euclidean ball of radius at least r. By a union bound, with superpolynomially high probability as δ → 0 that the following is true.

Volume estimates for LQG metric balls
The goal of this subsection is to establish the following estimate for the LQG mass of LQG metric balls.
Proposition 4.8. Let h be a whole-plane GFF normalized so that h 1 (0) = 0. For each ζ ∈ (0, 1), it holds with superpolynomially high probability as → 0 that s 4+ζ ≤ µ h (B s (z; D h )) ≤ s 4−ζ , ∀s ∈ (0, ], ∀z ∈ D. (4.9) We will extract Proposition 4.8 from known ball volume estimates for the Brownian map, which say that a.s. the volume of every ball of radius s in the Brownian map simultaneously is bounded above and below by constants times s 4−ζ and s 4+ζ (stated as Lemma 4.9). These estimates together with the equivalence of the Brownian map and the quantum sphere do not immediately imply (4.9) since we are working with a whole-plane GFF instead of a quantum sphere. One could attempt to transfer the estimates using some sort of quantitative local absolute continuity, but we instead take a different approach which we find to be easier.
Local absolute continuity (without any quantitative Radon-Nikodym derivative bound) shows that a.s. the µ h -mass of every D h -ball of radius s ∈ (0, 1) which is contained in D is bounded above and below by constants times s 4−ζ and s 4+ζ . To turn this into a bound which holds with superpolynomially high probability instead of just a.s., we first use Lemma 4.1 and scale invariance considerations to transfer from h| D to the restriction of the truncated white-noise field h tr of (4.3) to B R (0) for a large value of R (Lemma 4.10). The restrictions of h tr to radius-1 Euclidean balls contained in B R (0) which lie at distance at least 1/5 from one another are independent. Hence, the fact that an event (in our setting, bounds for the µ h -mass of D h -balls contained in the Euclidean ball) holds simultaneously for all such Euclidean balls with high probability shows that in fact the event for a single Euclidean ball has to hold with extremely high probability (Lemma 4.11). We then transfer back to h to conclude the proof. Let us first record what we get from Brownian map estimates.
The same is true with the field h of (4.1) in place of h.
Proof. We will use estimates for the Brownian map, so we need to work with a quantum sphere due to the equivalence of the Brownian map and quantum sphere [MS16a, Corollary 1.4]. Let h Sph be an embedding into C of the quantum sphere (say, conditioned to have LQG area at least 1), normalized so that two marked points sampled uniformly from µ h Sph are sent to 0 and ∞ and so that 1 = sup{r > 0 : h Sph r (0) + Q log r = 0}, provided h Sph r (0) + Q log r = 0 for some r > 0. This choice of normalization makes it so that the laws of h Sph | D\B 1/2 (0) and h| D\B 1/2 (0) are mutually absolutely continuous on the event {h Sph r (0) = 0} (the laws of the restrictions of the fields to D are not absolutely continuous since h Sph has a γ-log singularity at 0). By [Le 10, Corollary 6.2] and the equivalence of the Brownian map and the quantum sphere, Furthermore, since the continuum label process (the "head of the Brownian snake") used to define the Brownian map is a.s. Hölder continuous with any exponent less than 1/4, a.s.
By the local absolute continuity between h and h Sph , we obtain (4.10) with D \ B 1/2 (0) in place of D. By the translation invariance of the law of h, modulo additive constant, we get (4.10). By Lemma 4.1, the same is true with h in place of h.
We will now transfer to an estimate for h tr restricted to a large ball.
Lemma 4.10. Fix p > 1 and ζ ∈ (0, 1). There is a universal constant c > 0 and a random set Z r p ⊂ B r p (0) ∩ (3Z 2 ) independent from h tr such that with probability tending to 1 as r → ∞, one has #Z r p ≥ cr 2p and for each z ∈ Z r p , ∂B 1 (z)) , ∀w ∈ B 1 (z). (4.11) The reason why we need to restrict to the set Z r p in Lemma 4.10, instead of looking at all points in B r p (0) ∩ (3Z 2 ), is as follows. To transfer from an estimate on D to an estimate on B r p (0), we will use the scale invariance property of the white noise field h, which says that h(r −p ·) − h r −p (r −p ·) has the same law as h and is independent from h r −p . We will restrict attention to the set of points where h r −p is not unusually large, which is independent from h(r −p ·) − h r −p (r −p ·), then couple h tr with h(r −p ·) − h r −p (r −p ·) using Lemma 4.1.
Proof of Lemma 4.10.
Step 1: re-scaling from D to B r p (0). We will re-scale with the eventual aim of transferring Lemma 4.9 to an estimate with B r p (0) in place of D and h in place of h. This will lead to the definition of Z r p . If we set h r p : (4.12) We emphasize that Z r p is determined by h r −p , so is independent from h r p .
We will now argue that there is a universal constant c > 0 such that P #Z r p ≥ cr 2p → 1 as r → ∞. (4.13) To see this, we observe that each h r −p (r −p z) for z ∈ 3Z 2 is Gaussian with variance log r p . By the Gaussian tail bound and a union bound, we find that there is a universal constant c > 0 such that with probability tending to 1 as r → ∞, the number of z ∈ B r p (0)∩(3Z 2 ) with | h r −p (r −p z)| ≤ ζ 2 2 log r is at least cr 2p . By Lemma 4.2, it holds with probability tending to 1 as r → ∞ that By combining these estimates, we get (4.13).
Step 2: estimate for LQG balls centered at points of Z r p . By the LQG coordinate change formula (2.12) and Lemma 2.5, for each z ∈ Z r p and each x, y ∈ B 1 (z), Moreover, the analogous properties for the LQG measure show that Combining this with Lemma 4.9 (with h in place of h) shows that with probability tending to 1 as r → ∞, it holds for each z ∈ Z r p that s 4+aζ ≤ µ h (B s (w; D h )) ≤ s 4−aζ , ∀s ≤ r −ζ min{1, D h (w, ∂B 1 (z))}, ∀w ∈ B 1 (z), (4.14) where here a > 0 is a universal constant. Note that we used that 4/ √ 6 = 8/3 to cancel two large powers of r and we used that r ζ 2 ≤ s −ζ for s ≤ r −ζ to absorb a small power of r into a power of s.
Step 3: transferring from h to h tr . By Lemma 4.1 and a union bound over O r p (r 2p ) Euclidean balls of radius 1 which cover B r p (0), we can couple h r p and h tr in such a way that with probability tending to 1 as r → ∞, we have max z∈B r p +1 (0) |( h r p − h tr )(z)| ≤ (log r) 2/3 . Since h r p is independent from Z r p , we can take h tr to be independent from Z r p in this coupling. Our choice of coupling together with (4.13) and (4.14) shows that with probability tending to 1 as r → ∞, it holds for each z ∈ Z r p , each w ∈ B 1 (z), and each s ≤ r −ζ e − 1 √ 6 (log r) 2/3 min 1, D h tr (w, ∂B 1 (z)) that After adjusting ζ appropriately, this gives (4.11).
We can now go from events with probability tending to 1 to events with superpolynomially high probability.
Lemma 4.11. For each ζ ∈ (0, 1), it holds with superpolynomially high probability as → 0 that Proof. Fix p > 1, which we will eventually send to ∞. For z ∈ 3Z 2 and r > 1, let Note that the event in (4.15) is the same as E −1/ζ (0). Furthermore, if we let Z r p ⊂ B r p (0) ∩ (3Z 2 ) be the random set independent from h tr from Lemma 4.10, then that lemma tells us that with probability tending to 1 as r → ∞, we have #Z r p ≥ cr 2p and E r (z) occurs for every z ∈ Z r p .
The fields h tr | B 1 (z) for different choices of z ∈ 3Z 2 are independent and the law of h tr is invariant with respect to spatial translations. Consequently, the events E r (z) for different choices of z ∈ 3Z 2 are independent. Since h tr is independent from Z r p , we get that (4.16) If r is large enough that this 1 − o r (1) is at least e −c , then re-arranging gives where here we have used the elementary inequality 1 − e −x ≤ x. Since p > 1 can be made arbitrarily large, we get that E r (0) occurs with superpolynomially high probability as r → ∞. Setting r = −1/ζ now concludes the proof.

Estimates for the 0-quantum cone
We now want to shift attention from the whole-plane GFF to the 0-quantum cone, with a view toward proving Proposition 3.13. To this end, we will transfer the main results of the preceding subsections to the case of a 0-quantum cone. We start with estimates for the LQG areas of LQG metric balls which follows from Proposition 4.8.
2. For ζ ∈ (0, 1), it holds with superpolynomially high probability as By the scaling property (2.11) of the 0-quantum cone, the law of (C, D h , µ h ) as a metric measure space is invariant under scaling distances by b 1/4 and areas by b, for any b > 0. We will often use this fact in conjunction with Proposition 4.12 without comment.
Proof of Proposition 4.12. The proposition statement does not depend on the choice of embedding for h, so we can assume without loss of generality that h is given the circle-average embedding.
Recall that h| D agrees in law with the corresponding restriction of a whole-plane GFF normalized so that its circle average over ∂D is zero. By Proposition 4.3, it holds with superpolynomially high probability as C → ∞ that B C −1 (0; D h ) ⊂ D. Hence Proposition 4.8 (applied with ζ = 1, say) shows that with superpolynomially high probability as C → ∞, (4.17) By the scale invariance property of the 0-quantum cone (2.11), we have (C, D h , µ h ) d = (C, CD h , C 4 µ h ) as metric measure spaces. Therefore, (4.17) implies that with superpolynomially high probability as C → ∞, one has C −1 ≤ µ h (B 1 (0; D h )) ≤ C, which is assertion 1.
We now prove assertion 2 via a similar argument. By Proposition 4.8 and our above description of the law of h| D , it holds with superpolynomially high probability as C → ∞ that Furthermore, by Proposition 4.3, it holds with superpolynomially high probability as C → ∞ that Hence with superpolynomially high probability as C → ∞, We now scale distances by C 2 and areas by C 8 and apply (2.11) as above to deduce assertion 2 from (4.18).
We next record an estimate to the effect that D h -metric balls have to contain Euclidean metric balls of radius comparable to their Euclidean diameters.
Proposition 4.13. Let (C, h, 0, ∞) be a 0-quantum cone and let ζ ∈ (0, 1). With superpolynomially high probability as C → ∞, each D h -ball B which is contained in B C (0) and which has D h -radius at least C −1 contains a Euclidean ball of radius at least C −ζ diam(B).
We will deduce Proposition 4.13 from Propositions 4.3 and 4.5. Before we can do so, however, we need some basic polynomial tail estimates for the minimal and maximal radii of Euclidean balls. This is because Proposition 4.13 only holds for LQG balls with sufficiently small Euclidean diameter and because diam(B) 1+ζ can be much smaller than C −ζ diam(B) if diam(B) is tiny.
By Proposition 4.8 (applied with B 2 (0) in place of D and 1/2 in place of ), we see that with superpolynomially high probability as → 0, µ h (B (z; D h )) < 4−ζ for each z ∈ D. By Proposition 4.5, it holds with superpolynomially high probability as → 0 that each D h -ball centered at a point of D which has Euclidean diameter at least q contains a Euclidean ball of radius at least q . By the preceding estimates, with probability at least 1 − β( q)+o ζ (1)+o (1) , each such D h -ball has µ h -mass at least 4−ζ and hence D h -radius strictly larger than . Sending ζ → 0 and then q → q concludes the proof.
Proof of Proposition 4.13. Let q ∈ 0, We will eventually send q to 0 and q to ∞. By Lemmas 4.14 and 4.15, it holds with probability at least 1 − C −(3α(q))∧β(q)+o C (1) that each D h -ball contained in D with D h -diameter between C −3 and C −1 has Euclidean diameter between C −3q and C −q . By Proposition 4.5, it holds with superpolynomially high probability as C → ∞ that each D h -ball contained in D with Euclidean diameter at most C −q contains a Euclidean ball of radius at least diam(B) 1+ζ/(2q) . By Proposition 4.3, it holds with superpolynomially high probability as C → ∞ that B C −1 (0; D h ) ⊂ D. Hence with probability at least 1−C −(3α(q))∧β(q)+o C (1) , contains a Euclidean ball of radius at least diam(B) 1+ζ/(3q) ≥ C −ζ diam(B). This statement does not depend on the choice of embedding h, so we can add 2 √ 6 log C to h (i.e., scale distances by C 2 ) to get that the event in the statement of the lemma holds with probability at least 1−C −(3α(q))∧β(q)+o C (1) . Since α(q), β(q) → ∞ as q → ∞ and q → 0, this concludes the proof.  Proof. Let Z be a maximal collection of points in B C (0; D h ) such that the balls B 1/2 (z; D h ) for z ∈ Z are disjoint. By Proposition 4.12, it holds with superpolynomially high probability as C → ∞ that min z∈Z µ h (B 1/2 (z; D h )) ≥ C −ζ/2 and µ h (B C (z; D h )) ≤ C 4+ζ/2 , which implies that #Z ≤ C 4+ζ . By the maximality of Z, each point of B C (0; D h ) is contained in B 1 (z; D h ) for some z ∈ Z.

Proof of the moment estimate
The following lemma shows that Voronoi cells are extremely unlikely to have a larger quantum diameter than one would expect.
Lemma 4.17. Fix ζ ∈ (0, 1). With superpolynomially high probability as C → ∞, each cell in H which intersects B C (0; D h ) has D h -diameter at most C ζ .
To prove Lemma 4.17, we will use the following lemma to build a "wall" of Voronoi cells which separate the boundaries of two concentric D h -balls.
Lemma 4.18. For ζ ∈ (0, 1), it holds with superpolynomially high probability as C → ∞ that the following is true. For each z ∈ B C (0; D h ), we can find a finite collection of at most C ζ D h -metric balls of radius 1/2 which are contained in B 3 (z; D h ) \ B 1 (z; D h ) and whose union disconnects Proof. By Proposition 4.12, it holds with superpolynomially high probability as C → ∞ that µ h (B 3 (z; D h )) ≤ C ζ/2 and µ h (B 1/4 (z; D h )) ≥ C −ζ/2 , ∀z ∈ B C (0; D h ). (4.22) Henceforth assume that (4.22) holds and fix z ∈ B C (0; D h ). We will construct a collection of D h -balls as in the statement of the lemma. Let C be a maximal collection of points in ∂B 2 (z; D h ) such that the balls B 1/4 (w; D h ) for w ∈ C are disjoint. The union of the balls B 1/2 (w; D h ) for w ∈ C covers ∂B 2 (z; D h ) (otherwise, we could find a point in ∂B 2 (z; D h ) which lies at distance at least 1/2 from each w ∈ C, which contradicts the maximality of C).
Furthermore, each of the balls B 1/2 (w; D h ) for w ∈ C is centered at a point of ∂B 2 (z; D h ), so is contained in B 3 (z; D h ) \ B 1 (z; D h ). Finally, since the balls B 1/4 (w; D h ) for w ∈ C are disjoint and contained in B 3 (z; D h ), we see from (4.22) that #C ≤ C ζ .
Proof of Lemma 4.17. By Lemma 4.16, with superpolynomially high probability as C → ∞, we can find a collection Z C of at most C 4+ζ points of B C (0; D h ) such that the union of the balls B 1 (z; D h ) for z ∈ Z C covers B C (0; D h ). By Lemma 4.18 and the scaling property (2.11) of the 0-quantum cone, with superpolynomially high probability as C → ∞ we can find for each z ∈ Z C a finite collection C(z) of at most C ζ D h -balls of radius 1 2 C ζ which are contained in B 3C ζ (z; D h ) \ B C ζ (z; D h ) and whose union disconnects B C ζ (z; D h ) from C \ B 3C ζ (z; D h ). By Proposition 4.12, it holds with superpolynomially high probability as C → ∞ that the µ h -mass of each ball in each of the collections C(z) is at least C 4ζ(1−ζ) By the formula for the Poisson distribution, if this is the case then the conditional probability given h that each of the balls in z∈Z C C(z) contains a point of P is at least 1 − exp −C 4ζ(1−ζ) . By a union bound over the at most C 4+2ζ balls in z∈Z C C(z), we find that with superpolynomially high probability as C → ∞, each of the balls this collection contains a point of P. Similarly, it holds with superpolynomially high probability as C → ∞ that B C ζ /4 (z; D h ) contains a point w z ∈ P for each z ∈ Z C . Since each point of B 1 (z; D h ) lies within D h -distance C ζ /4 + 1 of w z , this means that the center point of each Voronoi cell which intersects B 1 (z; D h ) is contained in If the events described in the preceding paragraph are satisfied, then for z ∈ Z C , each point is D h -closer to a point of P which is contained in one of the balls in C(z) than it is to any point of B C ζ /2 (z; D h ). This means that no such point can be contained in a cell whose center point is in B C ζ /2 (z; D h ), hence no such point can be contained in a cell which intersects B 1 (z; D h ). Hence each Voronoi cell which intersects with superpolynomially high probability as C → ∞. Since the union of the balls B 1 (z; D h ) for z ∈ Z C covers B C (0; D h ), this gives the statement of the lemma with 3C ζ in place of C ζ , which is sufficient.
We can now prove our main moment estimates. Recall that B H denotes the smallest D h -metric ball containing the cell H which is centered at the center point of H. Proof. Fix ζ ∈ (0, 1), which we will eventually send to 0. Lemma 4.17 shows that with superpolynomially high probability as C → ∞, each H ∈ H with 0 ∈ B H has D h -diameter at most C ζ , so is contained in B 2C ζ (0; D h ). We will now argue that with probability at least 1 − O C (C −4/ζ+ζ ), the D h -radius of B H for each such cell H is at least C −1/ζ . Indeed, Proposition 4.12 shows that with superpolynomially high probability as C → ∞, we have µ h (B 2C −1/ζ (0; D h )) ≤ C −4/ζ+ζ . Since the number of points of P which belong to B 2C −1/ζ (0; D h ) is Poisson with mean µ h (B 2C −1/ζ (0; D h )) conditional on h, it follows that with probability at least 1 − O C (C −4/ζ+ζ ), no point of P is contained in B 2C −1/ζ (0). In particular, no cell H ∈ H is contained in B 2C −1/ζ (0), so if 0 ∈ B H then the D h -radius of B H must be at least C −1/ζ , as required. By Proposition 4.13, it holds with superpolynomially high probability as C → ∞ that each D h -ball B centered at a point of B C (0; D h ) with D h -radius at least C −1/ζ contains a Euclidean ball of radius at least C −1/2 diam(B). Combining this with the preceding paragraph shows that (4.23) holds with probability at least 1 − O C (C −4/ζ+ζ ). Sending ζ → 0 concludes the proof.
To bound the number of cells with 0 ∈ B H and their degrees, we will need the following lemma.
Lemma 4.20. For each ζ ∈ (0, 1), it holds with superpolynomially high probability as C → ∞ that (4.24) and the D h -diameter of each of the balls B h which intersects B C (0; D h ) is at most C ζ .
Proof. Fix ζ ∈ (0, 1). By Lemma 4.17 and a union bound over dyadic values of C, it holds with superpolynomially high probability as C → ∞ that for each k ∈ N with 2 k ≥ C/2, each cell H ∈ H which intersects B 2 k (0; D h ) has D h -diameter at most 2 ζk−1 . Henceforth assume that this is the case.
For a cell H ∈ H, let k H ∈ N be the smallest integer for which Consequently, each H ∈ H with B H ∩ B C (0; D h ) = ∅ must intersect B 4C (0; D h ) and hence must each have D h -diameter at most 4C ζ . In particular, each such cell is contained in B 5C (0; D h ). We are thus left to bound the number of cells contained in B 5C (0; D h ). By Proposition 4.12, it holds with superpolynomially high probability as C → ∞ that µ h (B 5C (0; D h )) ≤ C 4+ζ/2 . Conditioned on this event, the number of points of P which belong to B 5C (0; D h ) is Poisson with mean at most C 4+ζ/2 . By the elementary estimate we see that the probability that B 5C (0; D h ) contains more that C 4+ζ points of P decays superpolynomially in C. This gives (4.24). Proof. By Lemma 4.21 (applied with any choice of ζ ∈ (0, 1)) it holds with superpolynomially high probability as C → ∞ that each H ∈ H with 0 ∈ B H has D h -diameter at most C, so is contained in B 2C (0; D h ). This means that each neighbor of each such cell intersects B 2C (0; D h ). Therefore, Lemma 4.20 implies that with superpolynomially high probability as C → ∞, the total number of cells such that either 0 ∈ B H or H ∼ H for some cell H with 0 ∈ B H is at most C 5 . Replacing C with C 1/5 concludes the proof. Consequently, this sum has finite moments of all positive orders.

Open problems
Perhaps the most natural question to ask about Brownian motion on the Brownian map is the following.
Problem 5.1. Show that random walk on uniform random planar maps (e.g., uniform quadrangulations or triangulations) converges to Brownian motion on the Brownian map with respect to the Gromov-Hausdorff-Prokhorov-uniform topology, the natural topology for curve-decorated metric measure spaces [GM17c].
It is known that self-avoiding walk and percolation interfaces on uniform random planar maps converge to SLE 8/3 and SLE 6 , respectively [GM16a,GM17a]. In contrast to the case of Z 2 , however, random walk on a random planar map seems harder to analyze than SAW or percolation interfaces since the random walk can re-trace its past, so one cannot explore the curve and the planar map simultaneously using peeling. Our results only concern Brownian motion on Brownian surfaces viewed modulo time parameterization. The natural way to parameterize Brownian motion on a 8/3-LQG surface, equivalently a Brownian surface, is called Liouville Brownian motion and is constructed in [Ber15,GRV16].
Problem 5.2. Show that in the setting of Theorem 1.1, the random walk on P λ , parameterized so that it traverses one edge in one unit of time, converges to Liouville Brownian motion with respect to the uniform topology as λ → ∞.
There are other natural types of random walks that one can consider on Brownian surfaces which one would expect to converge to Brownian motion in the scaling limit. For example, one can generate a random walk which at each step moves to a point sampled uniformly at random from the metric ball of radius centered at its current position. As a second example, the Brownian snake construction of the Brownian map involves describing the Brownian map as a gluing of the tree of geodesics back to the root together with a dual tree (and instance of the CRT) rooted at the dual root. The peanocurve which "snakes between these two trees" is a space-filling curve, which one may use to give a graph approximation analogous to the mated-CRT map considered in [GMS17,GMS18b]. In particular, if (X , D, µ) denotes the unit-area Brownian map, the Brownian snake construction gives a quotient map p : [0, 1] → X . We then fix > 0 and consider the random walk on the adjacency graph of µ-mass cells p([x − , x]) for x ∈ [0, 1] ∩ ( Z).
One of the appeals of this construction is that one can sample from it in linear time (one just needs to generate an instance of the Brownian snake) and then compute its Tutte embedding efficiently using a sparse matrix package (c.f. [GMS17, Remark 1.2]).
Problem 5.3. Show that Theorem 1.1 holds for random walk on other graph approximations of Brownian surfaces, such as the two mentioned just above.
Problem 5.4. Show that the complementary connected components of a Brownian motion on the Brownian map (run for a fixed amount of time) are independent Brownian disks conditional on their boundary length.
The analog of the property of Problem 5.4 for Brownian motion on certain random planar maps (like the UIPT or the UIPQ) follows from the so-called spatial Markov property, a.k.a. peeling; see, e.g., [BC13]. It is known that the complementary connected components of SLE 6 on a Brownian surface are Brownian disks (this follows from the results of [DMS14,MS15c] and the equivalence of Brownian and 8/3-LQG surfaces), so it may be possible to solve Problem 5.4 using the relationship between SLE 6 and Brownian motion. An alternative approach to Problem 5.4 is via Theorem 1.1. Indeed, we know that the complementary connected components of a metric ball on the Brownian map are Brownian disks conditional on their boundary lengths [MS15a, Le 17]. Moreover, a Poisson-Voronoi cell is determined by the metric ball centered at its center point whose radius equals twice the distance from the center point to the boundary of the cell, together with the points of the Poisson point process which intersect this ball. It is possible that one could apply this property at the cells hit by the walk to solve Problem 5.4.
Problem 5.4 might have some relevance to Problem 5.1. Indeed, if one can show that Brownian motion on the Brownian map is uniquely characterized by the Markov property of Problem 5.4 together with the law of the boundary lengths of the complementary connected components, then potentially this could be used to identify a subsequential scaling limit of random walk on random planar maps (one would also have to establish tightness). A similar strategy is used to prove the convergence of percolation on random planar maps to SLE 6 in [GM17a].
Theorem 1.1 together with the result of Yadin and Yehudayoff [YY11] allow us to give an intrinsic definition of SLE 2 on a Brownian surface as the limit of the loop-erased random walk on Poisson-Voronoi tessellations.
Problem 5.5. Does the perspective of this paper lead to any insights about SLE 2 on a Brownian surface (concerning, e.g., the law of the surface parameterized by its complement or its relationship to random planar maps)?
Problem 5.5 would be very interesting to solve since currently very little is known about the behavior of SLE κ curves on a γ-LQG surface for κ / ∈ {γ 2 , 16/γ 2 }.

A Basic properties of Voronoi cells
In this section we will prove a number of a.s. properties of Voronoi cells which are intuitively obvious from, e.g., the simulations (see Figure 1). In particular, we will show that such cells are connected (Lemma A.2), they are compact and locally finite (Lemma A.4), their boundaries have zero LQG measure and zero Lebesgue measure (Lemmas A.5 and A.6), and they typically intersect one another and the domain boundary in a "generic" way (Lemmas 4.20 and A.9). Throughout, we will consider the setup described at the beginning of Section 3, so that for a GFF-type distribution h and λ > 0, P λ h and H λ h denote the associated Poisson point process and collection of Voronoi cells, respectively. The arguments in this section do not use any of the results of Sections 3 and 4, so can be read independently of those sections.
Remark A.1. We will often consider the Voronoi tessellations H λ h for fields h for which there is a choice in the way that the additive constant is fixed. Different choices scale µ h , and hence the intensity measure for P λ h , by a constant factor. However, for any fixed choice of additive constant for h, the conditional law of P λ h given h is well-defined. Furthermore, if µ h is a.s. finite and we condition on h and the event {#P λ h = n} for n ∈ N, then the conditional law of P λ h is that of a collection of n i.i.d. samples from µ h , so this conditional law does not depend on the choice of additive constant for h (or on λ). If µ h is only locally finite, one can apply the preceding sentence with h replaced by its restriction to a compact set. As a particular consequence of this, the a.s. statements for Voronoi is a point of P λ h in B 2 k (0) \ B 2 k−1 (0). To see this, we first observe that by standard estimates for the 8/3-LQG measure [DS11, Lemma 4.6], the LQG coordinate change formula, and the fact that h(2 k ·) − h 2 k (0) d = h, it holds except an event of probability decaying faster than any power of 2 −k that Since t → h e t (0) evolves as a standard linear Brownian motion [DS11, Section 3.1], by the Borel-Cantelli lemma it follows that a.s. µ h (B 2 k (0) \ B 2 k−1 (0)) grows exponentially in k as k → ∞. Since P λ h is a Poisson point process with intensity measure λµ h , our claim now follows.
For k ∈ N, let E k be the event that i.e., the D h -diameters of the two dyadic annuli on either side of B 2 k−1 (0) \ B 2 k−2 (0) are each strictly smaller than the D h -distance across this annulus and the D h -distance across ∂B 2 k−3 (0) \ B 2 k−4 (0).
We claim that a.s. E k occurs for arbitrarily large values of k ∈ N. It is easily seen from the local absolute continuity properties of the GFF (see, e.g., [ Combining the preceding two paragraphs shows that a.s. there exists arbitrarily large values of k ∈ N for which E k occurs and B 2 k (0) \ B 2 k−1 (0) and B 2 k−2 (0) \ B 2 k−3 (0) each contain a point of P λ h . If k is one of these values, then each point of C \ B 2 k−1 (0) is D h -closer to one of the points of P λ h in B 2 k (0) \ B 2 k−1 (0) than it is to any point of B 2 k−2 (0), so cannot be contained in a cell centered at a point of B 2 k−2 (0). Hence every cell centered at a point of B 2 k−2 (0) is contained in B 2 k−1 (0), so in particular is bounded. Furthermore, each point of B 2 k−2 (0) is D h -closer to a point of P λ h which is in B 2 k−2 (0) \ B 2 k−3 (0) than it is to any point of C \ B 2 k−1 (0). Hence each cell which intersects B 2 k−2 (0) must be centered at a point in B 2 k−2 (0). Since µ h (B 2 k−2 (0)) < ∞, a.s. B 2 k−2 (0) contains at most finitely many points of P λ h , so B 2 k−3 (0) intersects only finitely many cells of H λ h . Since this happens for arbitrarily large values of k, we conclude the proof in the case of the whole-plane GFF.
The case when h is a quantum cone or a quantum wedge can be deduced from the case of a whole-plane GFF using local absolute continuity, or alternatively be treated similarly to the case of a whole-plane GFF using the radii R b of (2.9) with b = 2 k and the relation (2.10).
From basic properties of the Brownian disk, we get the following.
Lemma A.5. Suppose h is a whole-plane GFF (with some choice of additive constant). Almost surely, the boundary of each of the cells in H λ h has zero 8/3-LQG area measure. In fact, it is a.s. the case that for any z, w ∈ P λ h , the set of u ∈ C for which D h (u, z) = D h (u, w) has zero 8/3-LQG measure. The same is true with h replaced by a free-boundary GFF on a Jordan domain or an embedding of a quantum cone, sphere, disk, or wedge.
Proof. We will prove the lemma in the case of the quantum disk. The general case follows from this and the local absolute continuity of the fields mentioned in the lemma with respect to an embedding of the quantum disk (this local absolute continuity holds away from the boundary of the domain in the case of the whole-plane GFF or the quantum cone or sphere and up the domain boundary in the case of a free-boundary GFF or quantum wedge). Since the quantum disk is equivalent to the Brownian disk, general Brownian disk theory shows that if v is sampled uniformly from µ h , then a.s. for each r > 0 one has µ h (∂B r (v; D h )) = 0: indeed, this follows, e.g., from the fact that the set of times for which the head of the Brownian snake takes any particular value r > 0 has zero Lebesgue measure. Since P λ h is a Poisson point process with intensity measure λµ h , this shows that the probability that two points of P λ h lie on the boundary of the same D h -ball centered at v is zero. That is, the probability that D h (u, v) = D h (u, w) is zero. Since v is sampled uniformly from µ h , the statement of the lemma follows.
We will now state and prove several lemmas to the effect that cells of H λ h a.s. have "generic" behavior. In each case, the basic idea of the proof is that if φ is a smooth bump function, then the laws of h + aφ and h are mutually absolutely continuous. Furthermore, a certain "good" generic event for h + aφ will occur for Lebesgue-a.e. choice of a. By taking a to be random according to a distribution with a density with respect to Lebesgue measure (e.g., sampled from the standard Gaussian distribution) this implies that the desired generic behavior holds with probability 1. We expect that the same results can also be obtained (perhaps via more involved arguments) using Brownian map theory.
Lemma A.6. Suppose h is a whole-plane GFF (with some choice of additive constant). Almost surely, the boundary of each of the cells in H λ h has zero Lebesgue measure. In fact, it is a.s. the case that for any z, w ∈ P λ h , the set of u ∈ C for which D h (u, z) = D h (u, w) has zero Lebesgue measure.
The same is true with h replaced by a free-boundary GFF on a Jordan domain or an embedding of a quantum cone, sphere, disk, or wedge.
Proof. We will prove the lemma in the case when h is a free-boundary GFF on D. This implies the lemma in general by local absolute continuity. Note that the lemma statement does not depend on the choice of additive constant for h by Remark A.1 and since adding a constant to h scales D h by a constant factor. If we condition on h and the total number of points in P λ h , then the elements of P λ h are i.i.d. samples from µ h , normalized to be a probability measure. It therefore suffices to show that if z, w ∈ D are independent samples from µ h , normalized to be a probability measure, then a.s. the set of u ∈ D with D h (u, z) = D h (u, w) has zero Lebesgue measure. For this purpose, it suffices to show that for any fixed u ∈ D, we have P[D h (u, z) = D h (u, w)] = 0.
Step 1: reducing to an event with deterministic sets. Henceforth fix u ∈ D and for open sets V ⊂ V ⊂ D with V ⊂ V and V = D, let E h = E h (u, V, V ) be the event that the following is true.
2. There is a D h -geodesic from w to u which does not enter V .
Since D h -geodesics have zero µ h -mass, the probability that every D h -geodesic from z to u passes through w is zero, and the same is true with z and w interchanged. Consequently, on the event Step 2: randomly perturbing the field. Consider a smooth bump function φ : D → [0, 1] with φ| V ≡ 1 and φ| D\V ≡ 0. For a ∈ R, the laws of the fields h + aφ and h are mutually absolutely continuous (this follows from, e.g., [MS16c,Lemma 3.4] and the fact that φ| U ≡ 0, so adding aφ does not affect the choice of normalization for the field). It follows from this that the joint laws of (h, z, w) and (h + aφ, z, w) are mutually absolutely continuous. We emphasize that this still holds even though we are always sampling z and w from µ h , rather than from µ h+aφ , since adding a smooth function to h results in an LQG measure which is absolutely continuous with respect to µ h . Let E h+aφ be defined in the same manner as above but with (D h+aφ , z, w) in place of (D h , z, w). Also let A be a standard Gaussian random variable, independent from everything else. The laws of (h + Aφ, z, w) and (h, z, w) are mutually absolutely continuous, so it suffices to show that P[E h+Aφ ] = 0. For this purpose, it is enough to show that if E h+aφ occurs for some a ∈ R, then E h+bφ does not occur for any b ∈ R \ {a} (since this implies that P[E h+Aφ |(h, z, w)] = 0).
Let us therefore suppose that E h+aφ occurs and b = a. We seek to show that E h+bφ does not occur, so we can assume that all of the conditions in the definition of E h+bφ occur except possibly for the condition that D h+bφ (u, z) = D h+bφ (u, w). We seek to show that D h+bφ (u, z) = D h+bφ (u, w). Since there is a D h+aφ -geodesic and a D h+bφ -geodesic from w to u which do not enter V and φ is supported on V , we see that D h+aφ (u, w) = D h+bφ (u, w). On the other hand, since z ∈ V Lemma 2.5 implies that D h+aφ (u, z) < D h+bφ (u, z) if b > a, and one has the reverse inequality if b < a. This shows that D h+bφ (u, z) = D h+bφ (u, w), as required.
The remaining lemmas in this subsection are not needed for the proof of Theorem 1.2, but are needed in the proof of Theorem 1.3 to show that the adjacency graph of Voronoi cells on M n approximates its continuum counterpart.
Lemma A.7. Suppose h is a whole-plane GFF (with some choice of additive constant). Almost surely, z, w ∈ P λ h are joined by an edge in P λ h (i.e., their corresponding Voronoi cells intersect) if and only if there is a point u ∈ C such that D h (u, z) = D h (u, w) and D h (u, x) > D h (u, z), ∀x ∈ P λ h \ {z, w}.
The same is true with h replaced by a free-boundary GFF on a Jordan domain or an embedding of a quantum cone, sphere, disk, or wedge.
Proof. The proof is a slightly more complicated version of the proof of Lemma A.6. We will prove the lemma in the case when h is a free-boundary GFF on D, which implies the statement of the lemma in general by local absolute continuity. As in Lemma A.6, the lemma statement does not depend on the choice of additive constant for h. By the definition of Voronoi cells, z and w are joined by an edge in P λ h if and only if there is a point u ∈ D for which D h (z, u) = D h (w, u) and D h (u, x) ≥ D h (u, z) for each x ∈ P λ h \ {z, w} (this is equivalent to the condition that u ∈ H z ∩ H w ). We need to show that a.s. there is some u ∈ H z ∩ H w for which one has strict inequality in this last condition.
Step 1: reducing to an event with deterministic sets. For open sets V ⊂ V ⊂ D with V ⊂ V and V = D, let E h = E h (V, V ) be the event that the following is true.
1. Each u ∈ H z ∩ H w satisfies D h (u, x) = D h (u, z) for some x ∈ P λ h \ {z, w}.
Almost surely, each cell in H λ h contains a Euclidean neighborhood of its center point. Furthermore, a.s. #P λ h is finite. From this, it follows that if there exists z, w ∈ P λ h for which condition 1 in the definition of E h occurs, then in fact there exists open sets V ⊂ V ⊂ D with V ⊂ V and V = D such that E h (V, V ) occurs, and we can take V and V to be finite unions of Euclidean balls with rational centers and radii (we emphasize that V and V will typically not be connected).
It thus suffices to show that P[E h ] = 0 for any fixed deterministic choice of V and V . Henceforth fix such a deterministic choice of V and V . If we condition on the event {#P λ h = n} for n ∈ N (i.e., conditional on h we let P λ h be a collection of n independent samples from µ h , normalized to be a probability measure) then adding a constant to h does not affect the occurrence of the event E h . We can therefore assume without loss of generality that the additive constant for h is fixed so that µ h (U ) = 0 for some deterministic open set U ⊂ C which is disjoint from V .
Step 2: randomly perturbing the field. Consider a smooth bump function φ : D → [0, 1] with φ| V ≡ 1 and φ| D\V ≡ 0. As in the proof of Lemma A.6, for a ∈ R, the joint laws of h, P λ h and h + aφ, P λ h are mutually absolutely continuous. We emphasize that this still holds even though we are always sampling P λ h with intensity measure λµ h , not λµ h+aφ . Let E h+aφ be defined in the same manner as above but with D h+aφ , P λ h in place of h, P λ h . Also let A be a standard Gaussian random variable, independent from everything else. Since the laws of h, P λ h and h + Aφ, P λ h are mutually absolutely continuous, it suffices to show that The same is true with h replaced by a free-boundary GFF on a Jordan domain or an embedding of a α-quantum cone for α < Q, a quantum sphere, sphere, a quantum disk, or an α-quantum wedge for α < Q.
Proof. By Lemma A.7, it is a.s. the case that for each z, w ∈ P λ h with H z ∩ H w = ∅, there is a point u ∈ H z ∩ H w with D h (u, x) > D h (u, z) = D h (u, w) for each x ∈ P λ h \ {z, w}. Hence we can find > 0 such that each point v ∈ B (u; D h ) is strictly D h -closer to either z or w than to any x ∈ P λ h \ {z, w}. Since D h a.s. induces the same topology as the Euclidean metric, there a.s. exists δ > 0 such that B δ (u) ⊂ B (u; D h ). By Lemma A.6, a.s. ∂H z and ∂H w have zero Lebesgue measure, hence empty interior. Hence B δ (u) intersects the interiors of both H z and H w . Let γ 1 (resp. γ 2 ) be a D h -geodesic from z (resp. w) to a point of B δ (u) which lies in the interior of H z (resp. H w ). By Lemma A.2, a.s. γ 1 (resp. γ 2 ) is contained in the interior of H z (resp. H w ), so each point of γ 1 (resp. γ 2 ) is strictly closer to z (resp. w) than any other point of P λ h . We now obtain the path γ in the statement of the lemma by concatenating γ 1 , the straight line between the points in B δ (u) which are endpoints of γ 1 and γ 2 , and the time reversal of γ 2 .
The last lemma in this subsection is needed to show that the boundary-touching Voronoi cells on a planar map M n approximate the boundary-touching Voronoi cells for the Brownian disk.
Lemma A.9. Suppose h is a free-boundary GFF on a Jordan domain or an embedding of a quantum disk or an α-quantum wedge for α < Q. Fix λ > 0. Almost surely, for each z ∈ P λ with H z ∩∂D = ∅, there is a u ∈ H z ∩ ∂D for which  Proof. This follows from exactly the same argument used to prove Lemmas A.7 and A.8.