Related papers: Diffusion Limited Aggregation on a Cylinder
Deposits of dipolar particles are investigated by means of extensive Monte Carlo simulations. We found that the effect of the interactions is described by an initial, non-universal, scaling regime characterized by orientationally ordered…
This paper studies clustering algorithms for dynamically evolving graphs $\{G_t\}$, in which new edges (and potential new vertices) are added into a graph, and the underlying cluster structure of the graph can gradually change. The paper…
We prove that the the mixing time of the Glauber dynamics for sampling independent sets on $n$-vertex $k$-uniform hypergraphs is $O(n\log n)$ when the maximum degree $\Delta$ satisfies $\Delta \leq c 2^{k/2}$, improving on the previous…
A parallel algorithm for ``diffusion-limited aggregation'' (DLA) is described and analyzed from the perspective of computational complexity. The dynamic exponent z of the algorithm is defined with respect to the probabilistic parallel…
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…
We present 4 new measurements of nitrogen abundances and one upper limit in damped Lyman alpha absorbers (DLAs) obtained by means of high resolution (FWHM \~ 7 km/s) UVES/VLT spectra. In addition to these measurements we have compiled data…
We repeat the numerical experiments for diffusion limited aggregation (DLA) and show that there is a potentially infinite set of conserved quantities for the long time asymptotics. We connect these observations with the exact integrability…
We study domain growth properties of two species of particles executing biased diffusion on a half-filled square lattice, consisting of just two lanes. Driven in opposite directions by an external ``electric'' field, the particles form…
Incompressible flows can be effective mixers by appropriately advecting a passive tracer to produce small filamentation length scales. In addition, diffusion is generally perceived as beneficial to mixing due to its ability to homogenise a…
We consider diffusion limited aggregation of particles of two different kinds. It is assumed that a particle of one kind may adhere only to another particle of the same kind. The particles aggregate on a linear substrate which consists of…
Benjamini, Finucane and the first author have shown that if (G_n,S_n) is a sequence of Cayley graphs such that |S_n^n|=O(n^D|S_n|), then the sequence (G_n,d_{S_n}/n) is relatively compact for the Gromov-Hausdorff topology and every cluster…
We study the scaling limits of three different aggregation models on the integer lattice Z^d: internal DLA, in which particles perform random walks until reaching an unoccupied site; the rotor-router model, in which particles perform…
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…
We present a new technique to efficiently sample and communicate a large number of elements from a distributed sampling space. When used in the context of a recent LOCAL algorithm for $(\operatorname{degree}+1)$-list-coloring (D1LC), this…
We prove that if L is a finite simple group of Lie type and A a symmetric set of generators of L, then A grows i.e |AAA| > |A|^{1+epsilon} where epsilon depends only on the Lie rank of L, or AAA=L. This implies that for a family of simple…
We observe that gold atoms deposited by physical vapor deposition onto few layer graphenes condense upon annealing to form nanoparticles with an average diameter that is determined by the graphene film thickness. The data are well described…
Extensive numerical simulation are reported for the structure and dynamics of large clusters on metal(100) surfaces. Different types of perimeter hopping processes makes center-of-mass of the cluster to follow a a random walk trajectory.…
We prove that any Markov chain that performs local, reversible updates on randomly chosen vertices of a bounded-degree graph necessarily has mixing time at least $\Omega(n\log n)$, where $n$ is the number of vertices. Our bound applies to…
This paper presents an overview of recent computer simulations of grain boundary (GB) diffusion focusing on atomistic understanding of diffusion mechanisms. At low temperatures when GB structure is ordered, diffusion is mediated by point…
In an attempt to find generic features on the fractal growth of Au films deposited on Ru(001), a simple simulation model based on irreversible diffusion-limited aggregation (DLA) is discussed. Highly irregular two-dimensional dentritic…