Show simple item record

dc.contributor.authorSilvestri, Vittoria
dc.date.accessioned2022-02-09T04:29:06Z
dc.date.available2022-02-09T04:29:06Z
dc.date.issued2016-07
dc.identifier.urihttps://www.repository.cam.ac.uk/handle/1810/333771
dc.description.abstractWe 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$.en
dc.language.isoenen
dc.rightsAll Rights Reserved
dc.rights.urihttps://www.rioxx.net/licenses/all-rights-reserved/
dc.subjectHastings-Levitov
dc.subjectLaplacian growth
dc.subjectInternal Diffusion Limited Aggregation
dc.subjectFluctuations
dc.subjectMixing
dc.titleFluctuations and mixing for planar random growthen
dc.typeThesisen
dc.type.qualificationlevelDoctoralen
dc.type.qualificationnameDoctor of Philosophy (PhD)en
dc.publisher.institutionUniversity of Cambridgeen
dc.publisher.departmentDepartment of Pure Mathematics and Mathematical Statisticsen
dc.identifier.doi10.17863/CAM.81188
cam.supervisorNorris, James


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record