Related papers: Border aggregation model

Joint degree vectors give the number of edges between vertices of degree $i$ and degree $j$ for $1\le i\le j\le n-1$ in an $n$-vertex graph. We find lower and upper bounds for the maximum number of nonzero elements in a joint degree vector…

Oliveira conjectured that the order of the mixing time of the exclusion process with $k$-particles on an arbitrary $n$-vertex graph is at most that of the mixing-time of $k$ independent particles. We verify this up to a constant factor for…

The paper addresses the single-file diffusion in the presence of an absorbing boundary. The emphasis is on an interplay between the hard-core interparticle interaction and the absorption process. The resulting dynamics exhibits several…

Given a Poisson process on a bounded interval, its random geometric graph is the graph whose vertices are the points of the Poisson process and edges exist between two points if and only if their distance is less than a fixed given…

Consider the following asynchronous, opportunistic communication model over a graph $G$: in each round, one edge is activated uniformly and independently at random and (only) its two endpoints can exchange messages and perform local…

We propose a modification to the random destruction of graphs: Given a finite network with a distinguished set of sources and targets, remove (cut) vertices at random, discarding components that do not contain a source node. We investigate…

A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…

We propose a stationary system that might be regarded as a migration model of some population abandoning their original place of abode and becoming part of another population, once they reach the interface boundary. To do so, we show a…

We introduce a technique called graph fission which takes in a graph which potentially contains only one observation per node (whose distribution lies in a known class) and produces two (or more) independent graphs with the same node/edge…

Let $\Pi_q$ be an arbitrary finite projective plane of order $q$. A subset $S$ of its points is called saturating if any point outside $S$ is collinear with a pair of points from $S$. Applying probabilistic tools we improve the upper bound…

We introduce a process where a connected rooted multigraph evolves by splitting events on its vertices, occurring randomly in continuous time. When a vertex splits, its incoming edges are randomly assigned between its offspring and a…

In this paper, we study pattern formations in an aggregation and diffusion cell migration model with Dirichlet boundary condition. The formal continuum limit of the model is a nonlinear parabolic equation with a diffusivity which can become…

We construct a matrix model equivalent (exactly, not asymptotically), to the random plane partition model, with almost arbitrary boundary conditions. Equivalently, it is also a random matrix model for a TASEP-like process with arbitrary…

We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…

We study interacting particle systems on the real line which generalize the Hammersley process [D. Aldous and P. Diaconis, Prob. Theory Relat. Fields 103, 199-213 (1995)]. Particles jump to the right to a randomly chosen point between their…

We propose a new model that describes the dynamics of epidemic spreading on connected graphs. Our model consists in a PDE-ODE system where at each vertex of the graph we have a standard SIR model and connexions between vertices are given by…

We propose a bond-percolation model intended to describe the consumption, and eventual exhaustion, of resources in transport networks. Edges forming minimum-length paths connecting demanded origin-destination nodes are removed if below a…

We consider a conditionally Poissonian random graph model where the mean degrees, `capacities', follow a power-tailed distribution with finite mean and infinite variance. Such a graph of size $N$ has a giant component which is super-small…

In the context of PDE-constrained optimization theory, source identification problems traditionally entail particles emerging from an unknown source distribution inside a domain, moving according to a prescribed stochastic process,…

Complex systems, ranging from soft materials to wireless communication, are often organised as random geometric networks in which nodes and edges evenly fill up the volume of some space. Studying such networks is difficult because they…