Related papers: Diffusion limited aggregation in the layers model
Numerical simulations of Diffusion-Limited and Reaction-Limited Cluster-Cluster Aggregation processes of identical particles are performed in a two-dimensional box. It is shown that, for concentrations larger than a characteristic gel…
This paper concerns the long term behaviour of a growth model describing a random sequential deposition of particles on a finite graph. The probability of allocating a particle at a vertex is proportional to a log-linear function of numbers…
We study several fundamental properties of a class of stochastic processes called spatial Lambda-coalescents. In these models, a number of particles perform independent random walks on some underlying graph G. In addition, particles on the…
Single-file diffusion refers to the motion of diffusive particles in narrow channels, so that they cannot bypass each other. This constraint leads to the subdiffusion of a tagged particle, called the tracer. This anomalous behaviour results…
The standard setup for single-file diffusion is diffusing particles in one dimension which cannot overtake each other, where the dynamics of a tracer (tagged) particle is of main interest. In this article we generalise this system and…
We apply a probabilistic clustering method, Latent Dirichlet Allocation (LDA), to characterize the largescale dynamics of Rayleigh-B\'enard convection. The method, introduced in Frihat et al. 2021, is applied to a collection of snapshots in…
We study here one-dimensional model of aggregation and fragmentation of clusters of particles obeying the stochastic discrete-time kinetics of the generalized Totally Asymmetric Simple Exclusion Process (gTASEP) on open chains. Isolated…
The velocity profiles of weak metal absorption lines can be used to observationally probe the kinematic state of gas in damped Lyman-alpha systems. Prochaska and Wolfe have argued that the flat distribution of velocity widths combined with…
For an arbitrary initial configuration of discrete loads over vertices of a distributed graph, we consider the problem of minimizing the {\em discrepancy} between the maximum and minimum loads among all vertices. For this problem, this…
We consider bootstrap percolation and diffusion in sparse random graphs with fixed degrees, constructed by configuration model. Every node has two states: it is either active or inactive. We assume that to each node is assigned a…
Diffusion has been widely used to describe a random walk of particles or waves, and it requires only one parameter -- the diffusion constant. For waves, however, diffusion is an approximation that disregards the possibility of interference.…
In the simplest model of single-file diffusion, $N$ point particles wander on a segment of the $x$ axis of length $L$, with hard core interactions, which prevent passing, and with overdamped Brownian dynamics, $\lambda\dot{x}=\eta(t)$,…
Dilute granular flows are routinely described by collisional kinetic theory, but dense flows require a fundamentally different approach, due to long-lasting, many-body contacts. In the case of silo drainage, many continuum models have been…
Diffusion models form an important class of generative models today, accounting for much of the state of the art in cutting edge AI research. While numerous extensions beyond image and video generation exist, few of such approaches address…
Diffusions and related random walk procedures are of central importance in many areas of machine learning, data analysis, and applied mathematics. Because they spread mass agnostically at each step in an iterative manner, they can sometimes…
Biological cells can release compounds into their direct environment, generally inhomogeneously over their cell membrane, after which the compounds spread by diffusion. In mathematical modelling and simulation of a collective of such cells,…
We study mean-field inclusion processes with an additional slow phase, in which particle interactions occur at a vanishing rate proportional to the inverse system size. In the thermodynamic limit, such systems exhibit condensation at high…
Latent Dirichlet Allocation (LDA) is a foundational model for discovering latent thematic structure in discrete data, but its Dirichlet prior cannot represent the rich correlations and hierarchical relationships often present among topics.…
Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for…
We use coupling ideas introduced in \cite{levine2018long} to show that an IDLA process on a cylinder graph $G\times \mathbb{Z}$ forgets a typical initial profile in $\mathcal{O}( N\sqrt{\tau_N} (\log \! N)^2 )$ steps for large $N$, where…