Fluctuations and mixing for planar random growth
View / Open Files
Authors
Silvestri, Vittoria
Advisors
Norris, James
Date
2016-07Awarding Institution
University of Cambridge
Author Affiliation
Department of Pure Mathematics and Mathematical Statistics
Qualification
Doctor of Philosophy (PhD)
Language
English
Type
Thesis
Metadata
Show full item recordCitation
Silvestri, V. (2016). Fluctuations and mixing for planar random growth (Doctoral thesis). https://doi.org/10.17863/CAM.81188
Abstract
We study two models of random growth by aggregation on the plane, which turn out to share similar asymptotic features.
The first part of this thesis focuses on the Hastings-Levitov model HL(0), according to which clusters of particles are built on the complex plane by iterated composition of random conformal maps. Following the scaling limit result of Norris and Turner (2012), who proved that the limiting shape of large HL(0) clusters is a disc, we show that the fluctuations around this deterministic shape are described by a random holomorphic Gaussian field $\mathcal{F}$ on {|z| > 1}, of which we provide an explicit construction. We find that the boundary values of $\mathcal{F}$ perform an Ornstein-Uhlenbeck process on an infinite-dimensional Hilbert space, which can be characterised as the solution of a Stochastic Fractional Heat Equation. When the cluster is allowed to grow indefinitely, this boundary process converges to a log-correlated Gaussian Field, which coincides in law with the restriction of a Gaussian Free Field on the 2-dimensional torus to the unit circle {|z| = 1}.
The same scaling limit and boundary fluctuations are found by Jerison, Levine and Sheffield (2014) to arise in a different growth model, namely Internal Diffusion Limited Aggregation (IDLA). According to this discrete model, the aggregation process defines a Markov Chain on the infinite space of IDLA configurations, for which Jerison, Levine and Sheffield ask the following mixing question: how long does it take for IDLA dynamics to essentially forget where it started? We provide a partial answer to this question in the second part of this thesis, using coupling techniques to obtain an upper bound for this forget time. Finally, we specialise to IDLA on the cylinder graph $\mathbb{Z}$$_{N}$ x $\mathbb{Z}$, and show that our bound is polynomial in the size $\textit{N}$ of the base graph, as $\textit{N}$ $\rightarrow$ $\infty$.
Keywords
Hastings-Levitov, Laplacian growth, Internal Diffusion Limited Aggregation, Fluctuations, Mixing
Identifiers
This record's DOI: https://doi.org/10.17863/CAM.81188
Statistics
Total file downloads (since January 2020). For more information on metrics see the
IRUS guide.
Recommended or similar items
The current recommendation prototype on the Apollo Repository will be turned off on 03 February 2023. Although the pilot has been fruitful for both parties, the service provider IKVA is focusing on horizon scanning products and so the recommender service can no longer be supported. We recognise the importance of recommender services in supporting research discovery and are evaluating offerings from other service providers. If you would like to offer feedback on this decision please contact us on: support@repository.cam.ac.uk