Related papers: Border aggregation model
We introduce perhaps the simplest models of graph evolution with choice that demonstrate discontinuous percolation transitions and can be analyzed via mathematical evolution equations. These models are local, in the sense that at each step…
We consider a spatially homogeneous advection-diffusion equation in which the diffusion tensor and drift velocity are time-independent, but otherwise general. We derive asymptotic expressions, valid at large distances from a steady point…
In this paper we focus on the problem of the degree sequence for the following random graph process. At any time-step $t$, one of the following three substeps is executed: with probability $\alpha_1$, a new vertex $x_t$ and $m$ edges…
The process by which one may take a discrete model of a biophysical process and construct a continuous model based on it is of mathematical interest as well as being of practical use. In this paper, we first study the singular limit of a…
We consider a gas of independent Brownian particles on a bounded interval in contact with two particle reservoirs at the endpoints. Due to the Brownian nature of the particles, infinitely many particles enter and leave the system in each…
In this paper we consider three classes of interacting particle systems on $\mathbb Z$: independent random walks, the exclusion process, and the inclusion process. We allow particles to switch their jump rate (the rate identifies the type…
Consider a graph on randomly scattered points in an arbitrary space, with two points $x,y$ connected with probability $\phi(x,y)$. Suppose the number of points is large but the mean number of isolated points is $O(1)$. We give general…
We consider a totally asymmetric exclusion process on the positive half-line. When particles enter in the system according to a Poisson source, Liggett has computed all the limit distributions when the initial distribution has an asymptotic…
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…
We study the problem of edge partitioning, where the goal is to partition the edge set of a graph into several parts. The replication factor of a vertex $v$ is the number of parts that contain edges incident to $v$. The goal is to minimize…
The emergence of collective dynamics in neural networks is a mechanism of the animal and human brain for information processing. In this paper, we develop a computational technique using distributed processing elements in a complex network,…
We consider the doubly infinite Sierpinski gasket graph $SG_0$, rescale it by factor $2^{-n}$, and on the rescaled graphs $SG_n=2^{-n}SG_0$, for every $n\in \mathbb{N}$, we investigate the limit shape of three aggregation models with…
A graph generative model defines a distribution over graphs. One type of generative model is constructed by autoregressive neural networks, which sequentially add nodes and edges to generate a graph. However, the likelihood of a graph under…
The emerging theory of graph limits exhibits an analytic perspective on graphs, showing that many important concepts and tools in graph theory and its applications can be described more naturally (and sometimes proved more easily) in…
We present a graph model for a background independent, relational approach to spacetime emergence. The general idea and the graph main features, detailed in [1], are discussed. This is a combinatorial (dynamical) metric graph, colored on…
We investigate a moving boundary problem for a Brownian particle on the semi-infinite line in which the boundary moves by a distance proportional to the time between successive collisions of the particle and the boundary. Phenomenologically…
The Abelian Sandpile Model is a discrete diffusion process defined on graphs (Dhar [10], Dhar et al. [11]) which serves as the standard model of self-organized criticality. The transience class of a sandpile is defined as the maximum number…
We model the transmission of a message on the complete graph with n vertices and limited resources. The vertices of the graph represent servers that may broadcast the message at random. Each server has a random emission capital that…
Limiting distributions are derived for the sparse connected components that are present when a random graph on $n$ vertices has approximately $\half n$ edges. In particular, we show that such a graph consists entirely of trees, unicyclic…
We consider a $N$-particle interacting particle system with the vision geometrical constraints and reflected noises, proposed as a model for collective behavior of individuals. We rigorously derive a continuity-type of mean-field equation…