Related papers: Small particle limits in a regularized Laplacian r…
We establish quantitative spherical shape theorems for rotor-router aggregation and abelian sandpile growth on the graphical Sierpinski gasket ($SG$) when particles are launched from the corner vertex. In particular, the abelian sandpile…
The initial purpose of this work is to provide a probabilistic explanation of a recent result on a version of Smoluchowski's coagulation equations in which the number of aggregations is limited. The latter models the deterministic evolution…
We prove bulk scaling limits and fluctuation scaling limits for a two-parameter class ALE$(\alpha,\eta)$ of continuum planar aggregation models. The class includes regularized versions of the Hastings--Levitov family HL$(\alpha)$ and…
A nested family of growing or shrinking planar domains is called a Laplacian growth process if the normal velocity of each domain's boundary is proportional to the gradient of the domain's Green function with a fixed singularity on the…
In this paper, we analyze the scaling behavior of \emph{Diffusion Limited Aggregation} (DLA) simulated by Hastings-Levitov method. We obtain the fractal dimension of the clusters by direct analysis of the geometrical patterns in a good…
We use a simulation-based modelling approach to analyse the anisotropic clustering of the BOSS LOWZ sample over the radial range $0.4 \, h^{-1} \, \mathrm{Mpc}$ to $63 \, h^{-1} \, \mathrm{Mpc}$, significantly extending what is possible…
A simple theory, based on observations of snowflake distribution in a turbulent flow, is proposed to model the growth of inertial particles as a result of dynamic clustering at scales larger than the Kolmogorov length scale. Particles able…
We construct and study a stationary version of the Hastings-Levitov$(0)$ model. We prove that, unlike in the classical HL$(0)$ model, in the stationary case the size of particles attaching to the aggregate is tight, and therefore SHL$(0)$…
Diffusion-Limited Aggregation (DLA), the canonical model for non-equilibrium fractal growth, emerges from the simple rule of irreversible attachment by random walkers. Despite four decades of study, a unified computational framework…
We regularize the Laplacian growth problem with zero surface tension by introducing a short-distance cutoff $\hbar$, so that the change of the area of domains is quantized and equals an integer multiple of the area quanta $\hbar$. The…
We present exact results for a lattice model of cluster growth in 1D. The growth mechanism involves interface hopping and pairwise annihilation supplemented by spontaneous creation of the stable-phase, +1, regions by overturning the…
We study non-compact scaling limits of uniform random planar quadrangulations with a boundary when their size tends to infinity. Depending on the asymptotic behavior of the boundary size and the choice of the scaling factor, we observe…
The method of iterated conformal maps for the study of Diffusion Limited Aggregates (DLA) is generalized to the study of Laplacian Growth Patterns and related processes. We emphasize the fundamental difference between these processes: DLA…
A point source on a plane constantly emits particles which rapidly diffuse and then stick to a growing cluster. The growth probability of a cluster is presented as a sum over all possible scenarios leading to the same final shape. The…
The talk presented at ICMP 97 focused on the scaling limits of critical percolation models, and some other systems whose salient features can be described by collections of random lines. In the scaling limit we keep track of features seen…
In the high dimensional Stochastic Blockmodel for a random network, the number of clusters (or blocks) K grows with the number of nodes N. Two previous studies have examined the statistical estimation performance of spectral clustering and…
We study the random simple connected cubic planar graph $\mathsf{C}_n$ with an even number $n$ of vertices. We show that the Brownian map arises as Gromov--Hausdorff--Prokhorov scaling limit of $\mathsf{C}_n$ as $n \in 2 \ndN$ tends to…
The empirical measure of an interacting particle system is a purely atomic random probability measure. In the limit as the number of particles grows to infinity, we show for McKean-Vlasov systems with common noise that this measure becomes…
We study statistical and computational limits of clustering when the means of the centres are sparse and their dimension is possibly much larger than the sample size. Our theoretical analysis focuses on the model $X_i = z_i \theta +…
Conformal mapping models are used to study competition of noise and anisotropy in Laplacian growth. For that, a new family of models is introduced with the noise level and directional anisotropy controlled independently. Fractalization is…