English
Related papers

Related papers: Diffusion limited aggregation in the layers model

200 papers

In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…

Data Structures and Algorithms · Computer Science 2016-12-28 Colin Cooper , Robert Elsasser , Hirotaka Ono , Tomasz Radzik

When identical particles on a line collide, they merge and continue as one. Exact determinantal formulas have long been available for particles conditioned never to collide, but collisions change the number of particles, and exact…

Probability · Mathematics 2026-03-10 Piotr Śniady

In this paper we intend to present a unified treatment of a variety of singular interacting particle systems and their McKean-Vlasov limits. This unified approach is based on the use of the relative entropy on the path space in the spirit…

Analysis of PDEs · Mathematics 2024-12-11 Patrick Cattiaux

We study one-dimensional multi-particle Diffusion Limited Aggregation (MDLA) at its critical density $\lambda=1$. Previous works have verified that the size of the aggregate $X_t$ at time $t$ is $t^{1/2}$ in the subcritical regime and…

Probability · Mathematics 2020-09-11 Dor Elboim , Danny Nam , Allan Sly

The two-dimensional comb lattice $C_2$ is a natural spanning tree of the Euclidean lattice $\mathbb{Z}^2$. We study three related cluster growth models on $C_2$: internal diffusion limited aggregation (IDLA), in which random walkers move on…

Probability · Mathematics 2012-04-13 Wilfried Huss , Ecaterina Sava

Coagulation-flocculation, the physicochemical process widely used for purification a wastewater, is affected both by chemical details of involved polymers and by the statistics of their conformations on a large scale. The latter aspect is…

Soft Condensed Matter · Physics 2024-07-23 V. Blavatska , Ja. Ilnytskyi , E. Lähderanta

We study a driven many particle system comprising of two identical lanes of finite lengths. On one lane, particles hop diffusively with a bias in a specific direction. On the other lane, particles hop in a specific direction obeying mutual…

Statistical Mechanics · Physics 2015-06-03 Bappa Saha , Sutapa Mukherji

The growth of a diffusion limited aggregation (DLA) cluster with mass $M$ and radius of gyration $R$ is described by a set of growth probabilities $\{ p_i\}$, where $p_i$ is the probability that the perimeter site $i$ will be the next to…

Condensed Matter · Physics 2009-10-22 Jysoo Lee , Stefan Schwarzer , Antonio Coniglio , H. Eugene Stanely

We show that Internal Diffusion Limited Aggregation (IDLA) on $\mathbb{Z}^d$ has near optimal Cheeger constant when the growing cluster is large enough. This implies, through a heat kernel lower bound derived previously in [H], that simple…

Probability · Mathematics 2019-04-18 Ruojun Huang

We study a family of interacting particle systems with annihilating and coalescing reactions. Two types of particles are interspersed throughout a transitive unimodular graph. Both types diffuse as simple random walks with possibly…

Probability · Mathematics 2025-11-04 Sungwon Ahn , Matthew Junge , Hanbaek Lyu , Lily Reeves , Jacob Richey , David Sivakoff

We consider internal diffusion limited aggregation in dimension larger than or equal to two. This is a random cluster growth model, where random walks start at the origin of the d-dimensional lattice, one at a time, and stop moving when…

Probability · Mathematics 2011-11-21 Amine Asselah , Alexandre Gaudilliere

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…

Statistical Mechanics · Physics 2009-11-07 Thomas C. Halsey

We develop a technique for probing harmonic measure of the diffusion limited aggregation (DLA) cluster surface with the variable size particle and generate one thousand clusters with 50 million particles using original off-lattice…

Disordered Systems and Neural Networks · Physics 2007-05-23 A. Yu. Menshutin , L. N. Shchur , V. M. Vinokur

We consider the doubly infinite Sierpinski gasket graph $SG_0$, rescale it by factor $2^{-n}$, and on the rescaled graphs $SG_n=2^{-n}SG_0$, for every $n\in \mathbb{N}$, we investigate the limit shape of three aggregation models with…

Probability · Mathematics 2023-08-08 Uta Freiberg , Nico Heizmann , Robin Kaiser , Ecaterina Sava-Huss

We analyse the aggregate Loewner evolution (ALE), introduced in 2018 by Sola, Turner and Viklund to generalise versions of diffusion limited aggregation (DLA) in the plane using complex analysis. They showed convergence of the ALE for…

Probability · Mathematics 2026-05-27 Frankie Higgs

We consider the penetration length $l$ of random walkers diffusing in a medium of perfect or imperfect absorbers of number density $\rho$. We solve this problem on a lattice and in the continuum in all dimensions $D$, by means of a…

Statistical Mechanics · Physics 2009-11-11 David S. Dean , Clément Sire , Julien Sopik

We examine the aggregate behavior of one-dimensional random walks in a model known as (one-dimensional) Internal Diffusion Limited Aggregation. In this model, a sequence of $n$ particles perform random walks on the integers, beginning at…

Combinatorics · Mathematics 2019-02-11 Kiana Mittelstaedt

We simulate 50 off-lattice DLA clusters, one million particles each. The probability distribution of the angle of attachment of arriving particles with respect to the local radial direction is obtained numerically. For increasing cluster…

Condensed Matter · Physics 2009-10-22 Chi-Hang Lam

We consider point particle that collides with a periodic array of hard-core elastic scatterers where the length of the free flights is unbounded (the infinite-horizon Lorentz gas, LG). The Bleher central limit theorem (CLT) states that the…

Statistical Mechanics · Physics 2019-08-09 Itzhak Fouxon , Peter Ditlevsen

Internal DLA is a discrete model of a moving interface. On the cylinder graph $\mathbb{Z}_N \times \mathbb{Z}$, a particle starts uniformly on $\mathbb{Z}_N \times \{0\}$ and performs simple random walk on the cylinder until reaching an…

Probability · Mathematics 2018-10-16 Lionel Levine , Vittoria Silvestri
‹ Prev 1 4 5 6 7 8 10 Next ›