Convergence of the free Boltzmann quadrangulation with simple boundary to the Brownian disk
Ewain Gwynne, Jason Miller

TL;DR
This paper proves that certain random quadrangulations with boundary converge to a continuous limit called the Brownian disk, using a sophisticated topology for curve-decorated metric spaces, and describes the limit of decorated sphere quadrangulations.
Contribution
It establishes the convergence of free Boltzmann quadrangulations with boundary to the Brownian disk in the GHPU topology, extending understanding of scaling limits of random planar maps.
Findings
Quadrangulations converge to the Brownian disk in GHPU topology.
Decorated sphere quadrangulations converge to a space formed by gluing two Brownian disks.
The results connect discrete random maps with continuous random metric spaces.
Abstract
We prove that the free Boltzmann quadrangulation with simple boundary and fixed perimeter, equipped with its graph metric, natural area measure, and the path which traces its boundary converges in the scaling limit to the free Boltzmann Brownian disk. The topology of convergence is the so-called Gromov-Hausdorff-Prokhorov-uniform (GHPU) topology, the natural analog of the Gromov-Hausdorff topology for curve-decorated metric measure spaces. From this we deduce that a random quadrangulation of the sphere decorated by a -step self-avoiding loop converges in law in the GHPU topology to the random curve-decorated metric measure space obtained by gluing together two independent Brownian disks along their boundaries.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Convergence of the free Boltzmann quadrangulation with
simple boundary to the Brownian disk
Ewain Gwynne
MIT
Jason Miller
Cambridge
Abstract
We prove that the free Boltzmann quadrangulation with simple boundary and fixed perimeter, equipped with its graph metric, natural area measure, and the path which traces its boundary converges in the scaling limit to the free Boltzmann Brownian disk. The topology of convergence is the so-called Gromov-Hausdorff-Prokhorov-uniform (GHPU) topology, the natural analog of the Gromov-Hausdorff topology for curve-decorated metric measure spaces. From this we deduce that a random quadrangulation of the sphere decorated by a -step self-avoiding loop converges in law in the GHPU topology to the random curve-decorated metric measure space obtained by gluing together two independent Brownian disks along their boundaries.
Contents
-
2.4 Radon-Nikodym derivative estimates for quadrangulations with general boundary
-
2.6 Scaling limit of free Boltzmann quadrangulations with random perimeter
-
3 Peeling processes on quadrangulations with simple boundary
-
3.3 Boundary length and area processes and their scaling limits
-
3.4 Comparing peeling processes on free Boltzmann quadrangulations and the UIHPQ
-
4.2 Estimates for the peeling-by-layers process on the UIHPQ
-
4.3 Coupling a free Boltzmann quadrangulation with the UIHPQ
1 Introduction
1.1 Overview
A planar map is a connected graph embedded in the sphere with two such maps declared to be equivalent if they differ by an orientation-preserving homeomorphism of the sphere. Random planar maps are a natural model of discrete random surfaces. In recent years, it has been shown that there exist continuum random surfaces, i.e. random metric spaces, called Brownian surfaces which arise as the scaling limits of uniform random planar maps of various types in the Gromov-Hausdorff topology. The convergence of uniform random planar maps toward Brownian surfaces is expected to be universal in the sense that different uniform random planar map models (e.g., triangulations, quadrangulations, general maps) with the same topology all converge in the scaling limit to the same Brownian surface.
The best-known Brownian surface is the Brownian map, which has the topology of the sphere and has been shown to be the scaling limit of a number of different uniform random planar map models on the sphere in [Mie13, Le 13, ABA17, BJM14, Abr16, BLG13]. In this paper, we will primarily be interested in the Brownian disk [BM17], which is the scaling limit of uniform random planar maps with the topology of the disk. Other Brownian surfaces include the Brownian plane, which is the scaling limit of the uniform infinite planar quadrangulation [CL14]; and the Brownian half-plane, which is the scaling limit of the uniform infinite planar quadrangulation with general or simple boundary [GM17c, BMR16].
A quadrangulation with boundary is a random planar map whose faces all have degree four except for one special face, called the external face, whose degree is allowed to be arbitrary. The boundary of is the border of the external face and the perimeter of is the degree of the external face. One can consider both quadrangulations with general boundary, where the boundary is allowed to have multiple edges and multiple vertices; and quadrangulations with simple boundary, where the boundary is constrained to be simple.
It is shown in [BM17] that the Brownian disk is the scaling limit of uniform random quadrangulations with general boundary as both the perimeter and number of internal faces properly rescaled converge to given positive values. However, [BM17] does not treat the case of quadrangulations with simple boundary since their proof is based on a variant of the Schaeffer bijection [Sch97, BDFG04] for quadrangulations with boundary which does not behave nicely if one conditions the boundary to be simple. In [Bet15, Section 8.1], it is left as an open problem to show that the Brownian disk is also the scaling limit of uniformly sampled quadrangulations with simple boundary.
The main purpose of this paper is to prove a variant of this statement for quadrangulations with simple boundary having fixed perimeter, but not fixed area. In particular, we will consider the free Boltzmann distribution on quadrangulations with simple boundary with fixed perimeter (defined precisely in Definition 1.1 below) and show that a quadrangulation sampled from this distribution converges in law in the scaling limit to the free Boltzmann Brownian disk, a variant of the Brownian disk with fixed boundary length, but random area.
We will prove this scaling limit result in a stronger topology than the Gromov-Hausdorff topology. Namely, we will show that a free Boltzmann quadrangulation with simple boundary equipped with its natural area measure and the path which traces its boundary converges to a free Boltzmann Brownian disk equipped with its natural area measure and boundary path in the Gromov-Hausdorff-Prokhorov-uniform (GHPU) topology, the natural analog of the Gromov-Hausdorff topology for curve-decorated metric measure spaces [GM17c].
Our scaling limit result for free Boltzmann quadrangulations with simple boundary will be deduced from another theorem which says that a uniform random quadrangulation with general boundary and its simple-boundary core, which is the largest sub-graph which is itself a quadrangulation with simple boundary, converge jointly in law in the scaling limit to two copies of the same Brownian disk in the GHPU topology.
Free Boltzmann quadrangulations with simple boundary are particularly natural since these quadrangulations arise as the bubbles disconnected from when one performs the peeling procedure on a uniform infinite planar quadrangulation either with no boundary or with simple boundary. More precisely, if we reveal the face incident to the root edge, then the bounded complementary connected components of this face are free Boltzmann quadrangulations with simple boundary. One also gets free Boltzmann quadrangulations with simple boundary from the peeling procedure on a free Boltzmann quadrangulation with simple boundary, which gives these quadrangulations a natural Markov property. Peeling was first introduced in the physics literature by Watabiki [Wat93], was first studied rigorously in [Ang03], and was developed further in several works including [BC13, CLG17, CM15, Ang05, AC15]. See Section 3 for more on the peeling procedure.
In the course of proving our main results, we obtain several results of independent interest concerning free Boltzmann quadrangulations with simple boundary and the uniform infinite half-plane quadrangulation (UIHPQ) which is their infinite-boundary length limit. We prove half-plane analogs of some of the results in [CLG17] for peeling processes on the uniform infinite planar quadrangulation as well as estimates which enable us to compare the local behavior of a free Boltzmann quadrangulation with simple boundary and the UIHPQ (see in particular Lemma 3.6, Lemma 3.7, and Proposition 4.6).
The results of this paper enable us to prove that various curve-decorated random quadrangulations converge in the scaling limit to -Liouville quantum gravity surfaces decorated by independent SLE8/3 or SLE6 [Sch00] curves. For , a -Liouville quantum gravity (LQG) surface is, heuristically speaking, the random Riemann surface parameterized by a domain whose Riemannian metric tensor is , where is some variant of the Gaussian free field (GFF) on (see [DS11, She16, DMS14] for more on -LQG surfaces). This does not make rigorous sense since is a distribution, not a function, so does not take values at points. However, it is shown in [DS11] that a -LQG surface admits a natural measure and in [MS15b, MS16a, MS16b], building on [MS16d, MS15a, MS15c], that in the special case when , a -LQG surface admits a natural metric.
Certain special -LQG surfaces are equivalent as metric measure spaces to Brownian surfaces. In particular, the Brownian disk (resp. half-plane, map) is equivalent to the quantum disk (resp. -quantum wedge, quantum sphere). Moreover, it is shown in [MS16b] that the conformal structure of a -LQG surface (represented by the distribution ) is a.s. determined by its metric measure space structure. This gives us a canonical embedding of a Brownian surface into a domain in .
Quadrangulations with simple boundary can be glued together along their boundaries to obtain uniform random quadrangulations decorated by some form of a self-avoiding walk (SAW); see [BG09, BM17] for the case of quadrangulations with finite simple boundary case and [CC16] for the case of the UIHPQ. It is shown in [GM16a] that the uniform infinite SAW-decorated quadrangulations obtained by gluing together UIHPQ’s along their boundaries converge in the scaling limit in the local GHPU topology to the analogous continuum curve-decorated metric measure spaces obtained by gluing together copies of the Brownian half-plane along their boundaries. These limiting spaces can be identified with -Liouville quantum gravity surfaces decorated by SLE8/3-type curves using the results of [GM16b].
As a consequence of our scaling limit results for free Boltzmann quadrangulations with simple boundary and the results of [GM16a], we obtain finite-boundary analogs of the results of [GM16a]. In particular, we prove that a random quadrangulation of the sphere decorated by a self-avoiding loop of length , which can be obtained by identifying the boundaries of two independent free Boltzmann quadrangulations with simple boundary, converges in the scaling limit in law as with respect to the GHPU topology to a pair of independent Brownian disks glued together along their boundaries. Due to local absolute continuity between the Brownian disk and the Brownian half-plane and the results of [GM16b], this latter metric measure space locally looks like a -Liouville quantum gravity surface decorated by an independent SLE8/3-type loop.
The results of this paper will also be used in [GM17b] to prove scaling limit results for a free Boltzmann quadrangulation with simple boundary (resp. the UIHPQ) decorated by a critical ( [AC15]) face percolation exploration path toward the Brownian disk (resp. Brownian half-plane), equivalently the quantum disk (resp. -quantum wedge) decorated by an independent chordal SLE6 [Sch00]. It is shown in [GM17a] that the law of a chordal SLE6 on a quantum disk with fixed area is uniquely characterized by its equivalence class as a curve-decorated topological measure space plus the fact that the internal metric spaces corresponding to the complementary connected components of the curve stopped at each time are independent free Boltzmann Brownian disks. The scaling limit results proven in the present paper allows us to check these conditions for a subsequential scaling limit of face percolation on a free Boltzmann quadrangulation with simple boundary.
Acknowledgements J.M. thanks Institut Henri Poincaré for support as a holder of the Poincaré chair, during which part of this work was completed. We thank an anonymous referee for helpful comments on an earlier version of this article.
1.2 Preliminary definitions
In this subsection we give precise definitions of the objects involved in the statements of our main results.
1.2.1 Quadrangulations with boundary
Here we state several definitions for quadrangulations; see Figure 1 for an illustration.
A quadrangulation with (general) boundary is a (finite or infinite) planar map with a distinguished face , called the exterior face, such that every face of other than has degree . The boundary of , denoted by , is the smallest subgraph of which contains every edge of incident to . The perimeter of is defined to be the degree of the exterior face, with edges counted according to multiplicity. We note that the perimeter of a quadrangulation with boundary is always even.
For and , we write for the set of pairs where is a quadrangulation with boundary having interior faces and perimeter and is an oriented edge of , called the root edge.
We say that has simple boundary if is a simple path, i.e. it has no vertices or edges of multiplicity bigger than . We will typically denote quadrangulations with general boundary with a hat and quadrangulations with simple boundary without a hat.
For and , we write for the set of pairs where is a quadrangulation with simple boundary having boundary edges and interior edges and is an oriented edge in , called the root edge. By convention, we consider the trivial quadrangulation with one edge and no interior faces to be a quadrangulation with simple boundary of perimeter 2 and define to be the set consisting of this single quadrangulation, rooted at its unique edge. We define for .
For a quadrangulation with general boundary, we define its simple-boundary components to be the maximal sub-quadrangulations of having at least one interior face whose boundary is simple and is a sub-graph of . Equivalently, the simple-boundary components of are the interior faces of the planar map . We define the simple-boundary core of to be the simple-boundary component of with the largest boundary length, with ties broken by some arbitrary deterministic convention.
A boundary path of a quadrangulation with simple or general boundary is a path from (if is finite) or (if is infinite) to which traces the edges of (counted with multiplicity) in cyclic order. Choosing a boundary path is equivalent to choosing an oriented root edge on the boundary. This root edge is , oriented toward .
We define the free Boltzmann partition function by
[TABLE]
where here we set .
Definition 1.1**.**
For , the free Boltzmann distribution on quadrangulations with simple boundary and perimeter is the probability measure on which assigns to each element of a probability equal to .
It is shown in [BG09] that .
The uniform infinite half-plane quadrangulation with simple (resp. general) boundary, abbreviated UIHPQ (resp. UIHPQ) is the infinite rooted quadrangulation (resp. ) with infinite simple (resp. general) boundary which is the Benjamini-Schramm local limit [BS01] in law based at the root edge of a uniform sample from (resp. ) as , then , tends to [CM15, CC15].
When we refer to a free Boltzmann quadrangulation with perimeter , we mean the UIHPQ.
1.2.2 The Brownian disk
For , the Brownian disk with area and perimeter is the random curve-decorated metric measure space with the topology of the disk which arises as the scaling limit of uniform random quadrangulations with boundary (see [BM17] for the case of uniform quadrangulations with general boundary). The Brownian disk can be constructed as a metric space quotient of via a continuum analog of the Schaeffer bijection [BM17], using a Brownian motion conditioned to first hit at time and a “label process” on the continuum random forest constructed from the excursions of above its running minimum. We will not need this construction here so we will not review it carefully; see [BM17, Section 2] for the precise definition. The area measure is the pushforward of Lebesgue measure on under the quotient map. The path , called the boundary path, parameterizes according to its natural length measure. Precisely, for is the image under the quotient map of the first time at which the encoding function hits .
Following [BM17, Section 1.5], we define the free Boltzmann Brownian disk with perimeter to be the random curve-decorated metric measure space obtained as follows: first sample a random area from the probability measure , then sample a Brownian disk with boundary length and area . Note that the law of the area of the free Boltzmann Brownian disk with perimeter can be obtained by scaling the law of the area of the free Boltzmann Brownian disk with perimeter by . Consequently, it follows from [BM17, Remark 3] that the free Boltzmann Brownian disk with perimeter can be obtained from the free Boltzmann Brownian disk with perimeter 1 by scaling areas by , boundary lengths by , and distances by .
1.2.3 The Gromov-Hausdorff-Prokhorov-uniform metric
In this subsection we will review the definition of the Gromov-Hausdorff-Prokhorov-uniform (GHPU) metric from [GM17c], which is the metric with respect to which our scaling limit results hold.
For a metric space , we let be the space of continuous curves which are “constant at ,” i.e. extends continuously to the extended real line . Each curve can be viewed as an element of by defining for and for .
- •
Let be the -Hausdorff metric on compact subsets of .
- •
Let be the -Prokhorov metric on finite measures on .
- •
Let be the -uniform metric on .
Let be the set of -tuples where is a compact metric space, is a finite Borel measure on , and .
Given elements and of , a compact metric space , and isometric embeddings and , we define their GHPU distortion by
[TABLE]
We define the Gromov-Hausdorff-Prokhorov-uniform (GHPU) distance by
[TABLE]
where the infimum is over all compact metric spaces and isometric embeddings and . It is shown in [GM17c, Proposition 1.3] that is a complete separable metric on provided we identify two elements of which differ by a measure- and curve- preserving isometry.
There is also a local variant of the GHPU metric for locally compact curve-decorated length spaces equipped with a locally finite Borel measure, which is obtained from the GHPU metric by restricting to metric balls centered at , then integrating over all the possible radii of these balls; see [GM17c] for more details.
Remark 1.2** (Graphs as elements of ).**
In this paper we will often be interested in a graph equipped with its graph distance . In order to study continuous curves in , we identify each edge of with a copy of the unit interval and extend the graph metric on by requiring that this identification is an isometry. If is a path from some discrete interval into , we extend from to by linear interpolation. If is a finite graph and we are given a finite measure on vertices of and a curve in and we view as a connected metric space and as a continuous curve as above, then is an element of .
1.3 Main results
1.3.1 Joint convergence of a quadrangulation with general boundary and its simple-boundary core
Our first main result shows that a uniform random quadrangulation with general boundary and its simple-boundary core converge jointly in the scaling limit in the GHPU topology to the same Brownian disk; note that the boundary paths are scaled differently.
Let and let be a sequence of pairs of positive integers such that and as . For , let be sampled uniformly from and view as a connected metric space by identifying each edge with an isometric copy of the unit interval as in Remark 1.2.
For , let be the graph metric on , rescaled by . Let be the measure on which assigns a mass to each vertex equal to times its degree. Let be the boundary path of started from and extended by linear interpolation and let \widehat{\xi}^{n}(t):=\widehat{\beta}^{n}\mathopen{}\mathclose{{}\left(2^{3/2}n^{1/2}t}\right) for .
Also let be the simple-boundary core of , let be the graph metric on rescaled by , so that . Let be the measure on which assigns to each vertex a mass equal to times its degree, and note that coincides with on . Let be the boundary path of started from the first edge of hit by and extended by linear interpolation; and let \xi^{n}(t):=\beta^{n}\mathopen{}\mathclose{{}\left(\frac{2^{3/2}}{3}n^{1/2}t}\right) for . (The reason for the extra factor of 3 in the scaling for as compared to is that, as we will see, typically only about of the edges of are part of .)
For , define the curve-decorated metric measure spaces
[TABLE]
Also let be a Brownian disk with area and boundary length , equipped with its natural metric, area measure, and boundary path.
Theorem 1.3**.**
We have the joint convergence in law with respect to the Gromov-Hausdorff-Prokhorov-uniform topology as .
Since we already know in law in the GHPU topology [GM17c, Theorem 4.1], the main difficulty in the proof of Theorem 1.3 is showing the uniform convergence of the rescaled boundary path of ; indeed, the “Hausdorff” and “Prokhorov” parts of the Gromov-Hausdorff-Prokhorov-uniform convergence are easy consequences of [BM17, Theorem 1] and the fact that the boundary of the Brownian disk is simple. The convergence of the boundary path will be deduced from the explicit law of the “dangling quadrangulations” of the UIHPQ with general boundary (see Section 2.3) and a local absolute continuity argument.
1.3.2 Scaling limit of free Boltzmann quadrangulations with simple boundary
Theorem 1.3 implies in particular that certain quadrangulations with simple boundary having random area and perimeter converge to the Brownian disk in the GHPU topology. Our second main result shows that one also has convergence of random quadrangulations with simple boundary having fixed perimeter, but random area, toward the Brownian disk.
For , let be a free Boltzmann quadrangulation with simple boundary of perimeter (Definition 1.1) and view as a connected metric space by identifying each edge with an isometric copy of the unit interval as in Remark 1.2.
For , let be the graph metric on , rescaled by . Let be the measure on which assigns mass to each vertex equal to times its degree. Let be the boundary path of started from and extended by linear interpolation and let \xi^{l}(t):=\beta^{l}\mathopen{}\mathclose{{}\left(2lt}\right) for . Define the curve-decorated metric measure space \mathfrak{Q}^{l}:=\mathopen{}\mathclose{{}\left(Q^{l},d^{l},\mu^{l},\xi^{l}}\right). (Note that the scaling factors are different here than in Theorem 1.3 since we are fixing the perimeter rather than the area.)
Also let be a free Boltzmann Brownian disk with unit perimeter equipped with its natural metric, area measure, and boundary path.
Theorem 1.4**.**
We have in law with respect to the Gromov-Hausdorff-Prokhorov-uniform topology as .
Theorem 1.4 will be deduced from Theorem 1.3 by using the peeling procedure to compare a free Boltzmann quadrangulation with simple boundary and fixed perimeter to the core of a free Boltzmann quadrangulation with general boundary.
1.3.3 Quadrangulations of the sphere decorated by a self-avoiding loop
For , let and be independent free Boltzmann quadrangulations with simple boundary of perimeter . Let be their respective boundary paths, started from the root edges. Let be the quadrangulation of the sphere obtained by identifying the edges and for and let be the path corresponding to under this identification.
It is easy to see from Definition 1.1 that is distributed according to the free Boltzmann measure on triples consisting of an edge-rooted quadrangulation of the sphere and a self-avoiding loop of length based at the root edge, i.e. the measure which assigns to each such triple a probability proportional to , where is the set of faces of . In particular, the conditional law of given and is uniform over the set of all self-avoiding loops of length on based at .
We now state a scaling limit result for this self-avoiding loop-decorated quadrangulation in the GHPU topology, which is an exact finite-volume analog of [GM16a, Theorem 1.2]. For , let be the graph metric on rescaled by , let be the measure on which assigns to each vertex a mass equal to times its degree, and let for . Define the curve-decorated metric measure spaces .
Let be a pair of independent free Boltzmann Brownian disks with unit perimeter equipped with their natural metrics, area measures, and boundary paths (each started from the root edge). Let be the metric space quotient of and under the equivalence relation which identifies with for each (we recall the definition of the quotient metric in Section 1.4.3). Let be the measure on inherited from and let be the two-sided path on corresponding to the image of under the identification map. Define .
Theorem 1.5**.**
In the notation just above, in law with respect to the Gromov-Hausdorff-Prokhorov-uniform topology as .
Theorem 1.5 will be a consequence of Theorem 1.4, the scaling limit results for infinite-volume random SAW-decorated quadrangulations in [GM16a], and a local absolute continuity argument. Using essentially the same argument used to prove Theorem 1.5, one can also obtain analogous scaling limit results when one instead glues along a connected boundary arc rather than along their full boundaries; or when one identifies two -length boundary arcs of a single free Boltzmann quadrangulation with simple boundary of perimeter . These statements are finite-volume analogs of [GM16a, Theorems 1.1 and 1.3]. For the sake of brevity we do not include precise statements here.
In the infinite-volume case treated in [GM16a], the scaling limit of infinite SAW-decorated quadrangulations obtained by gluing together UIHPQ’s along their boundaries are identified with certain explicit -LQG surfaces decorated by various forms of SLE8/3. Due to the local absolute continuity between the Brownian disk and Brownian half-plane, we see that locally looks like a -LQG surface decorated by an independent SLE8/3 curve.
1.4 Notational conventions
In this subsection, we will review some basic notation and definitions which will be used throughout the paper.
1.4.1 Basic notation
We write for the set of positive integers and .
For with and , we define the discrete intervals and .
If and are two quantities, we write (resp. ) if there is a constant (independent of the parameters of interest) such that (resp. ). We write if and .
If and are two quantities depending on a variable , we write (resp. ) if remains bounded (resp. tends to 0) as or as (the regime we are considering will be clear from the context).
1.4.2 Graphs and maps
For a planar map , we write , , and , respectively, for the set of vertices, edges, and faces of .
By a path in , we mean a function for some (possibly infinite) discrete interval , with the property that the edges of can be oriented in such a way that the terminal endpoint of coincides with the initial endpoint of for each other than the right endpoint.
For sets consisting of vertices and/or edges of , we write \operatorname{dist}\mathopen{}\mathclose{{}\left(A_{1},A_{2};G}\right) for the graph distance from to in , i.e. the minimum of the lengths of paths in whose initial edge either has an endpoint which is a vertex in or shares an endpoint with an edge in ; and whose final edge satisfies the same condition with in place of . If and/or is a singleton, we do not include the set brackets. Note that the graph distance from an edge to a set is the minimum distance between the endpoints of and the set . We write for the maximal graph distance between vertices of .
For , we define the graph metric ball B_{r}\mathopen{}\mathclose{{}\left(A_{1};G}\right) to be the subgraph of consisting of all vertices of whose graph distance from is at most and all edges of whose endpoints both lie at graph distance at most from . If is a single vertex or edge, we write B_{r}\mathopen{}\mathclose{{}\left(\{x\};G}\right)=B_{r}\mathopen{}\mathclose{{}\left(x;G}\right).
1.4.3 Metric spaces
Here we introduce some notation for metric spaces and recall some basic constructions. Throughout, let be a metric space.
For we write for the supremum of the -distance between points in .
For , we write for the set of with . We emphasize that is closed (this will be convenient when we work with the local GHPU topology). If is a singleton, we write .
Let be an equivalence relation on , and let be the corresponding topological quotient space. For equivalence classes , let be the set of finite sequences of elements of such that , , and for each . Let
[TABLE]
Then is a pseudometric on (i.e., it is symmetric and satisfies the triangle inequality), which we call the quotient pseudometric. The quotient pseudometric possesses the following universal property. Suppose is a -Lipschitz map such that whenever with . Then factors through the metric quotient to give a 1-Lipschitz map such that , where is the quotient map. To see this, we define , where is any element of the equivalence class (this is well-defined by our assumption on ). To check that is one-Lipschitz, observe that for any and any , we can find such that the sum on the right side of (1.5) differs from by at most . Since is 1-Lipschitz and by the triangle inequality,
[TABLE]
Since is arbitrary, we conclude.
For a curve , the -length of is defined by
[TABLE]
where the supremum is over all partitions of . Note that the -length of a curve may be infinite.
For , the internal metric of on is defined by
[TABLE]
where the infimum is over all curves in from to . The function satisfies all of the properties of a metric on except that it may take infinite values.
1.5 Outline
The remainder of this paper is structured as follows.
In Section 2, we prove of Theorem 1.3 in the following manner. We first recall the Schaeffer-type bijections for quadrangulations with general boundary and the UIHPQ and the “pruning” procedure which allows one to recover the UIHPQ as the simple-boundary core of the UIHPQ. We use these bijections to establish local absolute continuity estimates for the boundary paths of uniform quadrangulations with general boundary and the UIHPQ. These estimates together with the explicit description of the laws of the dangling quadrangulations of the UIHPQ enable us to show that the rescaled paths and in Theorem 1.3 are typically close in the uniform topology when is large. We will then deduce Theorem 1.3 from this statement and the scaling limit result [BM17, Theorem 1] for the Brownian disk. In Section 2.6 we explain why Theorem 1.3 implies Proposition 2.9, which is a variant of Theorem 1.4 where the boundary length of the free Boltzmann quadrangulation with simple boundary is a random variable which is typically of order when is large; in particular, has the law of times the perimeter of the core of a free Boltzmann quadrangulation with general boundary of perimeter .
Most of the remainder of the paper is focused on deducing Theorem 1.4 from Proposition 2.9. The basic idea of the proof is to use the peeling procedure to remove a small cluster from whose complement has the law of a free Boltzmann quadrangulation with perimeter , where is small and is a random variable with the law in Proposition 2.9 with in place of , independent from .
In Section 3, we recall the definition of the peeling procedure for quadrangulations with simple boundary, introduce some notation to describe it, and review some relevant formulas. We then prove several estimates for general peeling processes. We obtain in Proposition 3.3 a scaling limit result for the joint law of the area and boundary length processes of an arbitrary peeling process on the UIHPQ analogous to the result [CLG17, Theorem 1] for peeling processes on the UIPQ; and in Section 3.4 we prove Radon-Nikodym derivative estimates which allow us to compare peeling processes on free Boltzmann quadrangulations with simple boundary and the UIHPQ.
In Section 4, we introduce the peeling-by-layers process for quadrangulations with simple boundary, which approximates the growing family of filled metric balls centered at an edge on the boundary. This process is a variant of the peeling-by-layers process for the UIPQ introduced in [CLG17] (and the analogous process for the UIPT introduced in [Ang03]). We then prove several estimates for this peeling process in the case of the UIHPQ which will be transferred to estimates in the case of the free Boltzmann quadrangulation with simple boundary using the estimates of Section 3.4.
In Section 5, we conclude the proof of Theorem 1.4 and use it to deduce Theorem 1.5.
2 Proof of Theorem 1.3 via the Schaeffer bijection
In Sections 2.1 and 2.2 we will review the Schaeffer-type constructions of quadrangulations with general boundary and of the UIHPQ. We will also review the so-called pruning procedure by which one obtains an instance of the UIHPQ from an instance of the UIHPQ. In Sections 2.4 and 2.5, we use these constructions together with the results for the UIHPQ from [GM17c] to prove Theorem 1.3. In Section 2.6, we explain why Theorem 1.3 implies a scaling limit result for free Boltzmann quadrangulations with simple boundary and certain random perimeter.
We emphasize that this is the only subsection of the paper in which the Schaeffer-type constructions discussed just below are used.
2.1 Schaeffer bijection for quadrangulations with boundary
For , let be the set of triples where is a quadrangulation with general boundary having interior faces and boundary edges (counted with multiplicity), is an oriented root edge, and is a marked vertex. By Euler’s formula, the number of vertices of an element of is determined by and (in particular, it is given by ), so a uniform sample from can be recovered from a uniform sample from by forgetting the marked vertex (c.f. [BM17, Lemma 10]).
In this subsection we review a variant of the Schaeffer bijection for elements of which is really a special case of the Bouttier-Di Francesco-Guitter bijection [BDFG04]. Our presentation is similar to that in [CM15, Section 3.3], [BM17, Section 3.3], and [GM17c, Section 3.1].
For , a bridge of length is a function such that for each and . A bridge can be equivalently represented by the function which skips all of the upward steps. More precisely, let , for let be the smallest for which , and let .
For , a treed bridge of area and boundary length is an -tuple such that is a bridge of length ; and for is a rooted plane tree with a label function satisfying whenever and are joined by an edge and , where is constructed from as above; and the total number of edges in the trees for is . Let be the set of pairs consisting of a treed bridge of area and boundary length together with a sign (which will be used to determine the orientation of the root edge).
We now explain how to construct an element of from an element of . We first construct a rooted, labeled planar map with two faces as follows. For each , draw an edge connecting the root vertices and . Also draw an edge connecting and . Embed the cycle consisting of the vertices together with these edges into in such a way that the vertices all lie on the unit circle. We can extend this embedding to the trees in such a way that each is mapped into the unit disk and no two trees intersect. This gives us a planar map with an inner face of degree (containing all of the trees ) and an outer face of degree . Let be the oriented edge of from to and let be the label function on given by restricting each of the label functions for .
To construct a rooted, pointed quadrangulation with boundary, let be the contour exploration of the inner face of started from , i.e. the concatenation of the contour explorations of the trees . We abbreviate . Each is associated with a unique corner of the inner face of (i.e. a connected component of for small ). Let be an extra vertex not connected to any vertex of , lying in the interior face of . For , define the successor of to be the smallest (with elements of viewed modulo ) such that , or let if no such exists. For , draw an edge from the corner associated with to the corner associated with , or an edge from to if . Then, delete all of the edges of to obtain a map . The root edge of is the oriented edge from to (if ) or from to (if ), viewed as a half-edge on the boundary of the external face.
As explained in, e.g., [CM15, Section 3.2] and [BM17, Section 3.3], the above construction defines a bijection from to .
We now explain how an element of , and thereby an element of , can be encoded by a pair of integer-valued functions. For , let be chosen so that the vertex belongs to the tree and let
[TABLE]
so that is the concatenation of the contour functions of the trees , but with an extra downward step whenever we move between two trees. Let
[TABLE]
be the first time for which (so that for and ). Also let . To describe the law of the pair we need the following definition.
Definition 2.1**.**
Let be a (possibly infinite) discrete interval and let be a (deterministic or random) path with for each . The head of the discrete snake driven by is the (random) function whose conditional law given is described as follows. We set . Inductively, suppose and has been defined for . If , let be the largest for which ; or . If , we set . Otherwise, we sample uniformly from .
The following lemma, which also appears in [GM17c], is immediate from the definitions and the fact that the above construction is a bijection.
Lemma 2.2**.**
If we sample uniformly from , then the law of is that of a simple random walk started from 0 and conditioned to reach for the first time at time . The process is the head of the discrete snake driven by . The pair is independent from .
2.2 Schaeffer bijection for the UIHPQ
In this subsection we describe an infinite-volume analog of the bijection of Section 2.1 which encodes the UIHPQ which is alluded to but not described explicitly in [CM15, Section 6.1] and described in detail in [GM17c, BMR16]. See also [CC15] for a different encoding.
We first define the infinite-volume analog of the bridge . Let be given by the absolute value of a two-sided simple random walk with increments sampled uniformly from . Let be the ordered set of times for which , enumerated in such a way that is the smallest for which . Also let .
Conditional on , let be a bi-infinite sequence of independent triples where each is a rooted Galton-Watson tree whose offspring distribution is geometric with parameter ; and, conditional on each tree , the function is uniformly distributed over the set of all functions satisfying and whenever are connected by an edge.
To construct an instance of the UIHPQ from the above objects, we first construct a planar graph with two faces. Equip with the standard nearest-neighbor graph structure and embed it into the real line in . For , embed the tree into the upper half-plane in such a way that the vertex is identified with and none of the trees intersect each other or intersect except at their root vertices. The graph is the union of and the trees for with this graph structure. Let be the label function on the vertices of satisfying for each .
Let be the contour exploration of the upper face of shifted so that starts exploring the tree at time [math]. Define the successor of each time exactly as in the Schaeffer bijection (here we do not need to add an extra vertex since a.s. ). Then draw an edge connecting each vertex to for each and delete the edges of . This gives us an infinite quadrangulation with boundary . The root edge of is the oriented edge which goes from to . Then is an instance of the UIHPQ with general boundary.
As in Section 2.1, we re-phrase the above encoding in terms of random paths. For , let be chosen so that the vertex belongs to the tree and let
[TABLE]
be the contour function of the upper face of . Also let
[TABLE]
so that . Finally, define and .
The following is [GM17c, Lemma 3.5].
Lemma 2.3**.**
The pair is independent from and its law can be described as follows. The law of is that of a simple random walk started from [math] and the law of is that of a simple random walk started from [math] and conditioned to stay positive for all time (see, e.g., [BD94] for a definition of this conditioning for a large class of random walks). Furthermore, is the head of the discrete snake driven by (Definition 2.1).
2.3 Pruning the UIHPQ to get the UIHPQ
Recall from Section 1.2.1 that the UIHPQ is the Benjamini-Schramm local limit of uniformly random quadrangulations with simple boundary, as viewed from a uniformly random vertex on the boundary, as the area and then the perimeter tends to . The simple boundary core (Section 1.2.1) of the UIHPQ has the law of the UIHPQ. More precisely, suppose is a UIHPQ and let be the quadrangulation obtained from by pruning all of the “dangling quadrangulations” of which are joined to by a single vertex. Let be the edge immediately to the left of the vertex which can be removed to disconnect from (if such a vertex exists) or let if belongs to . Then is an instance of the UIHPQ.
One obtains a boundary path with from the boundary path for by skipping all of the intervals of time during which is tracing a dangling quadrangulation.
There is also an explicit sampling procedure which reverses the above construction (c.f. [CM15, Section 6.1.2] or [CC15, Section 6]). Let be a UIHPQ and conditionally on , let be an independent sequence of random finite quadrangulations with general boundary with an oriented boundary root edge, with distributions described as follows. Let be the right endpoint of the root edge . Each for is distributed according to the so-called unconstrained free Boltzmann distribution on quadrangulations with general boundary, which is given by
[TABLE]
for any quadrangulation with interior faces and , , boundary edges (counted with multiplicity) with a distinguished oriented root edge , where here is a normalizing constant. The quadrangulation is instead distributed according to
[TABLE]
for a different normalizing constant . We note that by [CC15, Equation (23)], the expected perimeter of for is equal to .
If we identify the terminal endpoint of with for each , we obtain an infinite quadrangulation with general boundary. We choose an oriented root edge for by uniformly sampling one of the oriented edges of . Then is a UIHPQ which can be pruned to recover .
2.4 Radon-Nikodym derivative estimates for quadrangulations with general boundary
In the remainder of this section, we assume that we are in the setting of Theorem 1.3, so that is a uniform quadrangulation with general boundary with interior faces and perimeter . To describe via the bijection of Section 2.1, we let be a marked vertex sampled uniformly from .
We denote the Schaeffer encoding for from Section 2.1 with an additional superscript , so that in particular is the contour function, is the label process, is the shifted label process, is a random walk bridge independent from , and is obtained from by skipping the upward steps. Also let be as in (2.2).
We also let be an instance of the UIHPQ with general boundary and define its Schaeffer encoding functions , , , , , and as in Section 2.2.
The aforementioned Schaeffer encoding functions have easy-to-describe laws and determine the corresponding quadrangulations in a local manner. This enables us to obtain Radon-Nikodym derivative estimates for the law of some part of with respect to the law of the corresponding part of . This technique has been used in [GM17c, BMR16] to couple a uniform quadrangulation with general boundary with the UIHPQ in such a way that they agree with high probability in a small neighborhood of the root edge (see [CL14] for an analogous statement for quadrangulations without boundary). In this subsection, we will prove weaker Radon-Nikodym derivative estimates which hold for a larger part of the quadrangulations in question. We start by proving a Radon-Nikodym estimate for the encoding functions.
Lemma 2.4**.**
For each , there exists and such that the following is true for each . On an event of probability at least (for the law of ), the law of is absolutely continuous with respect to the law of , with Radon-Nikodym derivative bounded above by .
Proof.
The proof is similar to that of [GM17c, Lemma 4.7]. Recall from Lemmas 2.2 and 2.3 that the law of is that of a simple random walk conditioned to first hit at time and the law of is that of an unconditioned simple random walk.
By [GM17c, Lemma 4.6] and Bayes’ rule (c.f. the proof of [GM17c, Lemma 4.7]), the Radon-Nikodym derivative of the law of with respect to the law of is given by f_{\epsilon}^{n}\mathopen{}\mathclose{{}\left(I^{\infty}(l^{n}-\epsilon n^{1/2})}\right) where for ,
[TABLE]
Since converges in law in the uniform topology to an appropriate conditioned Brownian motion [Bet10, Lemma 14], we can find and such that for ,
[TABLE]
Since , we can find and such that for and , we have .
Hence for , on the event the Radon-Nikodym of the law of is absolutely continuous with respect to the law of , with Radon-Nikodym derivative bounded above by . Since the conditional law of the shifted label function given coincides with the conditional law of given , we get the same Radon-Nikodym derivative estimate with the pairs and in place of and .
Recall that (resp. ) is obtained from and the bridge (resp. and the walk ) in the manner described in Section 2.1 (resp. Section 2.2). Recall also the processes and obtained from and , respectively, by considering only times when the path makes a downward step. A similar absolute continuity argument to the one given above shows that there exists , , and an event with such that for , the Radon-Nikodym derivative of the law of with respect to the law of on the event is bounded above by .
The pair (resp. ) is independent from (resp. ), so for it holds on that the law of the pair \mathopen{}\mathclose{{}\left((C^{n},L^{0,n})|_{[0,I^{n}(l^{n}-\epsilon n^{1/2})]_{\mathbbm{Z}}},b^{n}|_{[0,l^{n}-\epsilon n^{1/2}]_{\mathbbm{Z}}}}\right) is absolutely continuous with respect to the law of \mathopen{}\mathclose{{}\left((C^{\infty},L^{\infty,0})|_{[0,I^{\infty}(l^{n}-\epsilon n^{1/2})]_{\mathbbm{Z}}},b^{\infty}|_{[0,l^{n}-\epsilon n^{1/2}]_{\mathbbm{Z}}}}\right) with Radon-Nikodym derivative bounded above by . Since these processes determine and , respectively, via the same deterministic functional and , we obtain the statement of the lemma with . ∎
Let and be the boundary paths of our finite and infinite quadrangulations with general boundary, respectively, started from the root edge at time [math]. For , we can view as a planar map and as a path on it. This planar map can have non-trivial structure since is not necessarily a simple path. Hence it makes sense to consider the law of , without reference to the underlying map . Similar considerations hold for .
From Lemma 2.5, we obtain a Radon-Nikodym estimate for boundary paths, viewed without reference to the underlying map in the manner described just above.
Lemma 2.5**.**
For each , there exists and such that the following is true for each . On an event of probability at least (for the law of ), the law of is absolutely continuous with respect to the law of , with Radon-Nikodym derivative bounded above by .
Proof.
It is clear from the Schaeffer bijection (c.f. [GM17c, Remarks 3.1 and 3.4]) and a basic concentration estimate for the empirical distribution of the times when the simple random walk bridge and the random walk take a downward step that with probability tending to 1 as (with respect to the laws of each of and ), and are given by the same deterministic functional of and , respectively. The statement of the lemma therefore follows from Lemma 2.4. ∎
2.5 Proof of Theorem 1.3
In this subsection we will prove our scaling limit result for the simple-boundary core of . The main difficulty of the proof is the uniform convergence of the rescaled boundary path of . This will be extracted from the following proposition, which in turn will follow from the estimates of Section 2.4 and the analogous statement for the UIHPQ which is proven in [GM17c] using the pruning procedure of Section 2.3. Here we recall that is the boundary path of .
Proposition 2.6**.**
For each , there exists such that for , it holds with probability at least that the following is true. For each with , the number of edges in which belong to the simple-boundary core is between and .
For the proof of Proposition 2.6, we will need to consider the pruning procedure described in Section 2.3. Recall the UIHPQ and its boundary path . Also let be the UIHPQ with , as in Section 2.3.
For , let be the dangling quadrangulation of (i.e., the quadrangulation which can be disconnected from the core by removing a single vertex) such that either or and is attached to the right endpoint of . Similarly, for let be the dangling quadrangulation of such that either or and is attached to the right endpoint of . See Figure 2 for an illustration of these definitions. We note that is the same, as a set, as the set of dangling quadrangulations described in Section 2.3. However, the index in the present section corresponds to the boundary path of , so in particular it is possible that for .
The following lemma tells us that the size of a dangling quadrangulation is typically of constant order, independently of and .
Lemma 2.7**.**
For each , there exists such that the following is true. For each and each , we have and for each we have .
Proof.
If we condition on , then the root edge is sampled uniformly from . It follows that the law of is invariant under the operation of replacing with for any . Passing to the local limit shows that the law of the UIHPQ is invariant under the operation of replacing by for any . Therefore, the law of (resp. ) does not depend on . It is clear that is a.s. finite, so for each there exists such that for , we have .
It remains to prove an upper bound for the size of . By [GM17c, Proposition 4.5] there exists and such that for , we can couple and in such a way that it holds with probability at least that the following is true. The graph metric balls and equipped with the graph structures they inherit from and , respectively, are isomorphic (as graphs) via an isomorphism which takes to and to .
By [GM17c, Lemma 4.9], the maximal rescaled diameter tends to [math] in law as . Hence by possibly increasing , we can arrange that with probability at least our coupling is such that . By combining this with the first paragraph of the proof we obtain the statement of the lemma. ∎
Proof of Proposition 2.6.
See Figure 3 for an illustration. For , let be the path obtained by erasing the loops from in the following manner. Let be the maximal discrete intervals in with the property that is a cycle which is not contained in any larger cycle in , ordered from left to right. For let where is the largest which is not contained in . Similarly construct from .
Since the boundary of the UIHPQ does not contain a cycle and the boundary of each is a cycle traced by , it follows that for each ,
[TABLE]
Similarly, if we let be the time at which finishes tracing then for ,
[TABLE]
Now fix and set
[TABLE]
Also fix to be chosen later, depending only on .
Recall from Section 2.3 that the ordered (from left to right) collection of distinct dangling quadrangulations other than is i.i.d., and the expected perimeter of each of these quadrangulations is 2; note here that the law of the quadrilateral dangling from the th edge of does not have the same law as since is more likely to be one of the dangling quadrangulations with longer perimeter. From this and the law of large numbers (see [GM17c, Lemma 4.12] for a careful justification) we infer that there exists such that for , it holds with probability at least that the following is true. For each with , the number of edges in which belong to is between and . By Lemma 2.7, by possibly increasing we can arrange that it holds with probability at least that . By (2.7), it holds with probability at least that
[TABLE]
By Lemma 2.5, by possibly increasing we can find that for , there is an event with such that on , the Radon-Nikodym derivative of the law of is absolutely continuous with respect to the law of , with Radon-Nikodym derivative bounded above by .
Set for this choice of . By (2.9) for , it holds with probability at least that
[TABLE]
By Lemma 2.7, by possibly increasing we can arrange that for , it holds with probability at least that . If this is the case and (2.10) holds, then necessarily since . By (2.8), for it holds with probability at least that
[TABLE]
By the re-rooting invariance of the law of (which comes from the fact that is sampled uniformly from ), we can apply the same argument with rooted at instead of to find that with probability at least , (2.11) also holds for each . By splitting a given interval into an interval contained in and an interval contained in , we obtain the statement of the proposition with in place of . Since can be made arbitrarily small, we conclude. ∎
Proof of Theorem 1.3.
By [GM17c, Theorem 4.1], in law in the GHPU topology. By the Skorokhod representation theorem, we can couple with in such a way that this convergence occurs a.s. By [GM17c, Proposition 1.5], for any such coupling we can a.s. find a compact metric space and isometric embeddings for and such that if we identify these spaces with their images under the corresponding embeddings then a.s. in the -Hausdorff distance, in the -Prokhorov distance, and in the -uniform distance. Henceforth fix such a coupling and such a space . We note that the isometric embedding restricts to an isometric embedding , so is identified with a subset of .
Since has the topology of a disk, it follows that the maximal -diameter of the dangling quadrangulations of tends to zero in probability as (see [GM17c, Lemma 4.9] for a careful justification). By possibly choosing a different coupling we can take this convergence to occur a.s. From this we infer that a.s. in the -Hausdorff distance and (since uniformly) that in the -Hausdorff distance.
Since each of the measures is supported on , we infer that any subsequential limit of the measures in the -Prokhorov distances is supported on and is dominated by . Since any such subsequential limit must be the zero measure. Therefore, in the -Prokhorov distance.
To show the uniform convergence of the re-scaled boundary paths, for and let be the smallest for which the number of edges of traversed by between times 0 and is at least . Equivalently, is the smallest time at which the un-scaled boundary path has traversed at least edges of . Then
[TABLE]
where the comes from rounding error. Note that the scaling factors in the time parameterizations of and differ by a factor of 3. By Proposition 2.6, the function converges uniformly to the identity function in probability, whence uniformly in probability. From this we infer that in probability, as required. ∎
2.6 Scaling limit of free Boltzmann quadrangulations with random perimeter
In this brief subsection, we explain why Theorem 1.3 implies a scaling limit result (Proposition 2.9) for a free Boltzmann quadrangulation with random boundary length. Most of the remainder of the paper will be devoted to transferring this result to the case when we specify the exact boundary length of the quadrangulation.
To state our result, we need to recall the definition of a free Boltzmann quadrangulation with general boundary, which appears, e.g., in [BM17, Section 1.4]. The free Boltzmann distribution on quadrangulations with general boundary of perimeter is the probability measure on (defined as in Section 1.2.1) which assigns to each a probability equal to , where is the partition function.
Free Boltzmann quadrangulations with general and simple boundaries are related by the following lemma.
Lemma 2.8**.**
Let and let be a free Boltzmann quadrangulation with general boundary of perimeter . If we condition on the rooted planar map then the conditional law of the collection of simple-boundary components of , each rooted at an oriented boundary edge which is chosen in a -measurable manner, is that of a collection of independent free Boltzmann quadrangulations with simple boundary with perimeters given by the perimeters of the internal faces of .
Proof.
Let by the (random) number of simple-boundary components of and let be these components, enumerated in the order in which their boundaries are first hit by the boundary path of started from . Also let for be a root edge for chosen in a -measurable manner.
Let be a possible realization of , let be the corresponding realization of , and let be the corresponding realizations of for . Also let be half the perimeter of .
There is a bijection from the set of possible realizations of with to : the forward bijection is obtained by taking the -tuple of simple-boundary components of such a realization, each rooted at the corresponding edge ; and the inverse bijection is obtained by identifying the boundary of each of the components of an element of with the boundary of the corresponding internal face of via an orientation-preserving map which takes the root edge to .
Suppose now that and let be the corresponding realization of satisfying . Each internal face of is an internal face of precisely one of the ’s. Therefore,
[TABLE]
By Euler’s formula, if is a quadrangulation with simple boundary then . Hence the right side of (2.6) equals
[TABLE]
where is a constant depending only on . Therefore, the conditional law of is as described in the statement of the lemma. ∎
From Lemma 2.8 and Theorem 1.3, we obtain the following variant of Theorem 1.4 when we randomize the perimeter, which will be used in subsequent sections to prove Theorem 1.4.
Proposition 2.9**.**
Fix and for let be a random variable whose law is that of , where is a free Boltzmann quadrangulation with general boundary of perimeter . Condition on , sample a free Boltzmann quadrangulation with simple boundary of perimeter and define the curve-decorated metric measure spaces for as in Theorem 1.4 with in place of . Then in law, where is the limiting curve-decorated metric measure space from Theorem 1.4.
Proof.
For let be a free Boltzmann quadrangulation with general boundary of perimeter and let be half the perimeter of its core. By Lemma 2.8, the conditional law given of (equipped with an oriented root edge chosen in a manner which depends only on ) is that of a free Boltzmann quadrangulation with simple boundary of perimeter . Hence we can couple with in such a way that a.s.
Let for be the (random) number of faces of . The proof of [BM17, Theorem 8] shows that converges in law as to the law of the area of a free Boltzmann Brownian disk with unit perimeter (alternatively, this can be extracted from Lemma 3.4 below, which is a re-statement of a result from [CLG17]). By Theorem 1.3 applied to the conditional law of given we obtain the statement of the proposition. ∎
3 Peeling processes on quadrangulations with simple boundary
In this section we will study general peeling processes on the UIHPQ and on free Boltzmann quadrangulations with simple boundary, which will be our main tool in the remainder of the paper (we will not have any further occasion to consider quadrangulations with general boundary or the Schaeffer bijection). In Section 3.1, we review the definition of the peeling procedure, introduce some notation to describe it, and recall some standard formulas and estimates for peeling steps in the UIHPQ.
In Section 3.3, we introduce the boundary length processes for a general peeling process on the UIHPQ; this result is an analog for the UIHPQ of the scaling limit result [AC15, Theorem 1] for the peeling process on the UIPQ, and is proven in the same manner.
In Section 3.4, we prove Radon-Nikodym estimates which enable us to compare peeling processes on free Boltzmann quadrangulations with simple boundary to peeling processes on the UIHPQ. The results of this latter subsection (especially Lemma 3.6) will be our main tool for studying peeling processes on free Boltzmann quadrangulations with simple boundary, both in the present paper and in [GM17c].
Remark 3.1**.**
All of the results of the present section have exact analogs for triangulations with simple boundary of type I (multiple edges and self-loops are allowed) or type II (multiple edges, but not self-loops, are allowed). The statements in either of the two triangulation cases are identical, modulo different choices of normalizing constants, and the proofs are essentially the same but sometimes slightly easier due to the simpler description of peeling in the triangulation case. See [Ang03, Ang05, AC15, Ric15] for more on peeling of triangulations with simple boundary.
3.1 General definitions and formulas for peeling
3.1.1 Peeling at an edge
Let be a finite or infinite quadrangulation with simple boundary. For an edge , let be the quadrilateral of containing on its boundary or let if is the trivial one-edge quadrangulation with no interior faces. If , the quadrilateral has either two, three, or four vertices in , so divides into at most three connected components, whose union includes all of the vertices of and all of the edges of except for . These components have a natural cyclic ordering inherited from the cyclic ordering of their intersections with .
If there are connected components of , we write for the vector whose th component for is , where is the th connected component of in counterclockwise order started from . We define if . Note that
[TABLE]
We refer to as the peeling indicator. Several examples of quadrilaterals and their associated peeling indicators are shown in Figure 4.
We note that determines the total boundary lengths of each of the connected components of , not just the lengths of their intersections with . Indeed, if the th component of is , then the total boundary length of the th connected component of in counterclockwise cyclic order is equal to
- •
if there is only one such component (Figure 4, leftmost illustration),
- •
if there is more than one component and is odd (Figure 4, three rightmost illustrations),
- •
if is even (Figure 4, second to the left and rightmost illustrations), and
- •
if is .
The procedure of extracting and from will be referred to as peeling at .
Suppose now that or that is infinite and .
- •
Let be the connected component of with on its boundary, or if (equivalently ).
- •
Let be the union of the components of other than or if .
- •
Let be the number of exposed edges of , i.e. the number of edges of which do not belong to (equivalently, those which are incident to ).
- •
Let be the number of covered edges of , i.e. the number of edges of which do not belong to (equivalently, one plus the number of such edges which belong to ).
See Figure 5 for an illustration of the above definitions.
3.1.2 Markov property and peeling processes
If is a free Boltzmann quadrangulation with simple boundary of perimeter for and we condition on , then the connected components of are conditionally independent. The conditional law of each of the connected components, rooted at one of the edges of on its boundary (chosen by some deterministic convention in the case when there is more than one such edge), is the free Boltzmann distribution on quadrangulations with simple boundary and perimeter (Definition 1.1), for a -measurable choice of . These facts are collectively referred to as the Markov property of peeling.
Due to the Markov property of peeling, one can iteratively peel a free Boltzmann quadrangulation with boundary to obtain a sequence of quadrangulations with simple boundary with explicitly described laws. To make this notion precise, let and let be a free Boltzmann quadrangulation with simple boundary with perimeter ; we also allow in the UIHPQ case (when ).
Suppose we are given a sequence of (possibly empty) quadrangulations with simple boundary for and edges for each with such that
[TABLE]
We refer to the quadrangulations as the unexplored quadrangulations. We also define the peeling clusters by
[TABLE]
equivalently and . We also define the peeling filtration by
[TABLE]
We say that is a peeling process targeted at if each of the peeled edges for is chosen in an -measurable manner. It follows from the Markov property of peeling that in this case, it holds for each that the conditional law of given the -algebra of (3.3) is that of a free Boltzmann quadrangulation with perimeter for some which is measurable with respect to (where here a free Boltzmann quadrangulation with perimeter [math] is taken to be the empty set).
We will typically denote objects associated with peeling processes on the UIHPQ by a superscript .
3.2 Peeling formulas for the UIHPQ
As explained in [AC15, Section 2.3.1], one has explicit formulas for the law of the peeling indicator (3.1) in the case when is a UIHPQ. With the free Boltzmann partition function from (1.1), one has
[TABLE]
We get the same formulas if we replace with or with either or .
By Stirling’s formula, the partition function satisfies the asymptotics
[TABLE]
where is a universal constant. From this, we obtain approximate versions of the probabilities (3.2).
[TABLE]
and similarly with the orders of the components of re-arranged. One can also write down the exact law of the peeling indicator variable in the case of a free Boltzmann quadrangulation with simple boundary, which is slightly more complicated than the formulas (3.2). We will not need this exact law here, however, since all of our estimates for peeling processes on free Boltzmann quadrangulations with simple boundary will be proven by comparison to the UIHPQ, using the estimates of Section 3.4.
By [AC15, Proposition 3], the number of covered and exposed edges (notation as in Section 3.1.1) satisfy
[TABLE]
in particular the expected net change in the boundary length of under the peeling operation is 0. We always have , but can be arbitrarily large. In fact, a straightforward calculation using (3.2) shows that for ,
[TABLE]
3.3 Boundary length and area processes and their scaling limits
Definition 3.2** (Boundary length and area processes).**
Let be a quadrangulation with simple boundary and let and be the clusters and unexplored quadrangulations of a peeling process of . For we define the exposed, covered, and net boundary length processes, respectively, by
[TABLE]
Note that and intersect only along their boundaries, so . We also define the area process by . In the case of a peeling process on the UIHPQ, we include an additional superscript in the notation for these objects.
In the remainder of this subsection, we specialize to the case of the UIHPQ. We will prove scaling limit results for the boundary length and area processes for this peeling process analogous to the scaling limit results for general peeling processes of the UIPQ and UIPT proven in [CLG17].
Let be a UIHPQ and let , , , and , respectively, be the clusters, unexplored quadrangulations, peeled edges, and filtration of a peeling process of the UIHPQ targeted at . We consider the scaling limit of the joint law of the net boundary length and area processes and . For and , define the scaling constant , where is the constant in (3.8). Define the rescaled boundary length and area processes by
[TABLE]
To describe the limit of the joint law of the processes (3.9), let be a totally asymmetric -stable process with no positive jumps, normalized so that its Lévy measure is . Conditionally on , let be an enumeration of the times when has a downward jump and write be the magnitude of the corresponding jump. Also let be an i.i.d. sequence of random variables with the law
[TABLE]
and for define
[TABLE]
Proposition 3.3**.**
For any peeling process of the UIHPQ, we have the joint convergence in law with respect to the local Skorokhod topology.
For the proof of Proposition 3.3, we will use the following result from [CLG17], which is the quadrangulation version of [CLG17, Proposition 9] (c.f. [CLG17, Section 6.2]).
Lemma 3.4**.**
Let and let be a free Boltzmann quadrangulation with simple boundary of perimeter . Then as ,
[TABLE]
and
[TABLE]
in law, where is a random variable with the law (3.10).
Proof of Proposition 3.3.
This is proven using essentially the same argument as the proof of [CLG17, Theorem 1], but we give the details for the sake of completeness.
By (3.8) and the heavy-tailed central limit theorem (see, e.g. [JS03]), in law in the local Skorokhod topology. Hence it remains to check the joint convergence.
For , , and let
[TABLE]
We first argue that for each , one has
[TABLE]
in law in the local Skorokhod topology. To see this, suppose that we have (using the Skorokhod representation theorem) coupled our UIHPQ with in such a way that a.s. in the local Skorokhod topology.
Fix and . We introduce a regularity event which will be used to get around the fact that a single peeled quadrilateral can disconnect two distinct free Boltzmann quadrangulations with simple boundary from . For let be the event that the following is true: there does not exist such that the disconnected quadrangulation has more than one connected component with perimeter at least . (Note that due to our choice of ). By (3.2), for each and each the probability that has two connected components with perimeters and is bounded above by a universal constant times . Summing this estimate over all and all shows that .
For let for be the times for which and let be the times for which . By the local Skorokhod convergence , we infer that a.s. for large enough and that for each .
For let be the larger simple-boundary component of the disconnected quadrangulation . If occurs, then the conditional law of given and the perimeters of these quadrangulations is that of a collection of independent free Boltzmann quadrangulations with simple boundary. The increment is at least and is at most 4 plus the total number of vertices in . The above estimate for together with Lemma 3.4 (applied to the smaller component of the disconnected quadrangulation) shows that
[TABLE]
in probability. From the convergence in law (3.12) in Lemma 3.4 and since can be made arbitrarily large, we obtain (3.13).
We next argue that for and ,
[TABLE]
with universal implicit constant. For each , the conditional law of given is stochastically dominated by plus twice the number of interior vertices of a free Boltzmann quadrangulation with simple boundary of perimeter (the factor of 2 comes from the fact that can have two connected components). By Lemma 3.4,
[TABLE]
By (3.8), we infer that
[TABLE]
Summing over all shows that (3.14) holds.
It is easy to see that a.s. uniformly on compact intervals as (c.f. the proof of [CLG17, Theorem 1]). Hence the proposition statement follows from (3.13) and (3.14) upon sending . ∎
3.4 Comparing peeling processes on free Boltzmann quadrangulations and the UIHPQ
Let be a UIHPQ, let be its boundary path with , and fix and an initial edge set . Let , , , and , respectively, be the clusters, unexplored quadrangulations, peeled edges, and filtration of a peeling process of the UIHPQ targeted at which satisfies the following property: for each , the peeled edge belongs to or , so that we never peel at an edge of which is not in .
In this subsection we will compare unconditional law of the peeling clusters and the conditional law of these clusters given the event that the boundary arc is precisely the set of edges of which are disconnected from by the peeled quadrilateral . Since the bounded complementary connected components of are free Boltzmann quadrangulations with simple boundary, the estimates of this subsection enable us to compare peeling processes on the UIHPQ and peeling processes on free Boltzmann quadrangulations with simple boundary of perimeter . We remark that similar ideas to the ones appearing in this subsection (but in the case of triangulations) appear in [Ang05, Section 4].
For the statements of our estimates, we will use the following notation, which is illustrated in Figure 6.
Definition 3.5**.**
Let and consider a peeling process and edge set as above.
- •
We write for the smallest for which contains an edge of .
- •
With the peeling indicator from Section 3.1.1, we write . Equivalently, is the event that the terminal endpoint of is a vertex of the peeled quadrilateral , and this quadrilateral has one vertex which is not in , so that is precisely the set of edges of disconnected from by .
We note that if occurs, then is the same as the first time at which the peeled quadrilateral belongs to . Indeed, since we cannot peel any edges in , the cluster must contain a path in the dual of from a quadrilateral which contains an edge of to a quadrilateral which contains an edge of , so must contain if occurs. On the other hand, contains the edge , so cannot belong to for .
By the Markov property of peeling if we condition on then the conditional law of the disconnected quadrangulation is that of a free Boltzmann quadrangulation with simple boundary of perimeter and our given peeling process run up to time is a peeling process of . Hence comparing peeling processes of and is equivalent to comparing the conditional law given of our peeling process run up to time to its unconditional law. The main tool which we will use for this purpose is the following elementary lemma.
Lemma 3.6**.**
Suppose we are in the setting described just above. Let be a stopping time for which is less than with positive probability. Then the conditional law of given restricted to the event is absolutely continuous with respect to the unconditional law of this same peeling process, with Radon-Nikodym derivative given by
[TABLE]
where here is the net boundary length process from Definition 3.2, is the free Boltzmann partition function as in (1.1), and the tends to zero as tends to , at a deterministic rate.
Proof.
Write and let be a realization of for which (equivalently, the realization of does not contain any edges outside of ). By Bayes’ rule,
[TABLE]
By (3.2),
[TABLE]
By the Markov property of peeling, if we condition on , then the conditional law of the unexplored quadrangulation , with the original root edge, is that of a UIHPQ. Note that since , the edge and the terminal endpoint of both belong to . The distance along from to the terminal endpoint of is equal to . By (3.2),
[TABLE]
with universal implicit constants. We obtain the first formula in (3.15) by combining (3.16), (3.17), and (3.18). The second formula follows from Stirling’s approximation (c.f. (3.5)). ∎
Lemma 3.6 will be our main tool for estimating the probabilities of events associated with peeling processes on a free Boltzmann quadrangulation with simple boundary. However, for the sake of completeness we will also record a slightly different estimate with a deterministic Radon-Nikodym derivative which will be needed in [GM17b]. The reader who only wants to see the proof of Theorem 1.4 can skip the remainder of this subsection.
Let be a discrete interval which is contained in and such that contains the initial edge set and let
[TABLE]
We note that if occurs, then necessarily .
Lemma 3.7**.**
For any event belonging to the -algebra ,
[TABLE]
with universal implicit constant.
In the statement of Lemma 3.7, it is crucial that does not depend on the peeling step at time . The idea of the proof of Lemma 3.7 is to prove deterministic estimates for the conditional law of given , which will in turn lead to estimates for the conditional expectation of the Radon-Nikodym derivative appearing in Lemma 3.6 at time given this -algebra.
Lemma 3.8**.**
Suppose we are in the setting of Lemma 3.7. Also let (resp. ) be the largest for which (resp. ) belongs to , or [math] if no such exists (note that either or must be positive). Then for ,
[TABLE]
with universal implicit constant.
Proof.
Let (resp. ) be the -graph distance from to (resp. ). Note that these quantities are well-defined since and belong to .
Let . By the Markov property of peeling, if we condition on and the event , then the conditional law of the peeled quadrilateral is the same as its conditional law given that it covers up at least edges of to the left of or at least edges of to the right or . By (3.2), the probability that this is the case is proportional to \mathopen{}\mathclose{{}\left(\ell_{L}\wedge\ell_{R}}\right)^{-3/2}. By combining this with (3.2), we obtain
[TABLE]
Suppose without loss of generality that . Then the right side of (3.20) is at most . This quantity is maximized over all possible values of at \ell_{L}=\frac{1}{7}\mathopen{}\mathclose{{}\left(\sqrt{k_{L}^{2}+23k_{L}k_{R}+k_{R}^{2}}-k_{L}-k_{R}}\right) where it equals
[TABLE]
From Lemma 3.7, we deduce estimates for the conditional law given of the left and right overshoot quantities and appearing in Lemma 3.8. For the statement of the estimates, we recall that on , we have , so and .
Lemma 3.9**.**
Suppose we are in the setting of Lemma 3.9 and let . For and ,
[TABLE]
with universal implicit constant. In particular,
[TABLE]
with universal implicit constant.
Proof.
To make the symmetry in our formulas more apparent, we define
[TABLE]
On the event , the number of covered edges at time (Definition 3.2) satisfies
[TABLE]
The number of exposed edges always satisfies , so
[TABLE]
By applying (3.24) to bound the Radon-Nikodym derivative from Lemma 3.6, we find that for as in the statement of the lemma,
[TABLE]
By Lemma 3.8 and since ,
[TABLE]
Combining (3.25) and (3.26) yields (3.21). We obtain (3.22) by summing (3.21) over all . ∎
Proof of Lemma 3.7.
Let and be as in Lemma 3.8 and let
[TABLE]
For an event as in the statement of the lemma, we have by Lemma 3.9 that
[TABLE]
On the other hand, if occurs then either or so by (3.24), . By Lemma 3.7,
[TABLE]
Summing (3.27) and (3.28) yields (3.19). ∎
4 Peeling by layers
In this section we introduce the peeling-by-layers process of a free Boltzmann quadrangulation with simple boundary, which is the only peeling process we will consider in the sequel. This peeling process is an analog for quadrangulations with boundary of the peeling-by-layers process for the UIPQ studied in [CLG17]. (A more complicated two-sided version of this peeling process for a pair of UIHPQ’s glued together along their boundaries appears in [GM16a, CC16].)
We will define the peeling-by-layers process in Section 4.1. In Section 4.2, we prove some estimates for the peeling-by-layers process on the UIHPQ, which can be transferred to estimates for free Boltzmann quadrangulations with simple boundary using the results of Section 3.4. In Section 4.3, we explain how the estimates of this paper enable us to couple a UIHPQ and a free Boltzmann quadrangulation with finite simple boundary in such a way that they agree in a neighborhood of the root edge with high probability.
4.1 The peeling-by-layers process
Let and let be a free Boltzmann quadrangulation with simple boundary of perimeter (so that is a UIHPQ if ). Also let ; we also allow in the case when . Fix a finite connected initial edge set which does not contain , in a manner which depends only on
We will inductively define a peeling process for targeted at called the peeling-by-layers process started from . Let , let be the quadrangulation with no internal faces whose edge set is .
Inductively, suppose and and have been defined for . If , we set and . Otherwise, let be an edge in which lies at minimal -graph distance from , chosen in a manner which depends only on and . Recalling the notation of Section 3.1.1, we peel at to obtain the quadrilateral and the planar map which it disconnects from in . Define
[TABLE]
By induction is a quadrangulation with simple boundary, and intersect only along their boundaries, and .
Define the peeling filtration
[TABLE]
where here is the peeling indicator variable from Section 3.1.1. Note that and are -measurable for .
Also define the boundary length processes , , and as in Definition 3.2 for the peeling-by-layers process.
We record for reference what the Markov property of peeling tells us in the setting of this subsection.
Lemma 4.1**.**
Let be an a.s. finite stopping time for the filtration from (4.1). The conditional law of given is that of a free Boltzmann quadrangulation with simple boundary with perimeter , where is the net boundary length process from Definition 3.2.
Proof.
This is immediate from the Markov property of peeling. ∎
For , let
[TABLE]
so that for is a stopping time for . The following lemma is the main reason for our interest in the peeling-by-layers process.
Lemma 4.2**.**
For , let be the filled graph metric ball of radius centered at , i.e. the subgraph of which is the union of and the set of all vertices and edges which it disconnects from (or if ). For each ,
[TABLE]
Proof.
It suffices to show inclusion of the vertex sets of the graphs in (4.3), since an edge in either of these graphs is the same as an edge of whose endpoints are both in the vertex set of the graph. We proceed by induction on . The base case (in which case ) is true by definition. Now suppose and (4.3) holds with in place of .
If we are given a vertex of B_{r}\mathopen{}\mathclose{{}\left(\mathbbm{A};Q}\right)\setminus\mathcal{V}(\dot{Q}_{J_{r-1}}), then there is a w\in B_{r-1}\mathopen{}\mathclose{{}\left(\mathbbm{A};Q}\right) with \operatorname{dist}\mathopen{}\mathclose{{}\left(w,\mathbbm{A};Q}\right)=r-1. By the inductive hypothesis, belongs to . By the definition (4.2) of , we have so we must have . Hence . Since contains every vertex or edge which it disconnects from , we obtain the first inclusion in (4.3).
For the second inclusion, we observe that the definition of implies that each of the peeled quadrilaterals for has a vertex which lies at -graph distance at most from . Hence each vertex of this quadrilateral lies at -graph distance at most from . Every vertex in is either contained in , incident to one of the quadrilaterals for , or disconnected from in by the union of and these quadrilaterals. By combining these observations with the inductive hypothesis that , we obtain the second inclusion in (4.3). ∎
4.2 Estimates for the peeling-by-layers process on the UIHPQ
For the proof of Theorem 1.4, we will require several estimates for the peeling-by-layers process introduced in the preceding subsection. Throughout this subsection, we consider only the case of the UIHPQ (i.e., ) and we target our process at (we will eventually transfer these estimates to the case of free Boltzmann quadrangulations with finite boundary using Lemma 3.6). We use the notation of Section 4.1 but include an additional superscript to denote the UIHPQ case.
Our first estimate is a bound for the number of covered edges in the radius- peeling-by-layers cluster, which is essentially proven in [GM16a].
Lemma 4.3**.**
Let and define the times when the peeling-by-layers clusters reach radius , as in (4.2). Also let be the covered boundary length process, as in Definition 3.2. For each and each , it holds that
[TABLE]
with implicit constant depending only on .
Proof.
For convenience we will deduce the lemma from [GM16a, Proposition 5.1], which gives a moment estimate for the analog of the peeling-by-layers process in the planar map obtained by gluing together two independent UIHPQ’s along their boundary. The statement of the lemma can also be obtained directly using an argument which is similar to but slightly simpler than the proof of [GM16a, Proposition 5.1].
By Lemma 4.2, the peeling-by-layers cluster is contained in the radius- filled metric ball in centered at (with respect to ). If we glue to another independent UIHPQ along their positive boundaries to obtain an infinite quadrangulation with boundary , then the radius- filled metric ball centered at in is contained in the radius- filled metric ball centered at in . By [GM16a, Lemma 4.3], the radius- glued peeling cluster for started from the initial edge set (as defined in [GM16a, Section 4.1]) contains this latter filled metric ball. Hence the statement of the lemma follows from [GM16a, Proposition 5.1]. ∎
We next prove an estimate which enables us to compare filled metric balls in the UIHPQ, which by Lemma 4.2 are essentially the same thing as peeling-by-layers clusters, to ordinary filled metric balls.
Lemma 4.4**.**
For each , there exists such that the following is true for each . Let be the filled metric ball of radius centered at the root edge, i.e. the subgraph of consisting of and all of the vertices and edges which it disconnects from . Then
[TABLE]
The statement of Lemma 4.4 is not immediate from the scaling limit result [GM17c, Theorem 1.12] for the UIHPQ toward the Brownian half-plane in the local GHPU topology since filled metric balls are not a continuous functional with respect to the local GHPU topology. We will still use [GM17c, Theorem 1.12] to prove Lemma 4.4, but the argument is not as straightforward as one might expect.
Proof of Lemma 4.4.
Let be the boundary path of satisfying . By Lemma 4.3, there exists such that for each , it holds with probability at least that which by Lemma 4.2 implies that
[TABLE]
We will now apply the scaling limit result [GM17c, Theorem 1.12]. Let be a Brownian half-plane equipped with its natural metric, area measure, and boundary path, with the root vertex. For , let be the continuum filled metric ball, i.e. the union of and the set of points in which are disconnected from by . Since the Brownian half-plane has the topology of the ordinary half-plane (see, e.g., [BMR16, Corollary 3.8]), it is one-ended. Consequently, each has finite diameter.
After possibly increasing the parameter in (4.5), we can find and such that with probability at least , the following hold.
B_{2}^{\bullet}\mathopen{}\mathclose{{}\left(\xi^{\infty}(0);d^{\infty}}\right)\subset B_{R/2}\mathopen{}\mathclose{{}\left(\xi^{\infty}(0);d^{\infty}}\right). 2. 2.
\xi^{\infty}(T)\in B_{R}\mathopen{}\mathclose{{}\left(\xi^{\infty}(0);d^{\infty}}\right)\setminus B_{4}^{\bullet}\mathopen{}\mathclose{{}\left(\xi^{\infty}(0);d^{\infty}}\right). 3. 3.
The diameter of with respect to the internal metric of on H^{\infty}\setminus B_{2}^{\bullet}\mathopen{}\mathclose{{}\left(\xi^{\infty}(0);d^{\infty}}\right) is at most .
If this is the case, then for each , there is a path of -length at most from to which does not enter . Hence for each such , there exist points such that , for each , and .
This latter condition behaves well under Gromov-Hausdorff limits. In particular, GHPU convergence of the UIHPQ to the Brownian half-plane [GM17c, Theorem 1.12] implies that for large enough , it holds with probability at least that the following is true. For each vertex in , there exist vertices v_{0},\dots,v_{k}\in\mathcal{V}\mathopen{}\mathclose{{}\left(Q^{\infty}\setminus B_{2r}\mathopen{}\mathclose{{}\left(\mathbbm{e}^{\infty};Q^{\infty}}\right)}\right) such that the -graph distances between each of and , and for , and and are at most . Let be the event that this is the case and that (4.5) holds, so that for large enough .
We claim that if occurs, then the event in (4.4) holds. Indeed, suppose to the contrary that there is a vertex v\in\mathcal{V}\mathopen{}\mathclose{{}\left(B_{r}^{\bullet}(\mathbbm{e}^{\infty};Q^{\infty}))\setminus B_{Rr}\mathopen{}\mathclose{{}\left(\mathbbm{e}^{\infty};Q^{\infty}}\right)}\right). By possibly replacing by an appropriate vertex along a geodesic from to , we can assume that belongs to B_{2Rr}\mathopen{}\mathclose{{}\left(\mathbbm{e}^{\infty};Q^{\infty}}\right). Choose vertices as in the definition of for this choice of . By (4.5), is separated from by the “annulus” B_{2r}(\mathbbm{e}^{\infty};Q^{\infty})\setminus B_{r}\mathopen{}\mathclose{{}\left(\mathbbm{e}^{\infty};Q^{\infty}}\right), so since the spacing between the ’s is at most , one of these vertices has to belong to this annulus, contrary to the definition of .
Thus (4.4) holds with probability at least for large enough . By possibly increasing (in a manner depending only on ), we can arrange that this is the case for every . ∎
We next prove an estimate which says that the times for the peeling-by-layers process started from the root edge are typically of order . Such an estimate does not follow immediately from [GM17c, Theorem 1.12] since the time parameterization of the peeling-by-layers process is not encoded in a simple way by the metric measure space structure of . We expect that one has a scaling limit result analogous to [CLG17, Theorem 2] for the times , but we do not need such a strong result here. So, for the sake of brevity we will instead prove only the following bound.
Lemma 4.5**.**
Let be the radius- times for the peeling-by-layers process of the UIHPQ with . For each , there exists such that for each ,
[TABLE]
Proof.
We will use the local GHPU scaling limit result for the UIHPQ to obtain upper and lower bounds for the area of , then use Proposition 3.3, Lemma 4.2, and Lemma 4.4 to argue that these lower bounds are violated if is either too small or too large.
First choose such that the conclusion of Lemma 4.4 is satisfied with in place of , so that by Lemma 4.2, for it holds that
[TABLE]
Let be an instance of the Brownian half-plane, equipped with its natural metric, area measure, and boundary path, so that is the marked boundary point. The measure a.s. assigns positive mass to open subsets of , so for each there exists such that
[TABLE]
By [GM17c, Theorem 1.12], the UIHPQ equipped with its graph metric rescaled by , the measure which assigns mass to each vertex equal to times its degree, and its boundary path re-parameterized by converges in the local GHPU topology to . By Lemma 4.2, (4.6), and (4.7) there exists such that for ,
[TABLE]
By Proposition 3.3, the number of vertices in is typically of order , i.e. we can find and such that for ,
[TABLE]
Set and . By (4.8) and (4.9) (the latter applied with ), for ,
[TABLE]
We similarly find that for large enough , it holds that . By possibly increasing to deal with finitely many small values of , we obtain the statement of the lemma with in place of . Since is arbitrary, we conclude. ∎
4.3 Coupling a free Boltzmann quadrangulation with the UIHPQ
In this subsection we will prove a lemma which gives that one can couple a UIHPQ and a free Boltzmann quadrangulation with simple boundary in such a way that they agree in a metric neighborhood of the root edge with high probability. Actually, we will prove a slightly stronger statement with filled metric balls in place of ordinary metric balls. The result of this subsection is not needed for the proof of Theorem 1.4, but it is of independent interest and is an easy consequence of our other estimates so we include it for the sake of completeness.
Let be a UIHPQ and for , let be a free Boltzmann quadrangulation with simple boundary of perimeter . Let be the edge of directly opposite from the root edge (i.e., if is the boundary path started from then ). For , let (resp. ) be the filled metric ball relative to (resp. ).
Proposition 4.6**.**
For each there exists and such that for , there is a coupling of with with the following property. With probability at least , the filled metric balls and equipped with the graph structures they inherit from and , respectively, are isomorphic (as graphs) via an isomorphism which takes to and to .
Proposition 4.6 is an analog in the setting of free Boltzmann quadrangulations with simple boundary of [GM17c, Proposition 4.5] (which treats the case of quadrangulations with general boundary) or [CL14, Proposition 9] (which treats the case of quadrangulations without boundary).
Proof of Proposition 4.6.
For , let (resp. ) be the radius- peeling-by-layers cluster of (resp. ) started from (resp. ) and targeted at (resp. ). By Lemma 4.2, it suffices to prove the statement of the lemma with and in place of and .
By Lemmas 4.3 and 4.5, there exists such that for ,
[TABLE]
By Proposition 3.3, the supremum of the net boundary length process up to time is typically of order , so there exists such that for , it holds with probability at least that and . If this is the case, then the exposed boundary length satisfies .
Choose . For , applying the above estimate with shows that it holds with probability at least that . By Lemma 3.6 (applied with the root edge of translated units to the left) we infer that on the event that this is the case, the Radon-Nikodym derivative of the law of the triple \mathopen{}\mathclose{{}\left(\dot{Q}_{J_{r}^{l}}^{l},\partial Q^{l}\cap\dot{Q}_{J_{r}^{l}}^{l},\mathbbm{e}^{l}}\right) with respect to the law of \mathopen{}\mathclose{{}\left(\dot{Q}_{J_{r}^{\infty}}^{\infty},\partial Q^{\infty}\cap\dot{Q}_{J_{r}^{\infty}}^{\infty},\mathbbm{e}^{\infty}}\right) is of order . Since is arbitrary, the statement of the proposition follows. ∎
5 Proofs of Theorems 1.4 and 1.5
5.1 Proof of Theorem 1.4
In this subsection we assume we are in the setting of Theorem 1.4 so that for , is a free Boltzmann quadrangulation with simple boundary of perimeter and is the corresponding rescaled curve-decorated metric measure space. We will deduce Theorem 1.4 from Proposition 2.9 in the following manner. For , we let be a random variable whose law is as in Proposition 2.9 with in place of , independent from . We grow the peeling-by-layers process of started from up to the first time that the boundary length of the unexplored quadrangulation is exactly .
On the event , this unexplored quadrangulation has the law of free Boltzmann quadrangulation with simple boundary of perimeter , so by Proposition 2.9 (equipped with its rescaled graph metric, area measure, and boundary path) converges in the scaling limit in the GHPU topology to a free Boltzmann Brownian disk of perimeter . We will show in Lemma 5.1 that is a good approximation for in the GHPU topology provided a certain regularity event occurs; and in Lemma 5.3 that this regularity event occurs with high probability. We will then deduce Theorem 1.4 by combining these statements.
We now proceed with the details. For , we consider the peeling-by-layers process of with initial edge set targeted at the edge directly opposite from in . We define the clusters , the unexplored quadrangulations , the peeled edges , the radius- times , and the -algebras for this process as in Section 4.1 and we define the boundary length processes , and as in Definition 3.2.
For and , let be a random variable whose law is that of , where is a free Boltzmann quadrangulation with general boundary of perimeter , independent from . Define the time
[TABLE]
By Lemma 4.1, on the event , the conditional law of the unexplored quadrangulation given and the peeling -algebra is that of a free Boltzmann quadrangulation with simple boundary of perimeter . Let be the internal graph metric on rescaled by , let , let be the boundary path of started from the rightmost edge of and extended by linear interpolation, and let for . Also define the curve-decorated metric measure space
[TABLE]
so that by Proposition 2.9, the conditional law of converges weakly to the law of a free Boltzmann Brownian disk of perimeter with respect to the GHPU topology .
The first main input in the proof of Theorem 1.4 tells us that is a good approximation to in the GHPU sense on a regularity event which (as we will see below) occurs with high probability. We split this event into two parts, one which is -measurable and one which is -measurable.
For , let be the event that the following hold:
[TABLE]
The event is in the peeling -algebra ; this is why we consider internal graph distances in instead of graph distances in itself.
For , also let
[TABLE]
Lemma 5.1**.**
For each and each , there exists such that for and each , it holds on that .
For the proof of Lemma 5.1, we will use the following general lemma about the GHPU metric.
Lemma 5.2**.**
Let and be elements of (recall Section 1.2.3). Let and suppose there is an injective map (not necessarily continuous) such that the following is true.
For each , one has . 2. 2.
The -Hausdorff distance between and is at most . 3. 3.
The -Prokhorov distance between and is at most . 4. 4.
The -uniform distance between and is at most .
Then .
Proof.
Define a metric on the disjoint union by
[TABLE]
and define in a symmetric manner if and . It is easily verified using condition 1 that satisfies the triangle inequality, so is a metric on . By condition 2 and since for each , we infer that the -Hausdorff distance between and is at most . Condition 3 implies that the -Prokhorov distance between and is at most (here is the only place where we use injectivity of ) and condition 4 implies that the -uniform distance between and is at most . ∎
Proof of Lemma 5.1.
Suppose occurs. We will check the hypotheses of Lemma 5.2 with , , and the inclusion map .
Since and , the exposed boundary length process satisfies and hence .
We first check that and distances are comparable. Suppose . It is clear that . To obtain an inequality in the reverse direction, let be a -geodesic from to (extended by linear interpolation). If does not enter , then clearly . Otherwise, let (resp. ) be the first (resp. last) time that enters (resp. exits) . Then so since the rescaled -boundary length distance from to is at most . By definition of , there exists a path in from to with -length at most . Concatenating , , and shows that
[TABLE]
Since , the -Hausdorff distance from to is at most . Since \#\mathcal{V}\mathopen{}\mathclose{{}\left(\dot{Q}_{T_{\delta}^{l}}^{l}}\right)\leq\epsilon l^{2} and is a quadrangulation with simple boundary, an Euler’s formula argument shows that \mu^{l}\mathopen{}\mathclose{{}\left(\dot{Q}_{T_{\delta}^{l}}^{l}}\right)\leq 2\epsilon+o_{l}(1) with the rate of the deterministic and universal (it comes from the fact that ). Hence the -Prokhorov distance between and is at most . By definition of , since , and since , the -uniform distance between and is at most .
Thus, for large enough , depending only on and , the conditions of Lemma 5.2 are satisfied on with , , the inclusion map, and in place of . So, the statement of the lemma follows from Lemma 5.2 ∎
Before we can deduce Theorem 1.4 from Proposition 2.9 and Lemma 5.1, we need to argue that the regularity event in Lemma 5.1 occurs with high probability. Actually, we will only explicitly write down an estimate for the probability of the event ; the estimate for is an easy consequence of Proposition 2.9 and is explained in the proof of Theorem 1.4.
Lemma 5.3**.**
Define the events as in (5.1). For each , there exists such that for each there exists such that for ,
[TABLE]
We will deduce Lemma 5.3 from an analogous estimate for the peeling-by-layers process on the UIHPQ and local absolute continuity, in the form of Lemma 3.6. Let be a UIHPQ independent from and consider the peeling-by-layers process of started from and targeted at . We define the objects associated with this process as in Section 4.1 and as per usual we denote these objects by a superscript .
In analogy with (5.1), define
[TABLE]
where here is the net boundary length process for our peeling-by-layers process. For , let be the event that
[TABLE]
Lemma 5.4**.**
For each , there exists such that for each there exists such that for ,
[TABLE]
Proof.
Fix to be chosen later. By Lemma 4.3 , there is a such that for ,
[TABLE]
Note here that is non-decreasing. By Proposition 3.3, by possibly shrinking we can arrange that also
[TABLE]
By Lemma 4.4, we can find such that for ,
[TABLE]
By Lemma 4.5, by possibly shrinking we can arrange that also
[TABLE]
By Proposition 3.3, the process converges in law in the local Skorokhod topology to a totally asymmetric -stable process with no upward jumps. In particular, there is a and an such that for ,
[TABLE]
By Proposition 2.9, the random variable converges in law to the constant . Hence for , there exists such that for ,
[TABLE]
Now set and suppose that the events in (5.6)–(5.11) occur, which happens with probability at least . We claim that occurs. Indeed, since for each , the event in (5.10) implies that hits every even integer in before time . The event in (5.11) implies that , so . The events in (5.6), (5.7), and (5.9) immediately imply that
[TABLE]
It remains only to check the distance condition in the definition of . Since , the event in (5.9) tells us that each vertex of lies at -graph distance at most from . We need to convert this to a bound for -graph distances. Let and let be a -geodesic from to . If stays in , then \operatorname{dist}\mathopen{}\mathclose{{}\left(\mathbbm{e}^{\infty},v;Q^{\infty}}\right)=\operatorname{dist}\mathopen{}\mathclose{{}\left(\mathbbm{e}^{\infty},v;\dot{Q}_{T_{\delta}^{\infty,l}}^{\infty}}\right) and we are done. Otherwise, let be the largest time in for which does not belong to and let be the terminal endpoint of . Then so by Lemma 4.2,
[TABLE]
By concatenating a -geodesic from to with the path from to in , we obtain the desired distance bound. ∎
Proof of Lemma 5.3.
For , let S^{l,\infty}(\epsilon):=\min\mathopen{}\mathclose{{}\left\{j\in\mathbbm{N}_{0}:Y_{j}^{\infty}\geq\epsilon l}\right\}. Since is non-decreasing, the event is -measurable. Since , the statement of the lemma now follows from Lemma 3.6 (applied at time ) and Lemma 5.4. ∎
Proof of Theorem 1.4.
Fix and for and , let be the curve-decorated metric measure space as in (5.2). For , let denote a free Boltzmann Brownian disk with perimeter . Then with as in the statement of the lemma, . From this we infer that there exists such that for , the Prokhorov distance between the laws of and with respect to the GHPU metric is at most .
Since the conditional law of given and on the event is that of a free Boltzmann quadrangulation with simple boundary of perimeter , Proposition 2.9 implies that for each there exists such that for , the Prokhorov distance between the conditional law of given and the law of with respect to the GHPU metric is at most . Hence the Prokhorov distance between the law of and the conditional law of given with respect to the GHPU metric is at most .
By Proposition 2.9 and the above scaling argument, there exists such that for each and , on the event it holds with conditional probability at least given and that the event of (5.4) occurs.
Set . By Lemma 5.3, there exists and such that for , the event occurs with probability at least .
By combining the preceding two paragraphs with Lemma 5.1 we find that with probability at least , we have and . Hence the Prokhorov distance between the law of and the conditional law of given is at most . Combining this with the conclusion of the second paragraph and using that can be made arbitrarily small concludes the proof. ∎
5.2 Proof of Theorem 1.5
Throughout this subsection we assume we are in the setting of Theorem 1.5, so that for , are free Boltzmann quadrangulations with simple boundary of perimeter identified along their boundary paths to obtain the curve-decorated graph .
Now that Theorem 1.4 has been established, the key difficulty in the proof of Theorem 1.5 is showing that paths between two given points of which cross the gluing interface more than a constant order number of times are not substantially shorter than paths which cross only a constant order number of times (recall from Section 1.4.3 the definition of the quotient metric); this is analogous to the key difficulty in the proofs of [GM16a]. In the present setting, this difficulty will be resolved using the results of [GM16a] and a local absolute continuity argument. We now state the key lemma needed for the proof.
For , , and , let be the event that there exists a path in from to which crosses at most times and has length at most
[TABLE]
Lemma 5.5**.**
For each , there exists and an event such that for each , there exists and such that for each and each ,
[TABLE]
Lemma 5.5 will be deduced from the infinite-volume scaling limit results of [GM16a] and a local absolute continuity lemma which follows from Lemma 3.6. Let us first record some consequences of [GM16a, Theorem 1.2], which is the infinite-volume analog of Theorem 1.5.
Let be a pair of independent UIHPQ’s, let be their respective boundary paths started from the root edge, and let be the map obtained by identifying and for each . Also let be the path corresponding to and .
By [GM16a, Theorem 1.2], the graph , equipped with its rescaled graph metric, its rescaled natural area measure, and a re-scaling of converges in law in the local GHPU topology to a curve-decorated metric measure space consisting of a pair of independent Brownian half-planes with their (full) boundary paths identified. By definition of the quotient metric (Section 1.4.3), it follows that graph distances in can be approximated by the lengths of paths which cross the gluing interface only a constant order number of times, in the following sense.
Lemma 5.6**.**
For each and each , there exists and such that for and , it holds with probability at least that the following is true. There exists a path in from to which crosses at most times and has length
[TABLE]
By [GM16a, Corollary 1.5], has the same law as a certain -LQG surface (namely a weight- quantum cone) decorated by an independent two-sided SLE8/3-type curve (which can be described in terms of a pair of GFF flow lines in the sense of [MS16c, MS17]). This curve is a.s. simple, so for with , the intersection contains no points of . From this and the above described local GHPU convergence, we infer the following.
Lemma 5.7**.**
For each with , each , and each , there exists and such that for ,
[TABLE]
The following local absolute continuity statement will be used to transfer the above lemmas to finite-volume statements.
Lemma 5.8**.**
For , let be a free Boltzmann quadrangulation with simple boundary of perimeter and let be its boundary path with . For each , there exists and such that the following is true for each . On an event of probability at least (with respect to the law of ), the law of the curve-decorated graph \mathopen{}\mathclose{{}\left(B_{\alpha l^{1/2}}(\beta^{l}\mathopen{}\mathclose{{}\left([\delta l,(1-\delta)l]_{\mathbbm{Z}});Q^{l}}\right),\beta^{l}|_{[\delta l,(2-\delta)l]_{\mathbbm{Z}}}}\right) is absolutely continuous with respect to the law of its UIHPQ analog \mathopen{}\mathclose{{}\left(B_{\alpha l^{1/2}}(\beta^{\infty}\mathopen{}\mathclose{{}\left([\delta l,(2-\delta)l]_{\mathbbm{Z}});Q^{\infty}}\right),\beta^{\infty}|_{[\delta l,(1-\delta)l]_{\mathbbm{Z}}}}\right), with Radon-Nikodym derivative bounded above by a universal constant times .
Proof.
By Theorem 1.4 and since the boundary path of the Brownian disk has no self-intersections, there exists and such that for ,
[TABLE]
By Lemma 4.2, on the event the radius- peeling-by-layers cluster of started from \beta^{l}\mathopen{}\mathclose{{}\left([\delta l,(2-\delta)l]_{\mathbbm{Z}}}\right) and targeted at contains no edge of \beta^{l}\mathopen{}\mathclose{{}\left([0,\tfrac{\delta}{2}l]_{\mathbbm{Z}},[(2-\tfrac{\delta}{2})l,2l]_{\mathbbm{Z}}}\right) so the peeling-by-layers clusters reach radius before hitting and its net boundary length process at time (Definition 3.2) satisfies . The statement of the lemma follows by combining this with Lemma 3.6. ∎
Proof of Lemma 5.5.
Define
[TABLE]
Then for are connected, overlapping arcs of and any two edges of are contained in one of these three arcs. We will prove the lemma by applying Lemma 5.8 on each of the arcs for to transfer the estimate of Lemma 5.6 from to .
By Lemma 5.8 (applied with and in place of ) and the invariance of the law of under re-rooting along the boundary, there exists and such that the following is true. For each , there is an event such that for , we have and on , the law of the curve-decorated graph \mathopen{}\mathclose{{}\left(B_{\alpha_{0}l^{1/2}}\mathopen{}\mathclose{{}\left(\beta_{\pm}^{l}(I_{i}^{l});Q^{l}}\right),\beta_{\pm}^{l}|_{I_{i}^{l}}}\right) is absolutely continuous with respect to the law of \mathopen{}\mathclose{{}\left(B_{\alpha_{0}l^{1/2}}\mathopen{}\mathclose{{}\left(\beta_{\pm}^{\infty}\mathopen{}\mathclose{{}\left(I_{1}^{l}}\right);Q^{\infty}}\right),\beta_{\pm}^{\infty}|_{I_{1}^{l}}}\right), with Radon-Nikodym derivative bounded above by a universal constant.
By combining the preceding Radon-Nikodym derivative estimate with Lemma 5.7, we find that there exists and such that for , we have where
[TABLE]
Note that on , each path in between points of with length at most (e.g., the path in the definition of the event just above the lemma statement for and if ) must stay in B_{\alpha_{0}l^{1/2}}\mathopen{}\mathclose{{}\left(\xi_{-}^{l}(I_{i}^{l});Q_{-}^{l}}\right)\cup B_{\alpha_{0}l^{1/2}}\mathopen{}\mathclose{{}\left(\xi_{+}^{l}(I_{i}^{l});Q_{+}^{l}}\right). In particular, for the occurrence of the event \mathopen{}\mathclose{{}\left\{\operatorname{dist}(\beta_{\operatorname{Glue}}^{l}(k_{0}),\beta_{\operatorname{Glue}}^{l}(k_{1});Q_{\operatorname{Glue}}^{l})\leq\alpha l^{1/2}}\right\}\cap F_{N,\zeta}^{l}(k_{0},k_{1})^{c} is determined by what happens inside of B_{\alpha_{0}l^{1/2}}\mathopen{}\mathclose{{}\left(\xi_{-}^{l}(I_{i}^{l});Q_{-}^{l}}\right)\cup B_{\alpha_{0}l^{1/2}}\mathopen{}\mathclose{{}\left(\xi_{+}^{l}(I_{i}^{l});Q_{+}^{l}}\right).
By our Radon-Nikodym derivative estimate when we restrict to , the preceding paragraph, and our bound for the probability of the infinite-volume analogue of from Lemma 5.6, for each , there exists and such that for , each , and each ,
[TABLE]
Since any two integers are both contained in one of , , or , we obtain the statement of the lemma. ∎
Proof of Theorem 1.5.
For , let be the graph metric on rescaled by , let be the measure on which assigns to each vertex a mass equal to times its degree, and let for . Define the one-sided curve-decorated metric measure spaces .
Since the restriction of the graph metric on to each of is bounded above by the graph metric on , we easily deduce GHPU tightness of from GHPU tightness of (Theorem 1.4) and the GHPU compactness criterion [GM17c, Lemma 2.6]. Hence for any sequence of positive integers tending to , there exists a subsequence and a coupling of a random curve-decorated metric measure space with two independent free Boltzmann Brownian disks with unit boundary length such that
[TABLE]
in law with respect to the GHPU topology on each coordinate as . By the Skorokhod representation theorem, we can couple so that this convergence occurs a.s.
Let be the curve-decorated metric measure space obtained by metrically gluing and together along their boundary paths as in the theorem statement. By elementary limiting arguments directly analogous to those in [GM16a, Section 7.3] (but somewhat simpler, since we are working with compact spaces so there is no need to “localize”) and the universal property of the quotient metric, we infer that there a.s. exists a surjective 1-Lipschitz map such that , , and the restrictions are isometries from to , equipped with the internal metric induced by . We need to show that is itself an isometry. We will accomplish this by taking a limit of the estimate of Lemma 5.5.
To this end, fix , let be as in Lemma 5.5, and for let be the event of that lemma. Also let be an enumeration of the pairs of rational times and (using Lemma 5.5 with ) choose for each a and an such that for ,
[TABLE]
For , let be the event that occurs and occurs for each with and , so that .
Let be the event that occurs for infinitely many , so that . Passing to the limit in the definition of shows that on , it is a.s. the case that for each pair of rational times for such that with , there exists points and signs with
[TABLE]
Hence .
Since is dense in for each , is a curve-preserving isometry, and and are continuous, we infer that on ,
[TABLE]
By breaking up a -geodesic between two arbitrary points in into segments of time length (hence diameter) at most and recalling that is an isometry for the internal metrics on the two sides of the curves and , we see that (5.13) implies that is an isometry. Therefore as curve-decorated metric measure spaces, so since our initial choice of subsequence was arbitrary we obtain the theorem statement. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[ABA 17] L. Addario-Berry and M. Albenque. The scaling limit of random simple triangulations and random simple quadrangulations. Ann. Probab. , 45(5):2767–2825, 2017, 1306.5227 . MR 3706731
- 2[Abr 16] C. Abraham. Rescaled bipartite planar maps converge to the Brownian map. Ann. Inst. Henri Poincaré Probab. Stat. , 52(2):575–595, 2016, 1312.5959 . MR 3498001
- 3[AC 15] O. Angel and N. Curien. Percolations on random maps I: Half-plane models. Ann. Inst. Henri Poincaré Probab. Stat. , 51(2):405–431, 2015, 1301.5311 . MR 3335009
- 4[Ang 03] O. Angel. Growth and percolation on the uniform infinite planar triangulation. Geom. Funct. Anal. , 13(5):935–974, 2003, 0208123 . MR 2024412
- 5[Ang 05] O. Angel. Scaling of Percolation on Infinite Planar Maps, I. Ar Xiv Mathematics e-prints , December 2005, math/0501006 .
- 6[BC 13] I. Benjamini and N. Curien. Simple random walk on the uniform infinite planar quadrangulation: subdiffusivity via pioneer points. Geom. Funct. Anal. , 23(2):501–531, 2013, 1202.5454 . MR 3053754
- 7[BD 94] J. Bertoin and R. A. Doney. On conditioning a random walk to stay nonnegative. Ann. Probab. , 22(4):2152–2167, 1994. MR 1331218
- 8[BDFG 04] J. Bouttier, P. Di Francesco, and E. Guitter. Planar maps as labeled mobiles. Electron. J. Combin. , 11(1):Research Paper 69, 27, 2004, math/0405099 . MR 2097335 (2005 i:05087)
