Related papers: The contact process over a dynamical d-regular gra…
We study the edge-averaging process on a finite, connected graph $G = (V, E)$. Initially, the vertices in $V$ are endowed with i.i.d.\ real-valued opinions $(f_0(v))_{v \in V}$. Edges are activated according to i.i.d.\ Poisson clocks of…
In this paper, we derive a precise estimate for the mean extinction time of the contact process with a fixed infection rate on a star graph with $N$ leaves. Specifically, we determine not only the exponential main factor but also the exact…
We consider the propagation of a contagion process (epidemic) on a network and study the problem of dynamically allocating a fixed curing budget to the nodes of the graph, at each time instant. For bounded degree graphs, we provide a lower…
We study the SIR epidemic model with infections carried by $k$ particles making independent random walks on a random regular graph. Here we assume $k\leq n^{\epsilon}$, where $n$ is the number of vertices in the random graph, and $\epsilon$…
Let $d,n\in \mathbb{N}$ be such that $d=\omega(1)$, and $d\le n^{1-a}$ for some constant $a>0$. Consider a $d$-regular graph $G=(V, E)$ and the random graph process that starts with the empty graph $G(0)$ and at each step $G(i)$ is obtained…
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in an undirected graph, subject to edge insertions and deletions.…
We analyze the Susceptible-Infected-Recovered-Susceptible (SIRS) process, a continuous-time Markov chain frequently employed in epidemiology to model the spread of infections on networks. In this framework, infections spread as infected…
Understanding what types of phenomena lead to discontinuous phase transitions in the connectivity of random networks is an outstanding challenge. Here we show that a simple stochastic model of graph evolution leads to a discontinuous…
The contact process and the slightly different susceptible-infected-susceptible model are studied on long-range connected networks in the presence of random transition rates by means of a strong disorder renormalization group method and…
In this note we establish a resilience version of the classical hitting time result of Bollob\'{a}s and Thomason regarding connectivity. A graph $G$ is said to be $\alpha$-resilient with respect to a monotone increasing graph property…
Designing distributed and scalable algorithms to improve network connectivity is a central topic in peer-to-peer networks. In this paper we focus on the following well-known problem: given an $n$-node $d$-regular network for $d=\Omega(\log…
The contact process with an asymptomatic state, introduced in [Belhadji, Lanchier and Mercer, Stochastic Process. Appl., 176:104417, 2024], is a natural variant of the basic contact process that distinguishes between asymptomatic (state 1)…
We study the connectivity of random subgraphs of the $d$-dimensional Hamming graph $H(d, n)$, which is the Cartesian product of $d$ complete graphs on $n$ vertices. We sample the random subgraph with an i.i.d.\ Bernoulli bond percolation on…
Given an infinite connected regular graph $G=(V,E)$, place at each vertex Pois($\lambda$) walkers performing independent lazy simple random walks on $G$ simultaneously. When two walkers visit the same vertex at the same time they are…
The spread of viruses in biological networks, computer networks, and human contact networks can have devastating effects; developing and analyzing mathematical models of these systems can be insightful and lead to societal benefits. Prior…
We consider the contact process on a countable-infinite and connected graph of bounded degree. For this process started from the upper invariant measure, we prove certain uniform mixing properties under the assumption that the infection…
We study continuous time Markov processes on graphs. The notion of frequency is introduced, which serves well as a scaling factor between any Markov time of a continuous time Markov process and that of its jump chain. As an application, we…
Drug resistance and strong contacts actually play crucial roles in epidemic spread in complex systems. Nevertheless, neither theoretical model or methodology is proposed to address this. We thus consider an edge-based epidemic spread model…
Real networks are often dynamic. In response to it, analyses of algorithms on {\em dynamic networks} attract more and more attentions in network science and engineering. Random walks on dynamic graphs also have been investigated actively in…
Network epidemiology's most important assumption is that the contact structure over which infectious diseases propagate can be represented as a static network. However, contacts are highly dynamic, changing at many time scales. In this…