Related papers: Dispersion processes
We consider a version of continuum long-range percolation on finite boxes of $\mathbb{R}^d$ in which the vertex set is given by the points of a Poisson point process and each pair of two vertices at distance $r$ is connected with…
We consider a class of multi-agent distributed synchronization systems, which are modeled as $n$ particles moving on the real line. This class generalizes the model of a multi-server queueing system, considered in [15], employing so-called…
We study information aggregation in networks when agents interact to learn a binary state of the world. Initially each agent privately observes an independent signal which is "correct" with probability $\frac{1}{2}+\delta$ for some $\delta…
The three-dimensional transport pathways, the time scales of vertical transport, and the dispersion characteristics of submesoscale currents at an upper-ocean front are investigated using material points (tracer particles) that advect with…
We study the percolation properties of graph partitioning on random regular graphs with N vertices of degree $k$. Optimal graph partitioning is directly related to optimal attack and immunization of complex networks. We find that for any…
We consider a three dimensional system consisting of a large number of small spherical particles, distributed in a range of sizes and heights (with uniform distribution in the horizontal direction). Particles move vertically at a…
We study the graph-theoretic properties of the trace of random walks on pseudorandom graphs. We show that for any $\varepsilon>0$, there exists a constant $C$ such that the cover time of an $(n,d,\lambda)$-graph $G$ with $d/\lambda\ge C$ is…
Consider that there are $k\le n$ agents in a simple, connected, and undirected graph $G=(V,E)$ with $n$ nodes and $m$ edges. The goal of the dispersion problem is to move these $k$ agents to mutually distinct nodes. Agents can communicate…
Given a random 3-uniform hypergraph $H=H(n,p)$ on $n$ vertices where each triple independently appears with probability $p$, consider the following graph process. We start with the star $G_0$ on the same vertex set, containing all the edges…
Dynamic space filling (DSF) is a stochastic process defined on any connected graph. Each vertex can host an arbitrary number of particles forming a pile, with every arriving particle landing on the top of the pile. Particles in a pile,…
The dispersion problem has received much attention recently in the distributed computing literature. In this problem, $k\leq n$ agents placed initially arbitrarily on the nodes of an $n$-node, $m$-edge anonymous graph of maximum degree…
We introduce a model of epidemics among moving particles on any locally finite graph. At any time, each vertex is empty, occupied by a healthy particle, or occupied by an infected particle. Infected particles recover at rate $1$ and…
One model of real-life spreading processes is First Passage Percolation (also called SI model) on random graphs. Social interactions often follow bursty patterns, which are usually modelled with i.i.d.~heavy-tailed passage times on edges.…
Order the vertices of a directed random graph \math{v_1,...,v_n}; edge \math{(v_i,v_j)} for \math{i<j} exists independently with probability \math{p}. This random graph model is related to certain spreading processes on networks. We…
We introduce a particle model, that we call the $\textit{golf model}$. Initially, on a graph $G$, balls and holes are placed at random on some distinct vertices. The balls then move one by one, doing a random walk on $G$, starting from…
We consider the fractal Sierpi\'{n}ski gasket or carpet graph in dimension $d\geq 2,$ denoted by $G$. At time $0$, we place a Poisson point process of particles onto the graph and let them perform independent simple random walks, which in…
We introduce and study a novel semi-random multigraph process, described as follows. The process starts with an empty graph on $n$ vertices. In every round of the process, one vertex $v$ of the graph is picked uniformly at random and…
Long DNA molecules can be mapped by cutting them with restriction enzymes inside a narrow channel. Once cut, the individual fragments thus produced move away from each other due to diffusion and entropic effects. We investigate how long it…
In the present note we analyze the one-dimensional multi-particle diffusion limited aggregation (MDLA) model: the initial number of particles at each positive integer site has Poisson distribution with mean $\mu$, independently of all other…
We study the transport properties of a system of active particles moving at constant speed in an heterogeneous two-dimensional space. The spatial heterogeneity is modeled by a random distribution of obstacles, which the active particles…