Related papers: On an epidemic model on finite graphs
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
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…
We study the information spreading yielded by the \emph{(Parsimonious) $1$-Flooding Protocol} in geometric Mobile Ad-Hoc Networks. We consider $n$ agents on a convex plane region of diameter $D$ performing independent random walks with move…
We propose a compartmental model for vector-transmitted diseases, such as Malaria and Dengue, spreading over complex networks. Individuals are represented by independent random walkers and vectors by infected nodes. Both walkers and nodes…
We show that a certain model for the spread of an infection has a phase transition in the recuperation rate. The model is as follows: There are particles or individuals of type A and type B, interpreted as healthy and infected,…
We study the contact process on a dynamic random~$d$-regular graph with an edge-switching mechanism, as well as an interacting particle system that arises from the local description of this process, called the herds process. Both these…
We study one specific version of the contact process on a graph. Here, we allow multiple infections carried by the nodes and include a probability of removing nodes in a graph. The removal probability is purely determined by the number of…
It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs $\hat C$. This yields a larger family of graphs than the graphs obtained by discretising continuous self-similar fractals. For a…
We present analytical results for the distribution of first-passage (FP) times of random walks (RWs) on random regular graphs that consist of $N$ nodes of degree $c \ge 3$. Starting from a random initial node at time $t=0$, at each time…
In this paper, we propose and analyze a reaction-diffusion susceptible-infected-susceptible (SIS) epidemic patch model. The individuals are assumed to reside in different patches, where they are able to move inside and among the patches.…
A bootstrap percolation process on a graph G is an "infection" process which evolves in rounds. Initially, there is a subset of infected nodes and in each subsequent round every uninfected node which has at least r infected neighbours…
We consider a synchronous process of particles moving on the vertices of a graph $G$, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles are placed on a vertex of $G$. In subsequent time steps, all…
We study the diffusion of epidemics on networks that are partitioned into local communities. The gross structure of hierarchical networks of this kind can be described by a quotient graph. The rationale of this approach is that individuals…
Contacts between individuals serve as pathways where infections may propagate. These contact patterns can be represented by network structures. Static structures have been the common modeling paradigm but recent results suggest that…
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…
We investigate an interacting particle system inspired by the gypsy moth, whose populations grow until they become sufficiently dense so that an epidemic reduces them to a low level. We consider this process on a random 3-regular graph and…
An algorithm observes the trajectories of random walks over an unknown graph $G$, starting from the same vertex $x$, as well as the degrees along the trajectories. For all finite connected graphs, one can estimate the number of edges $m$ up…
Activated Random Walks, on $\mathbb{Z}^d$ for any $d\geqslant 1$, is an interacting particle system, where particles can be in either of two states: active or frozen. Each active particle performs a continuous-time simple random walk during…
We investigate a fermionic susceptible-infected-susceptible model with mobility of infected individuals on uncorrelated scale-free networks with power-law degree distributions $P (k) \sim k^{-\gamma}$ of exponents $2<\gamma<3$. Two…
This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…