Related papers: On Diffusion Limited Deposition
The process by which one may take a discrete model of a biophysical process and construct a continuous model based on it is of mathematical interest as well as being of practical use. In this paper, we first study the singular limit of a…
We present and study the Pool model in $\mathbb{R}^2$, a rotationally symmetric analogue of Multi-Particle Diffusion-Limited Aggregation (MDLA), in which particles ("droplets") perform continuous-time random walks and are absorbed upon…
In present models cloud based lightning forms as a consequence of the earth's gravitational and/or electromagnetic fields. Our simplified field-free model probes the random aggregation of a neutral ensemble consisting of a random…
We consider (a variant of) the external multi-particle diffusion-limited aggregation (MDLA) process of Rosenstock and Marquardt on the plane. Based on the recent findings of [11], [10] in one space dimension it is natural to conjecture that…
We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a "least action principle" which characterizes the odometer function of the growth process.…
We consider the single-file dynamics of $N$ identical random walkers moving with diffusivity $D$ in one dimension (walkers bounce off each other when attempting to overtake). Additionally, we require that the separation between neighboring…
We examine the abundance, clustering and metallicity of Damped Lyman-alpha Absorbers (DLAs) in a suite of hydrodynamic cosmological simulations using the moving mesh code AREPO. We incorporate models of supernova and AGN feedback, as well…
We show, in this report, how a population balance model differential equation describing batch crystal growth from solution can be solved in closed form for the case of diffusion limited growth with and without modeling the effects of…
Conventional wisdom in the sampling literature, backed by a popular diffusion scaling limit, suggests that the mixing time of the Metropolis-Adjusted Langevin Algorithm (MALA) scales as $O(d^{1/3})$, where $d$ is the dimension. However, the…
Diffusion-coagulation can be simply described by a dynamic where particles perform a random walk on a lattice and coalesce with probability unity when meeting on the same site. Such processes display non-equilibrium properties with strong…
Using high precision Monte Carlo simulations and a mean-field theory, we explore coarsening phenomena in a simple driven diffusive system. The model is reminiscent of vehicular traffic on a two-lane ring road. At sufficiently high density,…
This paper proposes and analyzes a novel clustering algorithm that combines graph-based diffusion geometry with techniques based on density and mode estimation. The proposed method is suitable for data generated from mixtures of…
We study the generalized diffusion-limited aggregates (DLA), with two seeds placed at distance d lattice units and investigate the probability p(d) that the patterns generated from those seeds get connected. In this model, one can vary the…
We extend the conformal mapping approach elaborated for the radial Diffusion Limited Aggregation model (DLA) to the cylindrical geometry. We introduce in particular a complex function which allows to grow a cylindrical cluster using as…
Consider a critical nearest neighbor branching random walk on the $d$-dimensional integer lattice initiated by a single particle at the origin. Let $G_{n}$ be the event that the branching random walk survives to generation $n$. We obtain…
We extend a previously proposed deposition model with two kinds of particles, considering the restricted solid-on-solid condition. The probability of incidence of particle C (A) is p (1-p). Aggregation is possible if the top of the column…
We revisit the statistics of extremes and records of symmetric random walks with stochastic resetting, extending earlier studies in several directions. We put forward a diffusive scaling regime (symmetric step length distribution with…
In this paper we propose algorithms for allocating $n$ sequential balls into $n$ bins that are interconnected as a $d$-regular $n$-vertex graph $G$, where $d\ge3$ can be any integer.Let $l$ be a given positive integer. In each round $t$,…
Growth of hard--rod monolayers via deposition is studied in a lattice model using rods with discrete orientations and in a continuum model with hard spherocylinders. The lattice model is treated with kinetic Monte Carlo simulations and…
Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…