We consider the DLA process on a cylinder G x N. It is shown that this process "grows arms", provided that the base graph G has small enough mixing time. Specifically, if the mixing time of G is at most (log|G|)^(2-\eps), the time it takes the cluster to reach the m-th layer of the cylinder is at most of order m |G|/loglog|G|. In particular we get examples of infinite Cayley graphs of degree 5, for which the DLA cluster on these graphs has arbitrarily small density.
In addition, we provide an upper bound on the rate at which the "arms" grow. This bound is valid for a large class of base graphs G, including discrete tori of dimension at least 3.
It is also shown that for any base graph G, the density of the DLA process on a G-cylinder is related to the rate at which the arms of the cluster grow. This implies, that for any vertex transitive G, the density of DLA on a G-cylinder is bounded by 2/3.
We consider an analogous version of the diffusion-limited aggregation model defined on the hyperbolic plane. We prove that almost surely the aggregate viewed at time infinity will have a positive density.
In this paper we study the structure of the limit aggregate $A_\infty = \bigcup_{n\geq 0} A_n$ of the one-dimensional long range diffusion limited aggregation process defined in [AABK09]. We show (under some regularity conditions) that for walks with finite third moment $A_\infty$ has renewal structure and positive density, while for walks with finite variance the renewal structure no longer exists and $A_\infty$ has 0 density. We define a tree structure on the aggregates and show some results on the degrees and number of ends of these random trees. We introduce a new "harmonic competition" mo…
We revisit Kesten's argument for the upper bound on the growth rate of DLA. We are able to make the argument robust enough so that it applies to many graphs, where only control of the heat kernel is required. We apply this to many examples including transitive graphs of polynomial growth, graphs of exponential growth, non-amenable graphs, super-critical percolation on Z^d, high dimensional pre-Sierpinski carpets. We also observe that a careful analysis shows that Kesten's original bound on Z^3 can be improved from t^{2/3} to (t log t)^{1/2} .
We prove that the one dimensional Multi-Particle Diffusion Limited Aggregation model has linear growth whenever the particle density exceeds 1 answering a question of Kesten and Sidoravicius. As a corollary we prove linear growth in all dimensions d when the particle density is at least 1.
We present precise asymptotics of the odometer function for the internal Diffusion Limited Aggregation model. These results provide a better understanding of this function whose importance was demonstrated by Levine and Peres. We derive a different proof of a time-scale result by Lawler, Bramson and Griffeath.
In this article, we study the parameter estimation of interacting particle systems subject to the Newtonian aggregation and Brownian diffusion. Specifically, we construct an estimator $\widehatν$ with partial observed data to approximate the diffusion parameter $ν$, and the estimation error is achieved. Furthermore, we extend this result to general aggregation equations with a bounded Lipschitz interaction field.
We study internal diffusion-limited aggregation with random starting points on Z^d. In this model, each new particle starts from a vertex chosen uniformly at random on the existing aggregate. We prove that the limiting shape of the aggregate is a Euclidean ball.
In this paper, we define a directed version of the Diffusion-Limited-Aggregation model. We present several equivalent definitions in finite volume and a definition in infinite volume. We obtain bounds on the speed of propagation of information in infinite volume and explore the geometry of the infinite cluster. We also explain how these results fit in a strategy for proving a shape theorem for this model.
We examine diffusion-limited aggregation for a one-dimensional random walk with long jumps. We achieve upper and lower bounds on the growth rate of the aggregate as a function of the number of moments a single step of the walk has. In this paper we handle the case of transient walks.
We examine diffusion-limited aggregation generated by a random walk on Z with long jumps. We derive upper and lower bounds on the growth rate of the aggregate as a function of the number moments a single step of the walk has. Under various regularity conditions on the tail of the step distribution, we prove that the diameter grows as n^{beta+o(1)}, with an explicitly given beta. The growth rate of the aggregate is shown to have three phase transitions, when the walk steps have finite third moment, finite variance, and, conjecturally, finite half moment.
The Internal Diffusion Limited Aggregation has been introduced by Diaconis and Fulton in 1991. It is a growth model defined on an infinite set and associated to a Markov chain on this set. We focus here on sets which are finitely generated groups with exponential growth. We prove a shape theorem for the Internal DLA on such groups associated to symmetric random walks. For that purpose, we introduce a new distance associated to the Green function, which happens to have some interesting properties. In the case of homogeneous trees, we also get the right order for the fluctuations of that model a…
This paper has been withdrawn by the author due to an error in the computation of E(n,x) on page 6 which appears to be essential for the result. The author is currently trying to correct this proof
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 Euclidean balls, with high probability. In this article, we complete the picture and prove a limit-shape theorem for IDLA on such percolation clusters, by providing the corresponding upper bound. The technique to prove upper bounds is new and robust: it only requires the existence of a "good" lower bound. Specifically, this way of proving upper bounds on IDLA c…
Energetic characterisation of transient clustering dynamics in aggregation-diffusion systems
Zuse Institute Berlin（柏林齐泽研究所）；Freie Universität Berlin（柏林自由大学）；Technische Universität Berlin（柏林工业大学）；Brandenburgische Technische Universität Cottbus–Senftenberg（勃兰登堡科技大学科特布斯-森夫滕贝格分校）
We study the following growth model on a regular d-ary tree. Points at distance n adjacent to the existing subtree are added with probabilities proportional to alpha^{-n}, where alpha<1 is a positive real parameter. The heights of these clusters are shown to increase linearly with their total size; this complements known results that show the height increases only logarithmically when alpha>=1. Results are obtained using stochastic monotonicity and regeneration results which may be of independent interest. Our motivation comes from two other ways in which the model may be viewed: as a problem …
Aggregation equations, such as the parabolic-elliptic Patlak-Keller-Segel model, are known to have an optimal threshold for global existence vs. finite-time blow-up. In particular, if the diffusion is absent, then all smooth solutions with finite second moment can exist only locally in time. Nevertheless, one can ask whether global existence can be restored by adding a suitable noise to the equation, so that the dynamics are now stochastic. Inspired by the work of Buckmaster et al. arXiv:1806.03734 showing that, with high probability, the inviscid SQG equation with random diffusion has global …
We build the iDLA cluster using drifted random walks, and study the limiting shapes they exhibit, with the help of sandpile models. For constant drift, the normalised cluster converges to a canonical shape S, which can be termed a true heat ball, in that it gives rise to a mean value property for caloric functions. The existence and boundedness of such a shape answers a natural yet open question in PDE theory.
In the Diffusion Limited Aggregation (DLA) process on on $\mathbb{Z}^2$, or more generally $\mathbb{Z}^d$, particles aggregate to an initially occupied origin by arrivals on a random walk. The scaling limit of the result, empirically, is a fractal with dimension strictly less than $d$. Very little has been shown rigorously about the process, however. We study an analogous process on the Boolean lattice $\{0,1\}^n$, in which particles take random decreasing walks from $(1,\dots,1)$, and stick at the last vertex before they encounter an occupied site for the first time; the vertex $(0,\dots,0)$ …
We consider the anisotropic three dimensional XXZ Heisenberg ferromagnet in a cylinder with axis along the 111 direction and boundary conditions that induce ground states describing an interface orthogonal to the cylinder axis. Let $L$ be the linear size of the basis of the cylinder. Because of the breaking of the continuous symmetry around the $\hat z$ axis, the Goldstone theorem implies that the spectral gap above such ground states must tend to zero as $L\to \infty$. In \cite{BCNS} it was proved that, by perturbing in a sub--cylinder with basis of linear size $R\ll L$ the interface ground s…
We consider a cluster growth model on Z^d, called internal diffusion limited aggregation (internal DLA). In this model, random walks start at the origin, one at a time, and stop moving when reaching a site not occupied by previous walks. It is known that the asymptotic shape of the cluster is spherical. Also, when dimension is 2 or more, and when the cluster has volume $n^d$, it is known that fluctuations of the radius are at most of order $n^{1/3}$. We improve this estimate to $n^{1/(d+1)}$, in dimension 3 or more. In so doing, we introduce a closely related cluster growth model, that we call…
