WorksMathematics
Internal diameter bounds for DLA on random planar maps under invariance principles
Abstract
We establish sublinear bounds for the internal diameter of External Diffusion Limited Aggregation (DLA) clusters on random planar maps. We develop two conditional DLA growth results for deterministic planar maps: the weaker condition yielding sublinear growth for DLA, and the stronger yielding polynomially sublinear growth for DLA. We then verify the strong assumption a.s. for the -mated CRT maps, and the weak condition a.s. for ergodic scale-free random environments, establishing the corresponding a.s bounds.
Introduction
External Diffusion Limited Aggregation (DLA) is a discrete-time random growth process on a graph, consisting of a sequence of increasing subgraphs, in which new edges and vertices are added at each step according to the harmonic measure from a target vertex or . While a number of variants of DLA have been studied, rigorous results regarding the process have been scarce. This paper is principally concerned with establishing bounds on the size and shape of DLA on random planar geometries as time tends to . Two notions of size can be considered: 1) external diameter, in which the DLA cluster is viewed as a subset of the ambient graph, and diameter of the cluster is measured with respect to the ambient graph metric, and 2) internal diameter, in which the DLA cluster is viewed as a graph in its own right, and the diameter of that graph is measured. The latter notion is more informative of the shape of the DLA cluster. Indeed, consider a spiral curve on a graph versus a radially expanding ball. These increasing subgraphs may have the same external diameter, but from the perspective of the internal diameter these are polar opposites.
While there does exist limited literature on the external diameter of DLA on random planar maps, to our knowledge no sublinear upper bounds have been established for the internal diameter. The purpose of this paper is to derive these bounds on the internal diameter of DLA. The primary tool used in this paper is quenched control of the random walk on the random planar map, i.e. control of the random walk conditional on the random environment. Such properties have been established for large classes of random planar maps (see e.g. [28]), and so the results of this paper are expected to generalize to a number of models.
As the inputs to our arguments are almost sure quenched statements, we typically work with a deterministic underlying geometry, and indeed our main results (Theorems 1.6 and 1.10) are stated as black boxes for deterministic planar maps. Transfer to random planar map models then follows by a simple application of the deterministic theorem to the relevant random planar map model on the appropriate event (§ 1.3).
We deal with two notions of quenched control of random walk: 1) almost sure quenched convergence of random walk to Brownian motion (Assumption 1.4), and 2) almost sure quenched mesoscopic control of random walk (Assumption 1.8). The first assumption is sufficient to establish that the internal diameter of the DLA cluster is , and the second (stronger) assumption allows one to prove that the internal diameter of the DLA cluster is with . For our principal example, which is the -mated continuum random tree (CRT) map (Definition 1.11), the exponent will be related to the Liouville quantum gravity (LQG) parameter .
We now define DLA, and follow the presentation in [29]. Below, denotes the vertices of the graph ; see § 1.6 for a more detailed discussion of notation.
Definition 1.1 (External DLA). Let be an infinite, connected graph, and let . External DLA from to is a sequence of random subgraphs of with , and with defined as follows:
If , terminate the process, i.e. for all .
Otherwise, run a simple random walk from , conditioned to hit , and consider the edge first traversed from into . Define as the union of , and the endpoint of in .
External DLA targeted at is the same process with the harmonic measure from replaced with harmonic measure from , where such a measure is well defined.
Unless otherwise stated, we work with recurrent rooted graphs , DLA starts from and is targeted at , and harmonic measure from is assumed to be unique and well-defined. A rooted set is a vertex subset containing . For a fixed deterministic graph, almost sure statements about DLA refer to its growth randomness.
There are several notions of diameter for which DLA has been studied. [29] concerns the diameter of considered as a subset of , which is the so-called external diameter, and is denoted . This paper concerns the internal diameter, which considers as a graph in its own right, and is denoted . As this paper only concerns the internal diameter, we write for short.
Definition 1.2 (DLA growth exponent). The (internal) growth exponent of DLA from to on a connected rooted graph is defined as the limit
when it exists.
We now proceed to state our main results, and the properties on which they rely.
Property 1: Quenched convergence of random walk to Brownian motion
First, we require a few definitions, beginning with an embedding of a graph into . For the definition of a proper embedding in the plane, we follow the presentation of [35 Section 2.4].
Definition 1.3 (Proper embedding in the plane). Define a proper embedding of a graph into the plane as a locally finite topological embedding of vertices and edges into .
Subsequently, we refer to the object in Definition 1.3 as an embedding. We normalize the embedding so that . A random walk on is mapped into under the embedding in the obvious way; we refer to this as the embedded walk. For finite curves parametrized by , set
where ranges over increasing homeomorphisms of . The function induces a metric on curves viewed modulo parametrization, with curves of zero -distance considered equivalent [1].
For , let be the embedded walk started from and stopped at its first exit from (which may be in the interior of an edge). Subsequently, we will choose as a radius multiplier and as the non-normalized scale for the embedded graph. A normalized scale corresponds to the radius before rescaling. Let be standard planar Brownian motion started from and stopped on leaving . We write for law and for law with starting point . We can now state the first of the aforementioned invariance principles in the form of Assumption 1.4.
Assumption 1.4 (Random walk convergence hypothesis). For every , we have
where is the Prokhorov distance induced by .
The above assumption states that the rescaled embedded random walk converges in law to Brownian motion (modulo parametrization) uniformly over starting points in compact subsets of . Using Assumption 1.4 we can establish an analogue of Kesten’s Beurling estimate on . Below, is the harmonic measure on the edges out of viewed from , and is the set of edges out of incident to ; see § 1.6 for a more precise discussion.
Theorem 1.5 (Weak Beurling estimate). Under Assumption 1.4, we have
Using Theorem 1.5, we can prove sublinearity of the internal diameter of the DLA cluster. We state this result as a theorem rather than a corollary, as DLA is the focus of this paper.
Theorem 1.6 (Sublinear growth). Let be DLA started from the root and targeted at . Under Assumption 1.4, we have
almost surely.
The conclusion also holds for DLA started from any other vertex : adjoining a fixed path from to transfers the harmonic measure bound from sets with to sets , up to a finite multiplicative constant depending on the path (see Equation (4)).
Property 2: Quenched mesoscopic control of random walk
The assumption and results of this subsection require slightly more information than that of Assumption 1.4. Our planar map, rather than being presented by merely an embedding, is given by a cellular embedding. We combine the presentation from [27, Definition 1.6 and [26].
Definition 1.7 (Cellular embedding in the plane). A cellular embedding into consists of:
A locally finite collection of compact connected subsets of with nonempty interiors, denoted by , such that and for all distinct .
A planar graph , consisting of vertices and unweighted edges .
A bijection from to such that only if .
We write and normalize so that the root cell contains .
For and , write and . A path is said to disconnect two vertex sets if its vertices intersect every path in the graph joining them.
We choose to present the mesoscopic result in the context of a cellular embedding because it is slightly more natural for the -mated CRT map application, but the subsequent assumption and theorems can be readily adapted to the planar embedding data of Assumption 1.4.
The above definition is implicit in [26], and is a special case of [28 Definition 1.15]. The more general definition, which is called a cell configuration, has in place of items 2 and 3 in Definition 1.7 a symmetric adjacency relation with only if and , and a symmetric function representing conductance. The graph structure can be encoded by . We leave the adjacency and conductances implicit in the notation , but will discuss the more general notion of cell configuration in § 7, in which we sketch a proof for an analogue of Theorems 1.5 and 1.6 with more general edge weights (called conductances).
We can now introduce the mesoscopic invariance principle assumption. This assumption involves three functions which depend on the non-normalized scale :
, which is the mesoscopic scale lower bound at non-normalized scale .
, which is the net approximation error at non-normalized scale .
, which is the maximal cell diameter at non-normalized scale .
Assumption 1.8 (Mesoscopic control hypothesis). There are constants and , a minimal non-normalized scale , and functions
such that the following hold.
and .
Every cell intersecting has Euclidean diameter at most .
For every there exist finite -nets and such that for every and every a simple random walk started from has probability at least to disconnect from before exiting , before exiting , with the union of cells visited up to and including exit contained in .
for some , for every sufficiently large finite connected containing $o.
We now briefly describe the above assumption in words. Item 1 controls the size of the mesoscopic scale lower bound relative to the non-normalized scale, net error and diameter, item 2 states the cell diameter control enforced by , item 3 provides a lower bound on the disconnection probability for each fixed scale and center in the nets, and 4 provides control of the diameter of the cellular embedding of a vertex subset in terms of its cardinality which enables the passage to intrinsic graph geometry from embedded graph geometry.
The use of nets in item 3 is to enable a union bound argument which provides a quantitative upper bound on the failure probability of the above assumption for random planar maps, which is necessary to apply Borel-Cantelli and conclude mesoscopic control at all sufficiently large non-normalized scales. In principle, one could strengthen item 3 to hold for all , which would allow one to weaken the limit condition in item 1 to , but this becomes more difficult to verify for e.g. the -mated CRT maps.
As with Assumption 1.4, we can prove a Beurling-type estimate using Assumption 1.8, albeit a stronger one than that of Theorem 1.5.
Theorem 1.9 (Strong Beurling estimate). Under Assumption 1.8, there exists and a finite threshold such that
for all finite rooted connected with and all .
Using Theorem 1.9, we establish the polynomially sublinear bounds on the internal diameter of DLA, again stated as a theorem.
Theorem 1.10 (Polynomially sublinear growth). Let be DLA started from the root and targeted at . Under Assumption 1.8, there exists a deterministic such that
almost surely.
As with Theorem 1.6, this result can be transferred to an arbitrary initial vertex. The stronger mesoscopic control allows one to upper bound the growth exponent by .
Transfer to random planar maps
The primary random planar map model of interest in this paper will be the so-called mated CRT map, which we now define. We follow the presentation of [26 Section 1.1].
Definition 1.11 (Mated CRT map). Fix and let be a two sided two-dimensional Brownian motion such that
and normalized with . The -mated CRT map for is the random graph with vertices , and where vertices with connected by an edge if and only if
or the same condition holds for . If both conditions hold for , then the vertices are connected by two edges. We denote this random planar map, rooted at , by . We observe that by identifying with the law of does not depend on by Brownian scaling.
When the parameter is obvious or unimportant, we refer to the above graph simply as the mated CRT map. Note that the above definition does not immediately specify a planar embedding of . However, due to the relationship between the mated CRT map, Schramm-Loewner evolution (SLE), and LQG, it does come equipped with a canonical cellular embedding; this is presented in § 2.2.
By an application of Theorem 1.10 to the mated CRT map a.s., one can achieve an upper bound on the DLA growth exponent (Definition 1.2). As random planar maps are the principal concern of this paper, rather than deterministic ones, we record the consequences of Theorems 1.6 and 1.10 in the following theorem.
Theorem 1.12 (DLA on the -mated CRT). Fix . Then there exists a such that DLA started from the root and targeted at on the -mated CRT map satisfies a.s.
Using [28] one can make a rather strong and general claim: growth of DLA on an arbitrary ergodic scale free random environment (in particular, those obeying the hypothesis of Theorem 1.5 of [28]) is a.s. sublinear. We now define the general class of ergodic scale-free random environments, which we call good embedded lattices, to which our theory applies, following the presentation of Section 1.1 of [28].
Definition 1.13. Let be a random, infinite, locally finite planar, undirected graph (with loops and multiple edges allowed) with conductances , embedded so that each edge is a simple curve with zero Lebesgue measure, edges intersect only at their endpoints, each compact subset of intersects at most finitely many edges, and each connected component of has compact closure. We call this class of graphs embedded lattices, and denote it by . A good embedded lattice satisfies:
(Translation invariance modulo scaling) For every nonnegative measurable on the space of doubly-marked embedded lattices such that
we have
(Ergodicity modulo scaling) Every measurable event invariant under all transformations of the form for and has probability or .
(Finite expectation) Faces are the closures of the connected components of . For , write for a face of containing , chosen arbitrarily if there is more than one, and denote the collection of faces by . For distinct faces, write if they share an edge, and for the sum of the conductances of their shared edges. Additionally, define
For the origin-containing face we have
The main invariance principle pertaining to a good embedded lattice, stated as Proposition 2.8 in the preliminaries, is the convergence of the random walk on the embedded lattice to a non-isotropic Brownian motion [28]. Our methods for isotropic Brownian motion adapt to this setting in a relatively straightforward manner to produce sublinear internal diameter bounds for DLA.
Here, DLA is defined by replacing the simple random walk with the conductance weighted random walk (see Definition 2.7), assuming harmonic measure from infinity is unique.
Theorem 1.14 (DLA on an ergodic scale-free random environment). Let be the dual of a good embedded lattice rooted at , and let be External DLA on started from and targeted at on . Then
a.s.
The almost sure conclusions of Theorems 1.12 and 1.14 are joint in the environment and DLA growth. A proof sketch of this result is provided in § 7. Note that in both Theorems 1.12 and 1.14, the required control of the random walk is almost sure convergence of the law of the random walk conditioned on the environment. For a number of random planar maps (RPMs), such as spanning-tree-weighted maps [34], only convergence in probability of the conditionals is available, and one may wonder if the techniques of this paper might be extended to this weakened assumption. In § 8, we present an example which possesses this weaker property, but for which DLA in fact has a.s. linear internal diameter growth. This demonstrates the tightness of the arguments of this paper.
Related work
The literature on random growth processes is broad and diverse, and in particular a number of distinct setups and questions for DLA have been addressed, as well as for continuum analogues and candidate scaling limits. We now briefly review this work, and group these contributions by whether they deal with a discrete or continuum growth process, and a random or deterministic underlying geometry.
Discrete growth on deterministic geometry. Witten and Sander introduced DLA [65, 64] to model processes of accumulation in nature. Prior rigorous work especially relevant to this paper is the work of Kesten on hitting probabilities and so-called long arms [37, 38, 39], which produces Beurling-type bounds on the harmonic measure of the boundary of a connected lattice subset, uniformly over the particular boundary vertex and subsets of a minimal size, and uses these bounds to control the likelihood that the next accumulated particle is adjacent to the most recently accumulated one. Subsequent work has extended the technique of Kesten to various other graph geometries [5, 6, 7, 42]. This line of work heavily exploits the use of the harmonic measure in DLA.
DLA belongs to a more general class of models called the Dielectric Breakdown Models (DBM) [53, 32, 47, 48, 31, 17, 59, 55], in which the harmonic measure is replaced by an ’th power of the harmonic measure; DBM includes models such as the Eden model, which is of independent interest [23, 30, 58, 18, 16, 19, 20]. Recent work achieves -dependent arm bounds for DBM on and , recovering the classical DLA bounds at , by departing to an extent from the technique of Kesten [46]. Other variants of DLA include one-dimensional long-range DLA [2], stationary half-plane DLA [57, 56], and Internal DLA [41, 36, 4]. The latter model is closely related to the Abelian sandpile [11, 12, 14, 13, 45]. Both the work on Beurling-type bounds and on long-arms control the internal diameter of DLA.
Continuum growth on deterministic geometry. A number of continuum aggregation growth models on deterministic geometries have been studied, which provide candidate scaling limits for DLA on deterministic geometries; these may be regarded as “semi-discrete” models, as they are discrete-time models but accumulate continuum segments. The Hastings-Levitov (HL) model is a family of conformal aggregation models [31, 55], which for a particular choice of parameter is expected to be related to DLA [49 Section 1.2.3]; some scaling limit results have been established for these models, as well as for the broader class of growth models called Aggregate Loewner Evolution (ALE) [54, 63, 33, 9], which encompasses the HL model. However, rigorous relationships between HL/ALE and DLA have yet to be achieved.
Discrete growth on random geometry. An early contribution to the study of DLA on random geometries is [7]. For the uniform infinite spanning-tree-weighted random planar map (UITM), Gwynne and Pfeffer prove that the DLA cluster has external diameter , for an exponent related to volume of the UITM [29]; their work exploits heavily the relationship between DLA and the Loop-Erased Random Walk (LERW) on the UITM. On the mated CRT maps, which are studied in this paper, shape theorems for internal DLA and the divisible sandpile have been established [15].
Continuum growth on random geometry. Miller and Sheffield introduced Quantum Loewner Evolution (QLE) as a candidate scaling limit for the DBM models on an RPM converging to -LQG [49]. Their construction is motivated by the relationship between the -DBM model and the -Laplacian Random Walk (LRW), which generalizes that between DLA and LERW on the UITM. It is expected that DLA on the UITM converges jointly to QLE(2, 1) on a -LQG surface. The so-called “quantum natural time” QLE(8/3, 0) was constructed and used to construct the -LQG metric [50, 51]. Ang and the author subsequently construct quantum natural time QLE for a range of parameters including the (8/3, 0) construction of [50], establish the qualitative phases of the model, as well as stationarity and Markov properties of the unexplored surface. Their time parametrization is conjectured to arise from the time parametrization of the discrete DBM models, but thus far, aside from the Eden model on uniform RPMs (see [3]), convergence of DBM models on RPMs to QLE on LQG is not established.
Outline
The proof strategy of both Theorems 1.6 and 1.10 is identical: bound the maximal harmonic measure (from ) of over any . Indeed, this is identified as the core mechanism for internal diameter bounds by Gwynne and Pfeffer in [29 Section 8]. To do this, one needs to identify the size of annulus required such that the probability that the random walk, upon entering , disconnects the relevant vertex sets before exiting , possesses a positive lower bound. The larger the number of disjoint annuli which can be identified, the stronger the upper bound on harmonic measure, which is what produces the differing conclusions of Theorems 1.6 and 1.10.
In § 2, we present preliminaries on the mated CRT map required to verify Assumption 1.8. In § 3 we prove a bound on the internal diameter of DLA conditional on an annular intersection probability via a harmonic measure bound. In § 4 and § 5 we use the blackbox theorem of § 3 to establish Theorems 1.6 and 1.10 under assumptions 1.4 and 1.8 respectively. In § 6, we verify Assumption 1.8. In § 7 we sketch the proof of Theorem 1.14. Lastly, in § 8 we discuss open problems related to DLA on RPMs, including the mated CRT and UITM, and present a counterexample illustrating an obstruction to a straight-forward application of known, weaker invariance principles to the study of DLA.
Notation and terminology
Write and . For , write . We identify a subgraph with its vertex set when using vertex-set notation, and denotes vertex cardinality. Graph distance is denoted by ; for subsets of , and are Euclidean. Edges are unoriented, and parallel edges are distinct. Simple random walk chooses uniformly among incident edge ends, counting each self-loop twice. We denote by the Euclidean annulus for and . When , we drop the center and write . For , define the neighborhood , and for a subset with , define the external neighborhood . Additionally, we let , i.e. edges with one end on and the other outside of . For finite nonempty and , is the law of the edge traversed when a random walk from , conditioned to hit , first enters ; is its limit as , when this limit exists. For the plane data of § 3.1 and finite connected , set . Note that the plane data is a cell configuration , is connected. Set .
Acknowledgements The author would like to thank Ewain Gwynne for helpful conversations throughout the duration of this project, and Leonardo Bonanno for preparing the associated formalization of this paper.
AI Disclosure ChatGPT 5.6 and 6 Pro were used to expand a detailed proof sketch into an initial draft early in this project, for subsequent proof revisions, to generate Figures 1 and 2, and for the editing of prose, proofs and \LaTeX. All results have been verified by the author, and any errors herein are the sole responsibility of the author. A formalization of this paper prepared by Leonardo Bonanno is available in [10].
Preliminaries
Now, we discuss in greater detail the relationship between the mated CRT map and SLE/LQG, after which we present some preliminary results on the mated CRT map and ergodic scale-free random environments. Before that, we define SLE, the Gaussian free field (GFF) and LQG.
Basics of LQG and SLE
Now, we describe the basics of certain variants of SLE, GFF and LQG. We cover only the material necessary to describe the canonical embedding and cellular embedding with which the mated CRT map comes equipped. Since we rely on many established properties of the mated CRT map, but do not exploit the relationship between LQG/SLE and the mated CRT map very directly, we keep our presentation brief, and only state those definitions and properties necessary to interpret the relevant mated CRT properties. Further references on SLE and LQG are given. In what follows, fix and set and .
Space filling SLE
SLE is a family of random fractal curves that arise as scaling limits of interfaces in critical lattice models [60, 61, 44, 62] and are indexed by a parameter , which varies the “roughness” of the curve. We give a very brief introduction to these random curves here, and refer to [40] for further details.
In this paper, we deal exclusively with a variant of SLE known as whole-plane space-filling SLE from to with when (see e.g. [21 Section 1.4.1] for the original definition in the whole-plane case, or [26 Section 2.1.3] for a more recent discussion). This is a random continuous curve with and as . The space-filling construction is identical to ordinary whole-plane SLE when , and is a slight modification when . Its law is invariant under translations, rotations, and positive dilations.
Whole plane GFF and LQG
Now, we introduce the GFF and LQG. Let be the completion of for the Dirichlet inner product . Given an orthonormal basis and independent standard Gaussian variables , the formal sum
defines the whole-plane GFF, a random distribution modulo additive constants. For each , the pairing converges in , and ; see [26 Section 2.1.1].
For and , let denote the average of with respect to the uniform probability measure on , defined in [22 Section 3.1]. We fix the additive constant by normalizing .
For a conformal map , define . Write if for such an . A -LQG surface is an equivalence class for this relation, and a representative is called an embedding. For marked surfaces, must send each marked point to its corresponding marked point; see e.g. [3 Section 2.3].
The LQG area measure is formally
where the convergence is a.s. in the local weak topology on measures on along dyadic . It satisfies and , and is therefore well defined for a -LQG surface (see [22 Sections 2 and 3]). We use for the Lebesgue measure.
To study the mated CRT map, we will need a variant of LQG surface called an -quantum cone with . Let be standard one-dimensional Brownian motion and, independently of , let have the law of Brownian motion conditioned so that for all . Let
The circle-average embedding of the -quantum cone is defined as the field for which has the law of , while is independent of and agrees in law with the corresponding projection of a whole-plane GFF. This field satisfies (see [21 Definition 4.10] and [27 Section 2.3.1]). In this paper, we will take .
The mated CRT and LQG/SLE
Let be the circle-average embedding of the -quantum cone defined above, and an independent whole-plane space-filling SLE. We parametrize by -LQG area: and for .
This parametrization is the so-called quantum natural time parametrization of SLE, and has a number of useful properties (see e.g. [3 Section 2.5]). For define
These are compact connected sets of measure under . The structure graph of the cells is defined as follows: two distinct vertices are adjacent when their cells share a nontrivial boundary arc, consecutive indices are joined by one edge, nonconsecutive indices are joined by two edges when both left and right boundary adjacency occurs [26 Section 1.2]. The resulting graph has the law of the whole-plane -mated-CRT map (see e.g. [27 Proposition 2.2], [26 Section 1.2]). This observation allows one to study the -mated CRT map via the -quantum cone and space filling SLE, and to couple the -mated CRT maps for different .
For , write . At unit mesh, the root is ; set , , and . Distinct cells overlap only on sets of zero quantum area, so for finite . This is the cellular embedding used in the verification of Assumption 1.8.
Properties of the mated CRT map
We retain the SLE/LQG realization and notation of the preceding subsection and record the properties needed for the mesoscopic argument. We start with control of the random walk and harmonic measure.
Proposition 2.1 ([26 Theorem 1.4]). For every , the simple random walk on is recurrent almost surely.
We denote the total variation (TV) distance by .
Proposition 2.2 ([8 Theorem 1.1 and Section 9], [29 Proposition 1.7]). Almost surely, for every finite nonempty connected we have
where is a unique measure on .
For , define , , and .
Proposition 2.3 ([21 Proposition 4.13(i)]). For every we have
As a result, the -cell configuration for is, after multiplication by , the -cell configuration for .
Define
The following result from [25] controls the asymptotics of .
Proposition 2.4 ([25 Lemma 2.6 and the proof of Theorem 1.4]). Almost surely,
Next, we need control over the number of vertices in with .
Proposition 2.5 ([25 proof of Theorem 1.4]; [24 Lemma A.3]). For every , almost surely
for all sufficiently large .
The above estimate appears immediately after Equation (3.31) in [25] with probability at least for some , and Borel-Cantelli gives the a.s. claim.
Mesoscopic control of random walk for mated CRT
The following estimate is extracted from [26 Proposition 3.6, Lemma 2.7] and the proof of [26 Lemma 3.11].
Proposition 2.6. There exist constants
such that the following holds. Define
The following hold simultaneously with probability at least :
Every cell intersecting has Euclidean diameter at most .
For every with , and for every , let be simple random walk started from and its first exit time from . With quenched probability at least we have:
(a) The random walk disconnects from before .
(b) Every vertex visited before belongs to .
(c) The union of cells visited up to and including is contained in .
The proof of [26 Lemma 3.11] applies [26 Proposition 3.6] to obtain (2a) and (2b) with quenched success probability at least . The final union bound makes these estimates simultaneous over the grids in (1): choosing sufficiently small and below both and the lower-scale exponent in that lemma gives a failure probability at most . [26 Lemma 2.7] gives (1), after choosing and decreasing if necessary. Since every admissible radius satisfies , one has . So, (1) and (2b) imply that the union of cells visited up to and including is contained in for all sufficiently small , which establishes (2c).
Ergodic scale-free random environments
Lastly, we introduce the invariance principle for ergodic scale-free random environments. First, we need a definition.
Definition 2.7. For a good embedded lattice , the conductance weighted random walk on has transition probabilities . Here is viewed as a weighted graph with vertices given by the faces of , with one edge of conductance for each adjacent pair of faces. This Markov chain on the faces of is the random walk defined in [28 Theorem 3.10].
The next result we recall is a main result from [28]; it is the invariance principle for ergodic-scale free random environments. In particular, this proposition combines Theorems 1.5 and 3.10 from [28].
Proposition 2.8. Let be a good embedded lattice (see Definition 1.13), and choose a point from each face, with . Let be the conductance weighted random walk of in Definition 2.7. For a starting face , let be the piecewise-linear interpolation of , started from and stopped upon first leaving . There exists a positive-definite covariance matrix such that, a.s. in , for every , we have
where is Brownian motion with covariance matrix started from and stopped upon first leaving , and is induced by . Convergence is again with respect to the topology on curves modulo time parametrization.
Now we proceed to the proofs of the blackbox results.
Control of diameter via annular intersection probabilities
In this section, we demonstrate how to convert annular intersection probabilities into harmonic measure bounds, and harmonic measure bounds into diameter bounds. Sections 4 and 5 will invoke these intermediary results to establish the main theorems. The section concludes with a brief subsection describing the change of initial vertex of the DLA growth.
Annular intersection probabilities to harmonic measure bounds
The results of this section are stated at a fixed scale. In the next subsection, these results will be applied at an arbitrary scale, yielding the large conclusions.
Assumptions 1.4 and 1.8 pertain to slightly different embedding data for the planar map (a proper planar embedding versus a cellular embedding), and the arguments obey this structure. To reconcile these differences, we define the plane data as follows: let be a locally finite collection of nonempty bounded connected subsets of , indexed by , such that if . In § 4, will be the union of and the interiors of the embedded edges incident to , and in § 5 we choose as the cellular embedding. For , define
as the vertices with planar data intersecting a given Euclidean subset.
Now, we state precisely the multiscale structure, at a fixed non-normalized scale, which will yield asymptotically shrinking harmonic measure bounds.
Definition 3.1 (Good scales). Fix and , and let be finite and connected. Choose . -good scales for consist of radii
and a center such that:
For all such that we have .
.
For all , there exists a graph path in joining to .
For all and all , a simple random walk started from and run until its first exit time from has probability at least that it disconnects from before and .
Note that the above definition admits at most logarithmically many good scales relative to the ratio . In principle one could achieve without (3.1), but we do not encounter this scenario in this paper and so work with the slightly more restrictive definition.
As we organize scales in a Euclidean fashion, i.e. using Euclidean annuli, the bound on diameters of establishes a compatibility condition of the plane data with the good scales, and ensures that a random walk from must pass through each individual scale successively. Each scale then provides with probability at least the possibility of an annular disconnection, and combining with the Markov property of the random walk yields the final harmonic measure bound. This is illustrated in Figure 1, and is the content of the next proposition.

Figure 1. -good scales for the pair with . The good scales consist of 3 disjoint annuli and , with inner and outer boundaries colored blue and red respectively. A segment of the ambient graph is drawn with gray vertices and edges, and a segment of is drawn with black vertices and edges.
Proposition 3.2. Suppose there exist -good scales for . Then for all such that , we have
and the bound follows for .
Proof. Items 1-4 in Definition 3.1 identify concentric, disjoint, nonempty annuli in through which a random walk started outside of must pass, and for which a random walk started anywhere on the boundary has a disconnection probability of at least .
In particular, item 2 states that and its immediate neighborhood are contained in the center of the concentric annuli, item 3 guarantees that a random walk trajectory disconnecting from must hit the cluster , item 4 lower bounds the annulus intersection probability by and ensures that the visited plane data is contained in the annulus, and item 1 ensures that the random walk cannot skip scales and that the sets are disjoint for differing .
As a random walk which first enters through must avoid all disconnection events, one applies the Markov property of the random walk successively at each scale to conclude the final bound on the harmonic measure.
To produce a diameter bound, we will need to show the existence of -good scales uniformly over all . The next section shows how to convert such uniform good scales into a diameter bound.
Harmonic measure bounds to diameter bounds
We now use harmonic measure bounds to establish a diameter bound on the DLA cluster. Proposition 3.2 operates at a fixed scale, but the next proposition takes as input harmonic measure bounds which tend to as the size of the subject cluster tends to . Establishing these bounds at arbitrarily large scales, uniformly over clusters and vertices, is the main content of § 4 and § 5, and is done using the appropriate assumption in tandem with Proposition 3.2. We prove Proposition 3.3 here since, as with Proposition 3.2, it does not inherently depend on either assumption.
Suppose that is a planar map with root , and let , and the DLA cluster at steps, evolving according to Definition 1.1. has a tree structure, and we set . Define the (non-increasing) sequence
Note that a priori the above quantity has nothing to do with DLA, and applies to all sufficiently large finite rooted connected subgraphs of . The convergence of , and in particular the rate of this convergence, is supplied by the Beurling estimates in Theorems 1.5 and 1.9; these latter results are established in subsequent sections, but here we show how to convert this harmonic measure control to internal diameter bounds on DLA.
Proposition 3.3. With as in (3), we have almost surely:
If then .
If for some , then there exists a such that .
Proof. By definition, for each the conditional probability that given is at most , since . Let . If , then there exist times such that form a simple path from the root. For any fixed increasing sequence , successive conditioning on the growth history produces the bound on the event , where adjacency is in . A union bound over all such sequences gives
The second inequality follows by expanding , and the last follows from .
First, suppose that . Then and so . Fix and take . For all sufficiently large one has , and so . Since , by Borel-Cantelli we have a.s., with an implied constant independent of . By intersecting these probability-one events over all positive rational , we conclude a.s.
Now suppose that and let (or for any fixed ). We have (with possibly ). Choose and set . We then have
and Borel-Cantelli implies that a.s. . Since , the claimed diameter bounds follow in both cases. □
Note that , viewed not as a tree but with all edges from between vertices of retained, trivially has diameter at most that of the tree, so conforms to the asymptotics of Proposition 3.3 too.
To invoke Proposition 3.3, we must show existence of good scales for the DLA cluster for all sufficiently large , with the number of good scales growing in , after which we can use Proposition 3.2.
Change of initial vertex
We now briefly describe the procedure for changing the starting vertex for DLA growth. For , define by replacing with in (3). Fix a finite path from to and let for the random walk . Set
For finite connected , put . A walk first entering at must first enter at or in . Also, for the Markov property gives . Conditioning on hitting the respective sets and then sending to infinity gives
since is rooted and connected, and . Thus
For a recurrent random walk we have , and the same argument applies to the conductance weighted walk. Proposition 3.3 therefore gives the same growth bounds for DLA started from , with the same polynomial exponent where applicable. However, the implied constants and eventual thresholds may depend on the initial vertex, and so change of initial growth point for an RPM is a little more subtle. For this reason, we largely omit the discussion of change of initial growth point in the RPM case, and focus on the rooted growth.
Proof of Theorem 1.6 under Assumption 1.4
We now use Assumption 1.4 to show the existence of good scales, and invoke Propositions 3.2 and 3.3. First, we define the relevant plane data in this setting. For an edge , let denote the embedded edge with endpoints removed. For , let
Each is bounded and connected, and the family is locally finite by properness of the embedding (see Definition 1.3). Moreover, for distinct vertices ,
As before, for we write
Note that generally .
Robust Brownian intersections
Here, we prove that with positive probability a Brownian motion intersects itself in an annulus in such a way that an appropriate approximating curve, which we will take to be a random walk trajectory on the embedded graph, also intersects itself. This allows us to infer the relevant annular intersection probability of the random walk from the Brownian motion convergence. The claims of this section are elementary and are therefore stated without proof.
Let be the polygonal path depicted in the below figure. The first vertical segment and the last horizontal segment cross transversely at , and the loop winds once around the origin while staying in a small annulus.
The next claim is obvious.
Claim 4.1. There is such that every finite curve within of in the metric stays in and contains a closed curve with winding number one about .
We call an -neighborhood of with a robust neighborhood. The next claim is immediate by planarity and properties of the embedding.
Claim 4.2. If a finite piece of an embedded walk contains a closed curve with nonzero winding number about , then the graph walk contains an embedded graph cycle surrounding .
The final claim of this section is a basic property of Brownian motion (see e.g. [52 Exercise 1.8]).
Claim 4.3. There exist and such that for with , standard Brownian motion started from has probability at least to possess an initial segment in a robust neighborhood of (where is the rotation by of the template whose initial point has been replaced by ).
We allow because, in our later applications to embedded random walks, the starting vertex will generally lie close to a prescribed Euclidean circle rather than exactly on it. We call the event that Brownian motion, and by abuse of terminology the random walk too, is in a robust neighborhood the robust intersection event.
Diameter bounds for embedded edges
As mentioned in § 3.1, to ensure that the embedded graph conforms to the non-normalized scales, we need to bound the diameter of the elements in the planar data. In this subsection, we prove that the maximum diameter of the edges (of a graph satisfying Assumption 1.4) intersecting a Euclidean ball is sublinear in the radius of the ball.
For define
We have by properness of the embedding.
Proposition 4.4. Under Assumption 1.4 for every fixed we have
Proof. Fix . We prove that for all sufficiently large . Choose finitely many points such that
For each , choose a polygonal curve which starts at , travels to , traces a translated and scaled copy of , and then continues to . We choose so that the polygonal curves and their relevant neighborhoods are contained in .
Let be the metric used in Assumption 1.4 and be the law of Brownian motion started at and stopped upon exiting . Additionally, let be the law of the rescaled embedded random walk started from the root and stopped upon leaving . Assumption 1.4 gives
For each we let be the corresponding polygonal route. By Claim 4.1 there is such that every curve satisfying contains a curve in separating from . Define the events
Claim 4.3 gives , and since , the number is positive. By Assumption 1.4 there is a finite such that
If then by definition of the Lévy-Prokhorov metric we have for every Borel set (in the topology induced by ) that
where denotes the open -neighborhood of under . Taking gives . Moreover, since we have and so
Fix . Since the graph and embedding are deterministic, and the randomness in (6) is only over the random walk, positive probability implies that an appropriate trajectory exists. Choose one such trajectory for each . By Claims 4.1 and 4.2 each trajectory contains a graph cycle such that
Since the above probabilistic argument is only existential, we can deduce the existence of such cycles for all simultaneously. Let be an edge such that . By (5), there is an such that
The edge cannot belong to since the cycle is disjoint from the disk, and by planarity the interior of cannot cross the cycle. So is contained in , and . This bound holds for all edges, and so for each fixed we have and letting completes the proof.
It follows immediately that for every fixed one has as .
Completing Theorem 1.6
Now, we verify the existence of good scales and complete the proof of Theorems 1.5 and 1.6. The next Lemma establishes control of annular intersection probabilities at a single normalized scale .
Lemma 4.5. Under Assumption 1.4 there exist deterministic such that for every and every fixed normalized scale , there is such that the following holds for all . Let , set and let satisfy
A simple random walk started from and run until its first exit time from has probability at least to disconnect from with . The probability is independent of , and .
Proof. Fix and , and set . Choose , and let be as in Claim 4.3, decreasing if necessary such that . By (7) every admissible starting vertex satisfies . After translating by , rescaling by and rotating so that the starting point lies near , Claim 4.3 gives a , independent of , and such that Brownian motion remains in a robust neighborhood of . In the original coordinates rescaled by , this curve remains in and contains a closed curve in which separates from . By an identical argument to that of Proposition 4.4 there exists an such that when the rescaled embedded random walk intersects robustly an equivalent annulus uniformly for all admissible and with probability at least .
By Proposition 4.4 there is an such that for , every set intersecting the ambient region containing the robust neighborhood of (the rotation of) has diameter smaller than a sufficiently small multiple of . On the robust intersection event, by Claim 4.2 the trace of the random walk contains a cycle in disconnecting from .
The containment claims of the Lemma follow analogously to those of Proposition 4.4, and choosing completes the proof.
To observe that the above is independent of we use the scale invariance of Brownian motion modulo parametrization and the fact that the Brownian motion is killed upon leaving the annulus, which is itself appropriately rescaled.
Now, we show the existence of many good scales as the Euclidean diameter of the cluster diverges. The next proposition essentially uses Proposition 4.4 to show the existence of an arbitrarily large number of disjoint scales as and then applies Lemma 4.5 at each individual scale. Uniformity over and follows from the fact that the sets are rooted.
Proposition 4.6. Under Assumption 1.4 there is a such that for every there exists an with the following property: if is finite and connected, and , then there are -good scales for .
Proof. Let
Properness of the embedding therefore implies that as over rooted connected sets; thus, any property which holds for large enough also holds for large enough .
Now, suppose that and we choose and as above. Since the maximum diameter of all intersecting is , by choosing in Proposition 4.4 there exists an (where and are as in Lemma 4.5) such that if then the maximum diameter of all intersecting is less than .
For a rooted, finite, connected set, let and fix . Since is rooted and , we have . For every , , so for , each intersects and has diameter less than . If then is contained in , and every intersecting has diameter less than by the preceding paragraph, since .
There exists with , and an embedded graph path in from to crosses both circles and for all . Applying Lemma 4.5 with to each shows the existence of -good scales, and picking such that for all completes the proof.
Note that the order of quantifiers to achieve uniformity over large and is somewhat delicate. For the fixed threshold , an with may fail to satisfy , since there may exist some such that . However, does hold, since the numerator in the definition adjusts the size of the ball with which edges intersect, and so the convergence controls the relative mesh size at all sufficiently large scales simultaneously.
Now, we can complete Theorems 1.5 and 1.6.
Proof of Theorems 1.5 and 1.6. Let be as in Proposition 4.6. Given , choose with . For every sufficiently large rooted connected and every there are -good scales for . By Proposition 3.2 we have
Sending as produces Theorem 1.5, and combining with Proposition 3.3 completes Theorem 1.6 for DLA started from . Equation (4) gives the extension to any other initial vertex.
Proof of Theorem 1.10 under Assumption 1.8
As in § 4, we use Assumption 1.8 to show the existence of good scales, and invoke Proposition 3.3. The stronger control of Assumption 1.8 as compared to Assumption 1.4 will allow us to improve the number of good scales.
We begin with two trivial observations. The first follows from the triangle inequality, and the second follows from the reverse triangle inequality and the connectedness of the union of cells corresponding to a connected subgraph of .
Lemma 5.1. Suppose that for every the cell has diameter at most , and choose . Then
Lemma 5.2. Let be finite and connected, with , and suppose and . Then contains a graph path joining to .
The next proposition establishes good scales for every sufficiently large non-normalized scale, where the number of good scales depends logarithmically on the Euclidean diameter of the cluster. Subsequently, item 4 of Assumption 1.8 will be used to convert the lower bound on the number of good scales from a term depending on the Euclidean diameter of the cells corresponding to the cluster to a term depending only on the cardinality of the cluster.
Proposition 5.3. Under Assumption 1.8, there exists a constant and a finite threshold such that the following holds: if is finite and connected, , and , then there are -good scales for with
Proof. Fix . By Assumption 1.8, there exists an sufficiently large that for every we have
Set , fix , and choose . Since is rooted and , we have and hence . Next, choose with . Set
and let be the largest integer with . For each , choose with . Equation (8) gives , and so we have and , so . By our choice of , we have . Since , by possibly increasing again, we have
Now, we can verify the existence of -good scales for . Since and , all cells intersecting also intersect , so by Assumption 1.8 the cell diameters are bounded by . Lemma 5.1 then gives . Now, , so and , thus
This proves the first two items in Definition 3.1. Since we have . Also, after increasing again if necessary. Applying Lemma 5.2 with and gives the third item in Definition 3.1 for every . Finally, and , and so the third item in Assumption 1.8 gives the fourth item in Definition 3.1. This concludes the proof. □
We can now conclude Theorems 1.9 and 1.10.
Proof of Theorems 1.9 and 1.10. Let be finite and connected with . Propositions 3.2 and 5.3 give
By item four of Assumption 1.8, for sufficiently large we have
Choosing any gives the strong Beurling estimate for sufficiently large . Theorem 1.9 and item two of Proposition 3.3 give the polynomially sublinear growth bound for DLA started from . Equation (4) transfers this bound to any other initial vertex with the same exponent . □
Verifying Assumption 1.8 for the mated CRT map
With the preliminaries from § 2 we verify Assumption 1.8 for the mated CRT map, and conclude Theorem 1.12. As the assumption pertains to a deterministic geometry, we mean that the mated CRT map satisfies the assumption a.s. and with possibly random values for constants such as .
We will need to convert the properties stated in Proposition 2.6, which pertain to a single scale, to the multiscale requirements of Assumption 1.8. Essentially, the argument boils down to scaling properties of the mated CRT map and an elementary Borel-Cantelli argument.
Proposition 6.1. Fix . The -mated CRT map, rooted at , a.s. satisfies Assumption 1.8, with deterministic, possibly -dependent, and .
Proof. In what follows we work on a full probability event over the mated CRT map, so omit the phrase “almost surely” as regards the randomness of the environment.
Let be as in Proposition 2.6, decreasing if necessary such that . For , set , , , and . By quantum cone scaling (Proposition 2.3) the conclusion of Proposition 2.6 at transfers to the unit-mesh map at the (random) non-normalized scale . By Borel-Cantelli, simultaneously for all sufficiently large the conclusions of Proposition 2.6 hold, i.e. every cell intersecting has diameter at most and the annular random walk conclusions of Proposition 2.6 are true.
Choose and set . For , let ; we will treat as the non-normalized scale parameter. Proposition 2.4 gives , , and as . Now, set and define , , and . This establishes item 1 of Assumption 1.8. In the remainder of the proof, take sufficiently large.
Now, let and . These are -nets of and respectively, which establishes the net requirement in item 3 of Assumption 1.8.
Finally, implies , so every cell intersecting has diameter at most , establishing item 2. If and , then . Along with the earlier quantum cone scaling argument, this establishes item 3 of Assumption 1.8 for some deterministic .
For item 4, let be finite and connected with sufficiently large. Since , we have . Proposition 2.5 with and gives . Local finiteness gives uniformly as , so item 4 holds with and .
Finally, Proposition 6.1 and Theorem 1.10 imply that DLA grown from the root on the -mated CRT has a.s. polynomially sublinear growth. Inspection of the exponent derived in Proposition 6.1 reveals an inequality which relates the DLA growth bound to the LQG parameter .
DLA on an ergodic scale-free random environment
In this brief section, we sketch the proof of Theorem 1.14. Let be an embedded lattice as in Definition 1.13, and let be its adjacency graph, with root and DLA initial cluster . We again assume that harmonic measure from infinity is unique. In this section, good scales are defined using the conductance weighted walk in the obvious way.
Proof sketch. Let be the conductance weighted walk on , with vertex embeddings as in Proposition 2.8. Rewritten in the notation of Assumption 1.4, [28], Theorem 3.10 gives a.s. over , for every the convergence
where is the piecewise-linear interpolation through chosen points of the faces, and is Brownian motion with positive-definite covariance matrix started from and stopped upon leaving . Draw the dual graph as a proper planar map by placing each dual vertex at its chosen face representative and drawing each dual edge inside the union of its two incident faces. By [28 Lemma 2.9], for every fixed we have
Now, fix and choose . Set . The preceding limit implies that almost surely. Going forward, we fix an environment on which these almost sure conclusions hold; all walk laws below are conditional on .
We couple the proper and piecewise-linear embeddings through the same random walk on the graph, started from with , and denote them by and respectively. For adjacent faces , since , one has . It follows that , where both paths are stopped when the piecewise-linear interpolation leaves .
Write . Since the Prokhorov metric is induced by , the above implies
By the triangle inequality, . The second term tends to zero uniformly over starting vertices in by Proposition 2.8, while is already shown.
Finally, we deal with a slight mismatch in stopping times between the two walks, since the above is stopped when exits ; we prove that stopped when it exits , after multiplication by , converges to Brownian motion stopped when exiting . The terminal point of has modulus at least for all large , so this exit occurs before the common graph-time interval ends.
Fix a sequence and starting vertices with , and suppose first that for some . By the Skorokhod representation theorem, we may realize this convergence as a.s. convergence under ; denote by the corresponding curves, with their parametrizations chosen so that uniformly on . Here is the curve parametrized by in the obvious way (so exits at ). Let and be their respective first entry into . For each sufficiently small , the compact set lies a positive distance inside , so for all sufficiently large . On the other hand, a.s. there exists with . Uniform convergence then gives , and so , for all sufficiently large which implies a.s. By continuity of , the parametrizations converge uniformly to , so the corresponding initial curve segments converge in . Thus the rescaled random walk under , stopped upon leaving , converges weakly to .
To obtain uniformity over starting vertices, suppose that uniform convergence fails along some sequence and , with some , with the Prokhorov distances bounded away from zero. By sequential compactness, we can choose a convergent subsequence . Write the Brownian motions as and , where is the same Brownian motion of covariance started at . Their distance before stopping is . The same comparison above, applied at each radius , shows that their departure times and stopped curves converge, so . Now, the (non-uniform) convergence and , along with the triangle inequality show that . The preceding paragraph, together with and the triangle inequality, show that the Prokhorov distances tend to zero, which is a contradiction.
Lastly, we deal with the anisotropy of . Let be as in Claim 4.3 and let denote a rotation by and set . Write for the law of Brownian motion started at with covariance . If is the polygonal path in Figure 2 with initial radius , set and

Figure 2. The polygonal path . The open circle at indicates the initial intersection of the first vertical segment with the final horizontal segment. The dotted blue circles indicate the annulus , and the dotted red circles indicate the annulus .
which is strictly positive by compactness and continuity.
The good scales argument now applies identically. For every , there exists an such that for every finite, connected, rooted set with and every , there are -good scales for . This implies
The argument for DLA growth then follows identically to Proposition 3.3, and a.s. sublinearity of the internal diameter follows for DLA grown from .
Open problems
We briefly mention two natural directions of further research. The first regards the identification of the growth exponent of the internal diameter of DLA. Theorem 1.10 bounds the growth exponent of the internal diameter of DLA. As mentioned in § 1, the paper [29] provides a result for the growth exponent of the external diameter of DLA; this result is rather strong, as it identifies precisely the growth exponent, but it is limited by the special qualities of the UITM. A natural next question is the following:
Problem 8.1. With a whole-plane -mated CRT rooted at , and a DLA process from to , show that
exists, and identify its value.
The above problem is essentially [29 Problem 8.1] stated for the -mated CRT.
The next more open ended problem deals with a limitation of the techniques of this paper. To deduce a.s. sublinear growth of the DLA process on an RPM, we require Assumption 1.4 or 1.8 to hold a.s. for the relevant model. As demonstrated in this paper, this does indeed hold for an extremely general class of random planar geometries. However, it does fail to capture the behavior of some natural models which do exhibit slightly weaker invariance properties; in particular, the recent work [34] exhibits quenched convergence in probability of the random walk (uniform on distinct neighboring vertices) on finite spanning-tree-weighted maps to Brownian motion, and indeed the work of [29] shows that the UITM is an especially natural geometry on which to study DLA. As we will discuss, these in-probability invariance theorems alone are insufficient to prove sublinearity of the internal diameter of DLA. Thus, the following problem is a natural modification, and asks if further assumptions are sufficient to recover a.s. sublinear diameter growth.
Problem 8.2. Adapt the methods of the current paper to RPMs satisfying an in probability quenched invariance principle under further assumptions.
To observe that in-probability convergence alone cannot yield the sublinear bound on DLA, consider the following example. Set and and independently with probability replace in by a single nearest-neighbor path with vertices, retaining only consecutive edges and the two connections to the inner and outer rings. The resulting graph is connected, recurrent, and properly embedded in the plane, with maximum degree four and unique harmonic measure from infinity. Set and take . For each fixed , with probability tending to one all modifications relevant to a walk stopped on exiting lie inside . The latter invariance principle and planar annulus hitting estimate [43 Theorem 3.4.2 and Proposition 6.4.1] give the convergence in Assumption 1.4 in probability. However, infinitely many modifications occur a.s. and DLA must traverse them consecutively. At their completion times , we have and , so
a.s. For , monotonicity makes convergence to zero in probability equivalent to a.s. convergence, so Proposition 3.3 gives sublinear DLA diameter jointly a.s. However, in the counterexample we have for every a.s., since arbitrarily large rooted sets can end inside a long path with a single entrance from infinity. Likewise, convergence in probability of the walk-law discrepancy uniformly over all later scales recovers a.s. convergence.
Specifically, for the UITM it seems likely that one may be able to achieve analogous statements to [26] and therefore achieve the a.s. Assumption 1.8 due to the recent work [34].
Problem 8.3. Using [34], establish analogues of the quantitative quenched annular estimates of [26] on the UITM, and then verify Assumption 1.8 for the UITM.
References
References
- [1]M. Aizenman and A. Burchard. Hölder regularity and dimension bounds for random curves. Duke Mathematical Journal, 99(3):419–453, 1999.DOI
- [2]Gideon Amir, Omer Angel, Itai Benjamini, and Gady Kozma. One-dimensional long-range diffusion-limited aggregation i. The Annals of Probability, pages 3546–3579, 2016.arxiv.org/abs/0910.4416
- [3]Morris Ang and Deven Mithal. Quantum loewner evolution in quantum natural time: phases and markov properties. arXiv preprint arXiv:2605.03385, 2026.arxiv.org/abs/2605.03385
- [4]Amine Asselah and Alexandre Gaudillière. Sublogarithmic fluctuations for internal DLA. The Annals of Probability, 41(3A):1160–1179, 2013.
- [5]Itai Benjamini and Ariel Yadin. Diffusion limited aggregation on a cylinder. Communications in Mathematical Physics, 279(1):187–223, 2008.DOI
- [6]Itai Benjamini and Ariel Yadin. Harmonic measure in the presence of a spectral gap. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques, 52(3):1050–1060, 2016.arxiv.org/abs/1402.0156
- [7]Itai Benjamini and Ariel Yadin. Upper bounds on the growth rate of diffusion limited aggregation. arXiv preprint arXiv:1705.06095, 2017.arxiv.org/abs/1705.06095
- [8]Nathanaël Berestycki and Diederik van Engelengurg. Harnack inequality and one-endedness of ust on reversible random graphs: N. berestycki, d. van engelenburg. Probability Theory and Related Fields, 188(1):487–548, 2024.
- [9]Noam Berger, Eviatar B Procaccia, and Amanda Turner. Growth of stationary hastings–levitov. The Annals of Applied Probability, 32(5):3331–3360, 2022.DOI
- [10]Leonardo Bonanno and Deven Mithal. Dla-internal-diameter. GitHub repository, https://github.com/liouvillegquantumgy/Formalizations/tree/main/DLA-internal-diameter.
- [11]Ahmed Bou-Rabee. Convergence of the random abelian sandpile. The Annals of Probability, 49(6):3168–3196, 2021.
- [12]Ahmed Bou-Rabee. Dynamic dimensional reduction in the abelian sandpile. Communications in Mathematical Physics, 390(2):933–958, 2022.
- [13]Ahmed Bou-Rabee. Integer superharmonic matrices on the f-lattice. Advances in Mathematics, 436:109400, 2024.
- [14]Ahmed Bou-Rabee. A shape theorem for exploding sandpiles. The Annals of Applied Probability, 34(1A):714–742, 2024.
- [15]Ahmed Bou-Rabee and Ewain Gwynne. Internal dla on mated-crt maps. The Annals of Probability, 52(6):2173–2237, 2024.
- [16]Sébastien Bubeck and Ewain Gwynne. Asymptotic behavior of the eden model with positively homogeneous edge weights. arXiv preprint arXiv:1508.05140, 2015.arxiv.org/abs/1508.05140
- [17]Lennart Carleson and Nikolai Makarov. Aggregation in the plane and loewner’s equation. Communications in Mathematical Physics, 216(3):583–607, 2001.
- [18]J Theodore Cox and Richard Durrett. Some limit theorems for percolation processes with necessary and sufficient conditions. The Annals of Probability, pages 583–603, 1981.DOI
- [19]Nicolas Curien and Jean-François Le Gall. Scaling limits for the peeling process on random maps. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques, 53(1):322–357, 2017.arxiv.org/abs/1412.5509
- [20]Nicolas Curien and Jean-François Le Gall. First-passage percolation and local modifications of distances in random triangulations. In Annales scientifiques de l’École Normale Supérieure, volume 52, pages 631–701, 2019.arxiv.org/abs/1511.04264
- [21]Bertrand Duplantier, Jason R Miller, and Scott Sheffield. Liouville quantum gravity as a mating of trees. Astérisque, 427, 2021.
- [22]Bertrand Duplantier and Scott Sheffield. Liouville quantum gravity and kpz. Inventiones mathematicae, 185(2):333–393, 2011.arxiv.org/abs/0808.1560
- [23]Murray Eden et al. A two-dimensional growth process. In Proceedings of the fourth Berkeley symposium on mathematical statistics and probability, volume 4, pages 223–239. Biology and Problems of Health, University of California Press, Berkeley, CA, 1961.
- [24]Ewain Gwynne, Nina Holden, and Xin Sun. A distance exponent for liouville quantum gravity. Probability Theory and Related Fields, 173(3):931–997, 2019.arxiv.org/abs/1606.01214
- [25]Ewain Gwynne and Tom Hutchcroft. Anomalous diffusion of random walk on random planar maps. Probability Theory and Related Fields, 178(1):567–611, 2020.arxiv.org/abs/1807.01512
- [26]Ewain Gwynne, Jason Miller, and Scott Sheffield. Harmonic functions on mated-CRT maps. Electronic Journal of Probability, 24:Paper No. 58, 55, 2019.arxiv.org/abs/1807.07511
- [27]Ewain Gwynne, Jason Miller, and Scott Sheffield. The Tutte embedding of the mated-CRT map converges to Liouville quantum gravity. The Annals of Probability, 49(4):1677–1717, 2021.
- [28]Ewain Gwynne, Jason Miller, and Scott Sheffield. An invariance principle for ergodic scale-free random environments. Acta Mathematica, 228(2):303–384, 2022.
- [29]Ewain Gwynne and Joshua Pfeffer. External diffusion-limited aggregation on a spanning-tree-weighted random planar map. The Annals of Probability, 49(4):1633–1676, 2021.
- [30]John M Hammersley and Dominic JA Welsh. First-passage percolation, subadditive processes, stochastic networks, and generalized renewal theory. In Bernoulli 1713, Bayes 1763, Laplace 1813: Anniversary Volume. Proceedings of an International Research Seminar Statistical Laboratory University of California, Berkeley 1963, pages 61–110. Springer, 1965.DOI
- [31]Matthew B Hastings and Leonid S Levitov. Laplacian growth as one-dimensional turbulence. Physica D: Nonlinear Phenomena, 116(1-2):244–252, 1998.DOI
- [32]MB Hastings. Fractal to nonfractal phase transition in the dielectric breakdown model. Physical Review Letters, 87(17):175502, 2001.
- [33]Frankie Higgs. SLE scaling limits for a Laplacian random growth model. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques, 58(3):1712–1739, 2022.
- [34]Nina Holden. The tutte embedding of tree-weighted planar maps converges to liouville quantum gravity. arXiv preprint arXiv:2610.10501, 2026.
- [35]Tom Hutchcroft and Asaf Nachmias. Uniform spanning forests of planar graphs. In Forum of Mathematics, Sigma, volume 7, page e29. Cambridge University Press, 2019.arxiv.org/abs/1603.07320
- [36]David Jerison, Lionel Levine, and Scott Sheffield. Logarithmic fluctuations for internal dla. Journal of the American Mathematical Society, 25(1):271–301, 2012.arxiv.org/abs/1010.2483
- [37]Harry Kesten. Hitting probabilities of random walks on zd. Stochastic Processes and their Applications, 25:165–184, 1987.
- [38]Harry Kesten. How long are the arms in dla? Journal of Physics A: Mathematical and General, 20(1):L29–L33, 1987.
- [39]Harry Kesten. Upper bounds for the growth rate of dla. Physica A: Statistical Mechanics and its Applications, 168(1):529–535, 1990.DOI
- [40]Gregory F. Lawler. Conformally invariant processes in the plane, volume 114 of Mathematical Surveys and Monographs. American Mathematical Society, Providence, RI, 2005.
- [41]Gregory F Lawler, Maury Bramson, and David Griffith. Internal diffusion limited aggregation. The Annals of Probability, pages 2117–2140, 1992.DOI
- [42]Gregory F. Lawler and Vlada Limic. The Beurling estimate for a class of random walks. Electronic Journal of Probability, 9(27):846–861, 2004.DOI
- [43]Gregory F. Lawler and Vlada Limic. Random Walk: A Modern Introduction, volume 123 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 2010.DOI
- [44]Gregory F. Lawler, Oded Schramm, and Wendelin Werner. Conformal invariance of planar loop-erased random walks and uniform spanning trees. Ann. Probab., 32(1B):939–995, 2004.
- [45]Lionel Levine and Yuval Peres. Scaling limits for internal aggregation models with multiple sources. Journal d’Analyse Mathématique, 111(1):151–219, 2010.DOI
- [46]Ilya Losev and Stanislav Smirnov. How long are the arms in dbm? Communications in Mathematical Physics, 406(4):93, 2025.DOI
- [47]Joachim Mathiesen and Mogens H. Jensen. Tip splittings and phase transitions in the dielectric breakdown model: Mapping to the diffusion-limited aggregation model. Physical Review Letters, 88(23):235505, 2002.pubmed.ncbi.nlm.nih.gov/12059377
- [48]Joachim Mathiesen, Mogens H. Jensen, and Jan Øystein Haavig Bakke. Dimensions, maximal growth sites, and optimization in the dielectric breakdown model. Physical Review E, 77(6):066203, 2008.pubmed.ncbi.nlm.nih.gov/18643346
- [49]Jason Miller and Scott Sheffield. Quantum Loewner evolution. Duke Mathematical Journal, 165(17):3241–3378, November 2016.
- [50]Jason Miller and Scott Sheffield. Liouville quantum gravity and the Brownian map I: The QLE(8/3,0) metric, 2019.
- [51]Jason Miller and Scott Sheffield. Liouville quantum gravity and the Brownian map II: Geodesics and continuity of the embedding. Ann. Probab., 49(6):2732–2829, 2021.
- [52]Peter Mörters and Yuval Peres. Brownian Motion, volume 30 of Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, Cambridge, 2010.
- [53]Lucian Niemeyer, Luciano Pietronero, and Hans J Wiesmann. Fractal dimension of dielectric breakdown. Physical Review Letters, 52(12):1033–1036, 1984.DOI
- [54]James Norris, Vittoria Silvestri, and Amanda Turner. Stability of regularized Hastings–Levitov aggregation in the subcritical regime. Communications in Mathematical Physics, 405(3):74, 2024.
- [55]James Norris and Amanda Turner. Hastings–Levitov aggregation in the small-particle limit. Communications in Mathematical Physics, 316(3):809–841, 2012.DOI
- [56]Eviatar B. Procaccia, J iayan Ye, and Yuan Zhang. Stationary DLA is well defined. Journal of Statistical Physics, 181(4):1089–1111, 2020.DOI
- [57]Eviatar B. Procaccia and Yuan Zhang. Stationary harmonic measure and DLA in the upper half plane. Journal of Statistical Physics, 176(4):946–980, 2019.arxiv.org/abs/1711.01011
- [58]Daniel Richardson. Random growth in a tessellation. Proceedings of the Cambridge Philosophical Society, 74(3):515–528, 1973.DOI
- [59]Steffen Rohde and Michel Zinsmeister. Some remarks on Laplacian growth. Topology and its Applications, 152(1–2):26–43, 2005.DOI
- [60]Oded Schramm. Scaling limits of loop-erased random walks and uniform spanning trees. Israel J. Math., 118:221–288, 2000.
- [61]Stanislav Smirnov. Critical percolation in the plane: conformal invariance, Cardy’s formula, scaling limits. C. R. Acad. Sci. Paris Sér. I Math., 333(3):239–244, 2001.DOI
- [62]Stanislav Smirnov. Conformal invariance in random cluster models. i. holomorphic fermions in the ising model. Annals of mathematics, pages 1435–1467, 2010.
- [63]Alan Sola, Amanda Turner, and Fredrik Viklund. One-dimensional scaling limits in a planar Laplacian random growth model. Communications in Mathematical Physics, 371(1):285–329, 2019.DOI
- [64]Thomas A. Witten and Leonard M. Sander. Diffusion-limited aggregation. Physical Review B, 27(9):5686–5697, 1983.DOI
- [65]Thomas A Witten Jr and Leonard M Sander. Diffusion-limited aggregation, a kinetic critical phenomenon. Physical review letters, 47(19):1400, 1981.DOI