Papers
Topics
Authors
Recent
2000 character limit reached

External diffusion limited aggregation on a spanning-tree-weighted random planar map (1901.06860v4)

Published 21 Jan 2019 in math.PR, math-ph, and math.MP

Abstract: Let $M$ be the infinite spanning-tree-weighted random planar map, which is the local limit of finite random planar maps sampled with probability proportional to the number of spanning trees they admit. We show that a.s. the $M$-graph-distance diameter of the external diffusion-limited aggregation (DLA) cluster on $M$ run for $m$ steps is of order $m{2/d + o_m(1)}$, where $d$ is the metric ball volume growth exponent for $M$ (which was shown to exist by Ding-Gwynne, 2018). By known bounds for $d$, one has $0.55051\ldots \leq 2/d \leq 0.563315\ldots$. Along the way, we also prove that loop-erased random walk (LERW) on $M$ typically travels graph distance $m{2/d + o_m(1)}$ in $m$ units of time and that the graph-distance diameter of a finite spanning-tree-weighted random planar map with $n$ edges, with or without boundary, is of order $n{1/d+o_n(1)}$ except on an event with probability decaying faster than any negative power of $n$. Our proofs are based on a special relationship between DLA and LERW on spanning-tree-weighted random planar maps as well as estimates for distances in such maps which come from the theory of Liouville quantum gravity.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Paper to Video (Beta)

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.