Related papers: Localisation in a growth model with interaction. A…
We consider an evolving network of a fixed number of nodes. The allocation of edges is a dynamical stochastic process inspired by biological reproduction dynamics, namely by deleting and duplicating existing nodes and their edges. The…
We consider diffusion-limited annihilating systems with mobile $A$-particles and stationary $B$-particles placed throughout a graph. Mutual annihilation occurs whenever an $A$-particle meets a $B$-particle. Such systems, when ran in…
This paper introduces the Attracting Random Walks model, which describes the dynamics of a system of particles on a graph with $n$ vertices. At each step, a single particle moves to an adjacent vertex (or stays at the current one) with…
We consider a discrete-time model for random interface growth which admits exact formulas and converges to the Polynuclear growth model in a particular limit. The height of the interface is initially flat and the evolution involves the…
We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…
We investigate the problem of growing clusters, which is modeled by two dimensional disks and three dimensional droplets. In this model we place a number of seeds on random locations on a lattice with an initial occupation probability, $p$.…
In this work, we study the long time asymptotics of a coagulation model which describes the evolution of a system of particles characterized by their volume and surface area. The aggregation mechanism takes place in two stages: collision…
In this note we make some specific observations on the distribution of the degree of a given vertex in certain model of randomly growing networks. The rule for network growth is the following. Starting with an initial graph of minimum…
Experiments have shown that self-propelled particles can slide along the surface of a circular obstacle without becoming trapped over long times. Using simulations and theory, we study the impact of boundary conditions on the diffusive…
We prove that for the Activated Random Walks model on transitive unimodular graphs, if there is fixation, then every particle eventually fixates, almost surely. We deduce that the critical density is at most 1. Our methods apply for much…
We derive an analytic expression for the distribution of velocities of multiple interacting active particles which we test by numerical simulations. In clear contrast with equilibrium we find that the velocities are coupled to positions.…
Position probability distribution of a set of massive mutually exclusive particles in one dimension has been defined. Examples with a given two mutually exclusive particles system are considered. It is emphasized that quantum particles at…
The cohesive collective motion (flocking, swarming) of autonomous agents is ubiquitously observed and exploited in both natural and man-made settings, thus, minimal models for its description are essential. In a model with continuous space…
We present continuum models that describe the evolution of the position of a random walker on a growing network using four different growth algorithms. Three of these involve a random element, including one in which the motility rate of the…
We study a class of dynamically constructed point processes in which at every step a new point (particle) is added to the current configuration with a distribution depending on the local structure around a uniformly chosen particle. This…
Obtaining general relations between macroscopic properties of random assemblies, such as density, and the microscopic properties of their constituent particles, such as shape, is a foundational challenge in the study of amorphous materials.…
An individual-based model of stochastic branching is proposed and studied, in which point particles drift in $\bar{\mathds{R}}_{+}:=[0,+\infty)$ towards the origin (edge) with unit speed, where each of them splits into two particles that…
We study a model for microscopic segregation in a homogeneous system of particles moving on a one-dimensional lattice. Particles tend to separate from each other, and evolution ceases when at least one empty site is found between any two…
We provide a numerical study of the macroscopic model of [3] derived from an agent-based model for a system of particles interacting through a dynamical network of links. Assuming that the network remodelling process is very fast, the…
An example of a discrete pregeometry on a microscopic scale is introduced. The model is a directed dyadic acyclic graph. This is the particular case of a causal set. The particles in this model must be self-organized repetitive structures.…