Related papers: Coalescing random walks via the coalescence determ…
In the Diffusion Limited Aggregation (DLA) process on on $\mathbb{Z}^2$, or more generally $\mathbb{Z}^d$, particles aggregate to an initially occupied origin by arrivals on a random walk. The scaling limit of the result, empirically, is a…
With most of the focus to date having been on the coalescence of freely suspended droplets, much less is known about the coalescence of sessile droplets, especially in the case of droplets laden with surfactant. Here, we employ large-scale…
We study an infinite system of moving particles, where each particle is of type A or B. Particles perform independent random walks at rates D_A>0 and D_B>0, and the interaction is given by mutual annihilation A+B->0. The initial condition…
A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature is the incorporation of parts of the spectrum of the…
In this paper we consider coalescing random walks on a general connected graph $G=(V,E)$. We set up a unified framework to study the leading order of the decay rate of $P_t$, the expectation of the fraction of occupied sites at time $t$,…
We study a model of aggregation and fragmentation of clusters of particles on an open segment of a single-lane road. The particles and clusters obey the stochastic discrete-time discrete-space kinetics of the Totally Asymmetric Simple…
We introduce a system of Brownian particles, each absorbed upon hitting an associated moving boundary. The boundaries are determined by the conditional probabilities of the particles being absorbed before some final time horizon, given the…
We introduce the notion of a conditional distribution to a zero-probability event in a given direction of approximation, and prove that the conditional distribution of a family of independent Brownian particles to the event that their paths…
The recent realization that entire communities fuse and separate (community coalescence) has led to a reappraisal of the forces determining species diversity and dynamics, especially in microbial communities where coalescence is likely…
We consider Brownian motions with one-sided collisions, meaning that each particle is reflected at its right neighbour. For a finite number of particles a Sch\"{u}tz-type formula is derived for the transition probability. We investigate an…
We consider a random walk model in a one-dimensional environment, formed by several zones of finite width with the fixed transition probabilities. It is also assumed that the transitions to the left and right neighboring points have unequal…
When moist air meets a cold surface, it creates a breath figure characterized by numerous small droplets. The central question is how the vapor flux is distributed between the growth of previously condensed drops and the nucleation of new…
We calculate the diffusion coefficients of persistent random walks on cubic and hypercubic lattices, where the direction of a walker at a given step depends on the memory of one or two previous steps. These results are then applied to study…
We consider a non-homogeneous random walks system on $\bbZ$ in which each active particle performs a nearest neighbor random walk and activates all inactive particles it encounters up to a total amount of $L$ jumps. We present necessary and…
We consider the correlations and the hydrodynamic description of random walkers with a general finite memory moving on a $d$ dimensional hypercubic lattice. We derive a drift-diffusion equation and identify a memory-dependent critical…
We introduce a simple dynamical rule in which each particle locates a particle that is farthest from it and moves towards it. Repeated application of this algorithm results in the formation of unusual dynamical patterns: during the process…
We study interacting particle systems on the real line which generalize the Hammersley process [D. Aldous and P. Diaconis, Prob. Theory Relat. Fields 103, 199-213 (1995)]. Particles jump to the right to a randomly chosen point between their…
The probability distributions of discrete-time quantum walks have been often investigated, and many interesting properties of them have been discovered. The probability that the walker can be find at a position is defined by diagonal…
We introduce a modified model of random walk, and then develop two novel clustering algorithms based on it. In the algorithms, each data point in a dataset is considered as a particle which can move at random in space according to the…
We show that particle transport in a uniform, quantum multi-baker map, is generically ballistic in the long time limit, for any fixed value of Planck's constant. However, for fixed times, the semi-classical limit leads to diffusion. Random…