相关论文: An efficient curing policy for epidemics on graphs
We study networks of human decision-makers who independently decide how to protect themselves against Susceptible-Infected-Susceptible (SIS) epidemics. Motivated by studies in behavioral economics showing that humans perceive probabilities…
We study the Susceptible-Infected-Recovered (SIR) and the Susceptible-Exposed-Infected-Recovered (SEIR) models of epidemics, with possibly time-varying rates, on a class of networks that are locally tree-like, which includes sparse…
We consider an SIR-type (Susceptible $\to$ Infected $\to$ Recovered) stochastic epidemic process with multiple modes of transmission on a contact network. The network is given by a random graph following a multilayer configuration model…
We investigate the SIR epidemic on a dynamic inhomogeneous Erd\H{o}s-R\'enyi random graph, in which vertices are of one of $k$ types and in which edges appear and disappear independently of each other. We establish a functional law of large…
We consider the problem of finding the graph on which an epidemic cascade spreads, given only the times when each node gets infected. While this is a problem of importance in several contexts -- offline and online social networks,…
We propose an efficient strategy to suppress epidemic explosion in heterogeneous metapopulation networks, wherein each node represents a subpopulation with any number of individuals and is assigned a curing rate that is proportional to…
When effective medical treatment and vaccination are not available, non-pharmaceutical interventions such as social distancing, home quarantine and far-reaching shutdown of public life are the only available strategies to prevent the spread…
We introduce a fast simulation technique for modeling epidemics on adaptive networks. Our rejection-based algorithm efficiently simulates the co-evolution of the network structure and the epidemic dynamics. We extend the classical SIS model…
We study a variant of the classical Markovian logistic SIS epidemic model on a complete graph, which has the additional feature that healthy individuals can become infected without contacting an infected member of the population. This…
In real social networks, person-to-person interactions are known to be heterogeneous, which can affect the way a disease spreads through a population, reaches a tipping point in the fraction of infected individuals, and becomes an epidemic.…
We investigate the sensitivity of epidemic behavior to a bounded susceptibility constraint -- susceptible nodes are infected by their neighbors via the regular SI/SIS dynamics, but subject to a cap on the infection rate. Such a constraint…
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…
This paper considers the classical Susceptible--Infected--Susceptible (SIS) network epidemic model, which describes a disease spreading through $n$ nodes, with the network links governing the possible transmission pathways of the disease…
The decay rate of SIS epidemics on the complete graph $K_{N}$ is computed analytically, based on a new, algebraic method to compute the second largest eigenvalue of a stochastic three-diagonal matrix up to arbitrary precision. The latter…
We model an epidemic where the per-person infectiousness in a network of geographic localities changes with the total number of active cases. This would happen as people adopt more stringent non-pharmaceutical precautions when the…
We consider evoSIR, a variant of the SIR model, on Erd\H os-Renyi random graphs in which susceptibles with an infected neighbor break that connection at rate $\rho$ and rewire to a randomly chosen individual. We compute the critical…
We analyze an optimal control version of a simple SIRS epidemiology model. The policy maker can adopt policies to diminish the contact rate between infected and susceptible individuals, at a specific economic cost. The arrival of a vaccine…
In this paper, a susceptible-infected-susceptible (SIS) model with identical infectivity, where each node is assigned with the same capability of active contacts, $A$, at each time step, is presented. We found that on scale-free networks,…
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…
We consider the contact process on finite and connected graphs and study the behavior of the extinction time, that is, the amount of time that it takes for the infection to disappear in the process started from full occupancy. We prove,…