相关论文: An efficient curing policy for epidemics on graphs
The dynamics of the spread of contagions such as viruses, infectious diseases or even rumors/opinions over contact networks (graphs) have effectively been captured by the well known \textit{Susceptible-Infected-Susceptible} ($SIS$) epidemic…
In the context of the recent COVID-19 outbreak, quarantine has been used to "flatten the curve" and slow the spread of the disease. In this paper, we show that this is not the only benefit of quarantine for the mitigation of an SIR epidemic…
We study a simple model of epidemics where an infected node transmits the infection to its neighbors independently with probability $p$. This is also known as the independent cascade or Susceptible-Infected-Recovered (SIR) model with fixed…
We propose a targeted intervention protocol where recovery is restricted to individuals that have the least number of infected neighbours. Our recovery strategy is highly efficient on any kind of network, since epidemic outbreaks are…
We consider a multi-population epidemic model with one or more (almost) isolated communities and one mobile community. Each of the isolated communities has contact within itself and, in addition, contact with the outside world but only…
Spreading processes on graphs are a natural model for a wide variety of real-world phenomena, including information spread over social networks and biological diseases spreading over contact networks. Often, the networks over which these…
Optimal curing strategy of suppressing competing epidemics spreading over complex networks is a critical issue. In this paper, we first establish a framework to capture the coupling between two epidemics, and then analyze the system's…
We study that the breakdown of epidemic depends on some parameters, that is expressed in epidemic reproduction ratio number. It is noted that when $R_0 $ exceeds 1, the stochastic model have two different results. But, eventually the…
Epidemic spreading is well understood when a disease propagates around a contact graph. In a stochastic susceptible-infected-susceptible setting, spectral conditions characterise whether the disease vanishes. However, modelling human…
We investigate the containment of epidemic spreading in networks from a normative point of view. We consider a susceptible/infected model in which agents can invest in order to reduce the contagiousness of network links. In this setting, we…
We study epidemic spreading processes in large networks, when the spread is assisted by a small number of external agents: infection sources with bounded spreading power, but whose movement is unrestricted vis-\`a-vis the underlying network…
In networked spreading models, each node can infect its neighbors and cure spontaneously. The curing is assumed to occur uniformly over time. A pulse immunization/curing strategy is more efficient and broadly applied to suppressing…
In this paper we present a model describing Susceptible-Infected-Susceptible (SIS) type epidemics spreading on a dynamic contact network with random link activation and deletion where link ac- tivation can be locally constrained. We use and…
Using the continuous-time susceptible-infected-susceptible (SIS) model on networks, we investigate the problem of inferring the class of the underlying network when epidemic data is only available at population-level (i.e. the number of…
In this paper we consider a model for the spread of a stochastic SIR (Susceptible $\to$ Infectious $\to$ Recovered) epidemic on a network of individuals described by a random intersection graph. Individuals belong to a random number of…
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 the mixing time of a Susceptible--Infected--Susceptible (SIS) model on graphs with external sources of infection, which we refer to as the noisy SIS model. Under suitable assumptions on the parameters of the dynamics, we show that…
We study spreading processes in temporal graphs, i. e., graphs whose connections change over time. These processes naturally model real-world phenomena such as infectious diseases or information flows. More precisely, we investigate how…
We consider the spread of a supercritical stochastic SIR (Susceptible, Infectious, Recovered) epidemic on a configuration model random graph. We mainly focus on the final stages of a large outbreak and provide limit results for the duration…
The evolution of network structure and the spreading of epidemic are common coexistent dynamical processes. In most cases, network structure is treated either static or time-varying, supposing the whole network is observed in a same time…