Related papers: Limit Theorems for Internal Aggregation Models

A fundamental problem in distributed computing is the distribution of requests to a set of uniform servers without a centralized controller. Classically, such problems are modeled as static balls into bins processes, where $m$ balls (tasks)…

We consider an infinite-dimensional stochastic clustering model on $\mathbb{R}$. In discrete time, each point of a unit-intensity simple point process moves halfway toward either of its left or right neighbors, chosen uniformly at random.…

Cylindrical lattice Diffusion Limited Aggregation (DLA), with a narrow width N, is solved using a Markovian matrix method. This matrix contains the probabilities that the front moves from one configuration to another at each growth step,…

Models of fractal growth commonly consider particles diffusing in a medium and that stick irreversibly to the forming aggregate when making contact for the first time. As shown by the well-known diffusion limited aggregation (DLA) model and…

We propose a revision of the classic mean-field approach of diffusion-limited aggregation (DLA) model originally introduced by Witten and Sander [Phys. Rev. Lett. 47, 1400 (1981)]. The derived nonlinear mean-field equations providing…

On the integer lattice we consider the discrete membrane model, a random interface in which the field has Laplacian interaction. We prove that, under appropriate rescaling, the discrete membrane model converges to the continuum membrane…

Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…

We study the relation between stochastic and continuous transport-limited growth models, which generalize conformal-mapping formulations of diffusion-limited aggregation (DLA) and viscous fingering, respectively. We derive a nonlinear…

Using both analytic and numerical methods, we study the radial growth probability distribution $P(r,M)$ for large scale off lattice diffusion limited aggregation (DLA) clusters. If the form of $P(r,M)$ is a Gaussian, we show analytically…

We study occupancy counts for the critical nearest-neighbor branching random walk on the $d$-dimensional lattice, conditioned on non-extinction. For $d\geq 3$, Lalley and Zheng (2011) showed that the properly scaled joint distribution of…

Diffusion-Limited Aggregation (DLA) is a cluster-growth model that consists in a set of particles that are sequentially aggregated over a two-dimensional grid. In this paper, we introduce a biased version of the DLA model, in which…

We consider a matrix branching random walk on the semi-group of nonnegative matrices, where we are able to derive, under general assumptions, an analogue of Biggins' martingale convergence theorem for the additive martingale $W_n$, a spinal…

We study a model of random $\mathcal{R}$-enriched trees that is based on weights on the $\mathcal{R}$-structures and allows for a unified treatment of a large family of random discrete structures. We establish distributional limits…

In this paper, we propose a new interpretation of local limit theorems for univariate and multivariate distributions on lattices. We show that - given a local limit theorem in the standard sense - the distributions are approximated well by…

We study the full distribution $P_M(S)$ of the number of distinct sites $S$ visited by a random walker on a $d$-dimensional lattice after $M$ steps. We focus on the case $d \ge 2$, and we are interested in the long-time limit $M \gg 1$. Our…

We study products of random isometries acting on Euclidean space. Building on previous work of the second author, we prove a local limit theorem for balls of shrinking radius with exponential speed under the assumption that a Markov…

We establish the scaling limit of a class of boundary random walks to the full spectrum of Brownian-type processes on the half-line. By solving the associated martingale problem and employing weak convergence techniques, we prove that under…

The sub-volume scaling of the entanglement entropy with the system's size, $n$, has been a subject of vigorous study in the last decade [1]. The area law provably holds for gapped one dimensional systems [2] and it was believed to be…

Using stochastic conformal mapping techniques we study the patterns emerging from Laplacian growth with a power-law decaying threshold for growth $R_N^{-\gamma}$ (where $R_N$ is the radius of the $N-$ particle cluster). For $\gamma > 1$ the…

We study the transport of self-propelled particles in dynamic complex environments. To obtain exact results, we introduce a model of run-and-tumble particles (RTPs) moving in discrete time on a $d$-dimensional cubic lattice in the presence…