Related papers: Border aggregation model
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…
The diffusion of a particle in a crowded environment typically proceeds through three regimes: for very short times the particle diffuses freely until it collides with an obstacle for the first time, while for very long times diffusion the…
This paper reviews (and expands) some recent results on the modeling of aggregation-diffusion phenomena at various scales, focusing on the emergence of collective dynamics as a result of the competition between attractive and repulsive…
Inertial particles advected in chaotic flows often accumulate in strange attractors. While moving in these fractal sets they usually approach each other and collide. Here we consider inertial particles aggregating upon collision. The new…
We investigate the dynamic formation of regular random graphs. In our model, we pick a pair of nodes at random and connect them with a link if both of their degrees are smaller than d. Starting with a set of isolated nodes, we repeat this…
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…
We consider a model system of persistent random walkers that can jam, pass through each other or jump apart (recoil) on contact. In a continuum limit, where particle motion between stochastic changes in direction becomes deterministic, we…
We present a simple stochastic quadrant model for calculating the transport and de- position of heavy particles in a fully developed turbulent boundary layer based on the statistics of wall-normal fluid velocity fluctuations obtained from a…
This paper presents a statistical model for stationary ergodic point processes, estimated from a single realization observed in a square window. With existing approaches in stochastic geometry, it is very difficult to model processes with…
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 present new algorithm for growth of non-clustered planar graphs by aggregation of cells with given distribution of size and constraint of connectivity k=3 per node. The emergent graph structures are controlled by two parameters--chemical…
A topological graph is a graph drawn in the plane. A topological graph is $k$-plane, $k>0$, if each edge is crossed at most $k$ times. We study the problem of partitioning the edges of a $k$-plane graph such that each partite set forms a…
Consider a massive (inert) particle impinged from above by N Brownian particles that are instantaneously reflected upon collision with the inert particle. The velocity of the inert particle increases due to the influence of an external…
We study the mean-field limit of the Atlas model and its connection to SDEs with dependence on the distribution of hitting and local times. The Atlas model describes a system of Brownian particles on the real line, where only the lowest…
We consider the asymmetric simple exclusion process in $d\ge 3$ with open boundaries. The particle reservoirs of constant densities are modeled by birth and death processes at the boundary. We prove that, if the initial density and the…
The aim of this paper is to discuss the appropriate modelling of in- and outflow boundary conditions for nonlinear drift-diffusion models for the transport of particles including size exclusion and their effect on the behaviour of…
Let P_{n,d,D} denote the graph taken uniformly at random from the set of all labelled planar graphs on {1,2,...,n} with minimum degree at least d(n) and maximum degree at most D(n). We use counting arguments to investigate the probability…
Many load balancing problems that arise in scientific computing applications ask to partition a graph with weights on the vertices and costs on the edges into a given number of almost equally-weighted parts such that the maximum boundary…
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…
We introduce a set of iterative equations that exactly solves the size distribution of components on small arbitrary graphs after the random removal of edges. We also demonstrate how these equations can be used to predict the distribution…