Related papers: Exact and approximate results for deposition and a…
Consider a system of $K$ particles moving on the vertex set of a finite connected graph with at most one particle per vertex. If there is one, the particle at $x$ chooses one of the $\hbox{deg} (x)$ neighbors of its location uniformly at…
We consider a random sequential adsorption process on the one-dimensional lattice with nearest-neighbor exclusion. In this model, each site $s \in \mathbb{Z}$ starts empty and we will try to occupy it in time $t_s$, where…
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…
When gas molecules bind to a surface they may do so in such a way that the adsorption of one molecule inhibits the arrival of others. We consider random sequential adsorption in which the empty sites of a graph are irreversibly occupied in…
Place an $A$-particle at each site of a graph independently with probability $p$ and otherwise place a $B$-particle. $A$- and $B$-particles perform independent continuous time random walks at rates $\lambda_A$ and $\lambda_B$, respectively,…
We obtain expected number of arrivals, absorption probabilities and expected time until absorption for an asymmetric discrete random walk on a graph in the presence of multiple function barriers. On each edge of the graph and in each vertex…
This paper concerns discrete-time occupancy processes on a finite graph. Our results can be formulated in two theorems, which are stated for vertex processes, but also applied to edge process (e.g., dynamic random graphs). The first theorem…
We consider exploration algorithms of the random sequential adsorption type both for homogeneous random graphs and random geometric graphs based on spatial Poisson processes. At each step, a vertex of the graph becomes active and its…
We consider a variation of the supermarket model in which the servers can communicate with their neighbors and where the neighborhood relationships are described in terms of a suitable graph. Tasks with unit-exponential service time…
We consider the reversible adsorption of dimers on a regular lattice, where adsorption occurs on a finite fraction of sites selected randomly. By comparing this system to the pure system where all sites are available for adsorption, we show…
A discrete-time totally asymmetric simple exclusion process on a lattice with open boundaries is considered. There are particles of different types. The type of a particle is characterized by the probability that a particle moves to a…
In random sequential adsorption (RSA), objects are deposited on a substrate randomly, irreversibly, and sequentially. Attempts of deposition that lead to an overlap with previously deposited objects are discarded. The process continues…
In random sequential adsorption (RSA), objects are deposited randomly, irreversibly, and sequentially; attempts leading to an overlap with previously deposited objects are discarded. The process continues until the system reaches a jammed…
Consider a random graph process where vertices are chosen from the interval $[0,1]$, and edges are chosen independently at random, but so that, for a given vertex $x$, the probability that there is an edge to a vertex $y$ decreases as the…
We introduce the notion of a "random basic walk" on an infinite graph, give numerous examples, list potential applications, and provide detailed comparisons between the random basic walk and existing generalizations of simple random walks.…
The branching annihilating random walk is studied on a random graph whose sites have uniform number of neighbors (z). The Monte Carlo simulations in agreement with the generalized mean-field analysis indicate that the concentration decreses…
We develop a new method for constructing approximate decompositions of dense graphs into sparse graphs and apply it to longstanding decomposition problems. For instance, our results imply the following. Let $G$ be a quasi-random $n$-vertex…
We study diffusion-limited (on-site) pair annihilation $A+A\to 0$ and (on-site) fusion $A+A\to A$ which we show to be equivalent for arbitrary space-dependent diffusion and reaction rates. For one-dimensional lattices with nearest neighbour…
We deal with a random graph model where at each step, a vertex is chosen uniformly at random, and it is either duplicated or its edges are deleted. Duplication has a given probability. We analyse the limit distribution of the degree of a…
In random sequential covering, identical objects are deposited randomly, irreversibly, and sequentially; only attempts increasing the coverage are accepted. A finite system eventually gets congested, and we study the statistics of congested…