相关论文: Optimal bound for survival time of the SIRS proces…
We study the SIRS process, a continuous-time Markov chain modeling the spread of infections on graphs. In this model, vertices are either susceptible, infected, or recovered. Each infected vertex becomes recovered at rate 1 and infects each…
The SIRS process is a continuous-time process for how infections spread on a graph. In this model, each vertex is in one of the following three states: susceptible (to the infection; S), infected (I), or recovered (R) and thus immune to the…
We investigate the expected time to extinction in the susceptible-infectious-susceptible (SIS) model of disease spreading. Rather than using stochastic simulations, or asymptotic calculations in network models, we solve the extinction time…
We study a generalization of the classical contact process (SIS epidemic model) in a directed graph $G$. Our model is a continuous-time interacting particle system in which at every time, each vertex is either healthy or infected, and each…
Stochastic infection processes are continuous-time Markov chains on graphs that assign each vertex one of multiple states, such as susceptible, infected, or recovered. Depending on the model, vertices change their state based on random…
We consider Susceptible-Infected-Recovered (SIR) models on dense dynamic random graphs, in which the joint dynamics of vertices and edges are co-evolutionary, i.e., they influence each other bidirectionally. In particular, edges appear and…
We study the phase transition from the persistence phase to the extinction phase for the SIRS (susceptible/ infected/ refractory/ susceptible) model of diseases spreading on the networks. We derive an analytical expression of the…
Infections diseases are marked by recovering time distributions which can be far from the exponential one associated with Markovian/Poisson processes, broadly applied in epidemic compartmental models. In the present work, we tackled this…
We study the contact process on random graphs with low infection rate $\lambda$. For random $d$-regular graphs, it is known that the survival time is $O(\log n)$ below the critical $\lambda_c$. By contrast, on the Erd\H{o}s-R\'enyi random…
The contact process, or SIS epidemic, is a continuous-time Markov process used to model the spread of infection on a graph. Each vertex is either healthy or infected, and each infected vertex independently infects each of its healthy…
Becker, Greaves-Tunnell, Kontorovich, Miller, Ravikumar, and Shen determined the long term evolution of virus propagation behavior on a hub-and-spoke graph of one central node and $n$ neighbors, with edges only from the neighbors to the hub…
We study the susceptible-infected-recovered (SIR) epidemic on a random graph chosen uniformly over all graphs with certain critical, heavy-tailed degree distributions. For this model, each vertex infects all its susceptible neighbors and…
We study how long the SIRS process persists or how quickly it reaches extinction across various network topologies. Our results provide a three-part characterization of this process: In finite sparse graphs, we prove the existence of a…
We study the spread of discrete-time epidemics over arbitrary networks for well-known propagation models, namely SIS (susceptible-infected-susceptible), SIR (susceptible-infected-recovered), SIRS (susceptible-infected-recovered-susceptible)…
We study a discrete Susceptible-Infected-Recovered (SIR) model for the spread of infectious disease on a homogeneous tree and the limit behavior of the model in the case when the tree vertex degree tends to infinity. We obtain the…
It is a longstanding debate on the absence of threshold for susceptible-infected-susceptible (SIS) model on networks with finite second order moment of degree distribution. The eigenvector localization of the adjacency matrix for a network…
In this work, we study the evolution of the susceptible individuals during the spread of an epidemic modeled by the susceptible-infected-recovered (SIR) process spreading on the top of complex networks. Using an edge-based compartmental…
We study the susceptible-infective-recovered (SIR) epidemic on a random graph chosen uniformly subject to having given vertex degrees. In this model infective vertices infect each of their susceptible neighbours, and recover, at a constant…
In the Susceptible-Infectious-Recovered (SIR) model of disease spreading, the time to extinction of the epidemics happens at an intermediate value of the per-contact transmission probability. Too contagious infections burn out fast in the…
In the standard SIR model, infected vertices infect their neighbors at rate $\lambda$ independently across each edge. They also recover at rate $\gamma$. In this work we consider the SIR-$\omega$ model where the graph structure itself…