Related papers: Localisation in a growth model with interaction. A…
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…
Paper proposes a model of large networks based on a random preferential attachment graph with addition of complete subgraphs (cliques). The proposed model refers to models of random graphs following the nonlinear preferential attachment…
We consider a population of particles with unit life length. Dying each particle produces offspring whose size depends on the random environment specifying the reproduction law of all particles of the given generation and on the number of…
Irreversible random sequential deposition of interacting particles is widely used to model aggregation phenomena in physical, chemical, and biophysical systems. We show that in one dimension the exact time dependent solution of such…
We introduce a model for a growing random graph based on simultaneous reproduction of the vertices. The model can be thought of as a generalisation of the reproducing graphs of Southwell and Cannings and Bonato et al to allow for a random…
Representations of population models in terms of countable systems of particles are constructed, in which each particle has a `type', typically recording both spatial position and genetic type, and a level. For finite intensity models, the…
We study the evolution of an initially random distribution of particles on a square lattice, under certain rules for `growing' and `culling' of particles. In one version we allow the particles to move laterally along the surface (mobile…
We study a one-dimensional particles system, in the overdamped limit, where nearest particles attract with a force inversely proportional to a power of their distance and coalesce upon encounter. The detailed shape of the distribution…
Generalized Polya urn models can describe the dynamics of finite populations of interacting genotypes. Three basic questions these models can address are: Under what conditions does a population exhibit growth? On the event of growth, at…
Consider a system of $K$ particles moving on the vertex set of a finite connected graph with at most one particle per vertex. If there is one, the particle at $x$ chooses one of the $\hbox{deg} (x)$ neighbors of its location uniformly at…
The distribution function of particles over clusters is proposed for a system of identical intersecting spheres, the centres of which are uniformly distributed in space. Consideration is based on the concept of the rank number of clusters,…
We study preferential attachment mechanisms in random graphs that are parameterized by (i) a constant bias affecting the degree-biased distribution on the vertex set and (ii) the distribution of times at which new vertices are created by…
We report numerical simulation of the deposition of spherical particles on a planar surface, by ballistic, straight-line trajectory transport, and assuming irreversible adhesion on contact with the surface or previously deposited particles.…
We investigate the steady-state organisation of active particles residing on an interface. Particle activity induces interface deformations, while the local shape of the interface guides particle movement. We consider multiple species of…
In many growth processes particles are highly mobile in an active layer at the surface, but are relatively immobile once incorporated in the bulk. We study models in which atoms are allowed to interact, equilibrate, and order on the…
In the stochastic sandpile model on a graph, particles interact pairwise as follows: if two particles occupy the same vertex, they must each take an independent random walk step with some probability $0<p<1$ of not moving. These…
We consider a branching random walk on the lattice, where the branching rates are given by an i.i.d. Pareto random potential. We show a very strong form of intermittency, where with high probability most of the mass of the system is…
In this paper we consider the coalescence dynamics of a tagged particle moving in a random distribution of particles with volumes independently distributed according to a probability distribution (CTP model). We provide a rigorous…
We deal with a random graph model where at each step, a vertex is chosen uniformly at random, and it is either duplicated or its edges are deleted. Duplication has a given probability. We analyse the limit distribution of the degree of a…
We define a dynamic model of random networks, where new vertices are connected to old ones with a probability proportional to a sublinear function of their degree. We first give a strong limit law for the empirical degree distribution, and…