Related papers: Lower bounds on fluctuations for internal DLA

In previous works, we showed that the internal DLA cluster on \Z^d with t particles is a.s. spherical up to a maximal error of O(\log t) if d=2 and O(\sqrt{\log t}) if d > 2. This paper addresses "average error": in a certain sense, the…

We analyse how simple local constraints in two dimensions lead a defect to exhibit robust, non-transient, and tunable, subdiffusion. We uncover a rich dynamical phenomenology realised in ice- and dimer-type models. On the microscopic scale…

Diffusion Limited Aggregation (DLA) has served for forty years as a paradigmatic example for the creation of fractal growth patterns. In spite of thousands of references no exact result for the fractal dimension $D$ of DLA is known. In this…

The computational complexity of internal diffusion-limited aggregation (DLA) is examined from both a theoretical and a practical point of view. We show that for two or more dimensions, the problem of predicting the cluster from a given set…

We prove a finite volume lower bound of the order of the squareroot of log N on the delocalization of a disordered continuous spin model (resp. effective interface model) in d = 2 in a box of size N . The interaction is assumed to be…

We study a rotor-router version of the internal diffusion-limited aggregation introduced by J.Propp. The existing estimations of boundary fluctuations of the aggregation cluster show that they grow not faster than $O(\log r)$ with the…

Off-lattice DLA clusters grown with different levels of noise reduction are found to be consistent with a simple fractal fixed point. Cluster shapes and their ensemble variation exhibit a dominant slowest correction to scaling, and this…

For a class of aggregation models on the integer lattice $\mathbb{Z}^d$, $d\geq 2$, in which clusters are formed by particles arriving one after the other and sticking irreversibly where they first hit the cluster, including the classical…

Internal Diffusion Limited Aggregation (IDLA) is a model that describes the growth of a random aggregate of particles from the inside out. Shellef proved that IDLA processes on supercritical percolation clusters of integer-lattices fill…

Diffusion-limited aggregation has a natural generalization to the "$\eta$-models", in which $\eta$ random walkers must arrive at a point on the cluster surface in order for growth to occur. It has recently been proposed that in spatial…

In this paper, we deal with the inner boundary of random walk range, that is, the set of those points in a random walk range which have at least one neighbor site outside the range. If $L_n$ be the number of the inner boundary points of…

In this paper we study the fluctuations from the limiting behavior of small noise random perturbations of diffusions with multiple scales. The result is then applied to the exit problem for multiscale diffusions, deriving the limiting law…

We consider branching random walks in $d$-dimensional integer lattice with time-space i.i.d. offspring distributions. When $d \ge 3$ and the fluctuation of the environment is well moderated by the random walk, we prove a central limit…

We study the fractal structure of Diffusion-Limited Aggregation (DLA) clusters on the square lattice by extensive numerical simulations (with clusters having up to $10^8$ particles). We observe that DLA clusters undergo strongly anisotropic…

The paper suggests a generalisation of the diffusion-limited aggregation (DLA) based on using a general stochastic process to control particle movements before sticking to a growing cluster. This leads to models with variable…

Diffusion-limited cluster aggregation (DLCA) is a well established model for the formation of highly porous low-density non-equilibrium structures. One of the main conclusions of the previous studies considering this model is that the…

We introduce a new self-interacting random walk on the integers in a dynamic random environment and show that it converges to a pure diffusion in the scaling limit. We also find a lower bound on the diffusion coefficient in some special…

We propose a simple model of columnar growth through {\it diffusion limited aggregation} (DLA). Consider a graph $G_N\times\N$, where the basis has $N$ vertices $G_N:=\{1,\dots,N\}$, and two vertices $(x,h)$ and $(x',h')$ are adjacent if…

We prove $\sqrt{\log n}$ lower bounds on the order of growth fluctuations in three planar growth models (first-passage percolation, last-passage percolation, and directed polymers) under no assumptions on the distribution of vertex or edge…

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…