Related papers: How long does it take for Internal DLA to forget i…
Single particle tracking of mRNA molecules and lipid granules in living cells shows that the time averaged mean squared displacement $\overline{\delta^2}$ of individual particles remains a random variable while indicating that the particle…
Place an $A$-particle at each site of a graph independently with probability $p$ and otherwise place a $B$-particle. $A$- and $B$-particles perform independent continuous time random walks at rates $\lambda_A$ and $\lambda_B$, respectively,…
Low-dimensional, complex systems are often characterized by logarithmically slow dynamics. We study the generic motion of a labeled particle in an ensemble of identical diffusing particles with hardcore interactions in a strongly…
We uncover a duality between relaxation and first passage processes in ergodic reversible Markovian dynamics in both discrete and continuous state-space. The duality exists in the form of a spectral interlacing -- the respective time scales…
Diffusion-limited aggregation (DLA) assumes that particles perform pure random walk at a finite temperature and aggregate when they come close enough and stick together. Although it is well known that DLA in two dimensions results in a…
Intracellular processes often rely on the timely encounter of mobile reaction partners, including intermittently motor-driven organelles. The underlying cytoskeletal network presents a complex landscape that both directs particle movement…
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…
Let A(t) denote the cluster produced by internal diffusion limited aggregation (internal DLA) with t particles in dimension d > 2. We show that A(t) is approximately spherical, up to an O(\sqrt{\log t}) error.
Consider a dynamical system given by a planar differential equation, which exhibits an unstable periodic orbit surrounding a stable periodic orbit. It is known that under random perturbations, the distribution of locations where the…
We consider first-passage percolation on a ladder, i.e. the graph {0,1,...}*{0,1} where nodes at distance 1 are joined by an edge, and the times are exponentially i.i.d. with mean 1. We find an appropriate Markov chain to calculate an…
When suitably rescaled, the distribution of the angular gaps between branches of off-lattice radial DLA is shown to approach a size-independent limit. The power-law expected from an asymptotic fractal dimension D=1.71 arises only for very…
The motion of particles through density-stratified interfaces is a common phenomenon in environmental and engineering applications. However, the mechanics of particle-stratification interactions in various combinations of particle and fluid…
It is shown that computer simulations can qualitatively reproduce experiments, where a powder of cohesive, round, hard particles is periodically deformed at constant volume. Two types of initial configurations are considered: Uniaxially…
We consider the following problem in one-dimensional diffusion-limited aggregation (DLA). At time $t$, we have an "aggregate" consisting of $\Bbb{Z}\cap[0,R(t)]$ [with $R(t)$ a positive integer]. We also have $N(i,t)$ particles at $i$,…
We consider an interacting particle system on the one dimensional lattice $\bf Z$ modeling combustion. The process depends on two integer parameters $2\le a<M<\infty$. Particles move independently as continuous time simple symmetric random…
We present an approach, based on learning an intrinsic data manifold, for the initialization of the internal state values of LSTM recurrent neural networks, ensuring consistency with the initial observed input data. Exploiting the…
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…
We consider an elementary model for self-organised criticality, the activated random walk on the complete graph. We introduce a discrete time Markov chain as follows. At each time step, we add an active particle at a random vertex and let…
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…
We consider a discrete-time system of n coupled random vectors, a.k.a. interacting particles. The dynamics involve a vanishing step size, some random centered perturbations, and a mean vector field which induces the coupling between the…