Related papers: Localisation in a growth model with interaction. A…
This paper concerns the long term behaviour of a growth model describing a random sequential allocation of particles on a finite cycle graph. The model can be regarded as a reinforced urn model with graph-based interactions. It is motivated…
We introduce a sequential model for the deposition and aggregation of particles in the submonolayer regime. Once a particle has been randomly deposited on the substrate, it sticks to the closest atom or island within a distance \ell,…
A simple, discrete, parametric model is proposed to describe conditional (correlated) deposition of particles on a surface and formation of a connecting (percolating) cluster. The surface changes spontaneously its properties (phase…
We study the surface growth generated by the random deposition of particles of different sizes. A model is proposed where the particles are aggregated on an initially flat surface, giving rise to a rough interface and a porous bulk. By…
An investigation of the effect of surface diffusion in random deposition model is made by analytical methods and reasoning. For any given site, the extent to which a particle can diffuse is decided by the morphology in the immediate…
We introduce a simple model of population dynamics which considers birth and death rates for every individual that depend on the number of particles in its neighborhood. The model shows an inhomogeneous quasistationary pattern with many…
We consider particles on a one-dimensional lattice whose evolution is governed by nearest-neighbor interactions where particles that have reached size zero are removed from the system. Concentrating on configurations with infinitely many…
We consider a preferential growth model where particles are added one by one to the system consisting of clusters of particles. A new particle can either form a new cluster (with probability q) or join an already existing cluster with a…
Diffusion in a one dimensional random force field leads to interesting localisation effects, which we study using the equivalence with a directed walk model with traps. We show that although the average dispersion of positions $\bar{< x^2 >…
Given a finite connected graph G, place a bin at each vertex. Two bins are called a pair if they share an edge of G. At discrete times, a ball is added to each pair of bins. In a pair of bins, one of the bins gets the ball with probability…
We introduce a stochastic agent-based model for the flocking dynamics of self-propelled particles that exhibit velocity-alignment interactions with neighbours within their field of view. The stochasticity in the dynamics of the model arises…
We study a system of interacting reinforced random walks defined on polygons. At each stage, each particle chooses an edge to traverse which is incident to its position. We allow the probability of choosing a given edge to depend on the sum…
We describe a previously unexplored effect of the continuous spontaneous localization model whereby a correlation develops in the distributions of two nearby non-interacting particles following a period of diffusion. We propose the use of…
We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…
We introduce and investigate a new model of a finite number of particles jumping forward on the real line. The jump lengths are independent of everything, but the jump rate of each particle depends on the relative position of the particle…
An individual-based model of an infinite system of point particles in $\mathbb{R}^d$ is proposed and studied. In this model, each particle at random produces a finite number of new particles and disappears afterwards. The phase space for…
We consider a preferential growth model where particles are added one by one to the system consisting of clusters of particles. A new particle can either form a new cluster (with probability q) or join an already existing cluster with a…
The frog model is a stochastic model for the spreading of an epidemic on a graph, in which a dormant particle starts to perform a simple random walk on the graph and to awake other particles, once it becomes active. We study two versions of…
In this work we study numerically the effects of the angle of deposition of particles in the growth process of a thin-film generated by aggregation of particles added at random. The particles are aggregated in a random position of an…
We introduce a model of a preferential attachment based random graph which extends the family of models in which condensation phenomena can occur. Each vertex has an associated uniform random variable which we call its location. Our model…