相关论文: An efficient curing policy for epidemics on graphs
Given a network of nodes, minimizing the spread of a contagion using a limited budget is a well-studied problem with applications in network security, viral marketing, social networks, and public health. In real graphs, virus may infect a…
The Susceptible-Infected-Susceptible (SIS) model is a widely used model for the spread of information and infectious diseases, particularly non-immunizing ones, on a graph. Given a highly contagious disease, a natural question is how to…
We propose a new model that describes the dynamics of epidemic spreading on connected graphs. Our model consists in a PDE-ODE system where at each vertex of the graph we have a standard SIR model and connexions between vertices are given by…
Despite extensive work on the interplay between traffic dynamics and epidemic spreading, the control of epidemic spreading by routing strategies has not received adequate attention. In this paper, we study the impact of efficient routing…
This paper considers the problem of designing non-pharmaceutical intervention (NPI) strategies, such as masking and social distancing, to slow the spread of a viral epidemic. We formulate the problem of jointly minimizing the infection…
In this paper, we study the trajectory of a classic SIR epidemic on a family of dynamic random graphs of fixed size, whose set of edges continuously evolves over time. We set general infection and recovery times, and start the epidemic from…
Motivated by applications in network epidemiology, we consider the problem of determining whether it is possible to delete at most $k$ edges from a given input graph (of small treewidth) so that the resulting graph avoids a set…
Recently we presented the first algorithm for maintaining the set of nodes reachable from a source node in a directed graph that is modified by edge deletions with $o(mn)$ total update time, where $m$ is the number of edges and $n$ is the…
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…
In this paper, we are concerned with the stochastic susceptible-infectious-susceptible (SIS) epidemic model on the complete graph with $n$ vertices. This model has two parameters, which are the infection rate and the recovery rate. By…
Epidemic models are increasingly used in real-world networks to understand diffusion phenomena (such as the spread of diseases, emotions, innovations, failures) or the transport of information (such as news, memes in social on-line…
We define and study an open stochastic SIR (Susceptible -- Infected -- Removed) model on a graph in order to describe the spread of an epidemic on a cattle trade network with epidemiological and demographic dynamics occurring over the same…
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…
For a susceptible-infectious-susceptible (SIS) infection model in a heterogeneous population, we present simple formulae giving the leading-order asymptotic (large population) behaviour of the mean persistence time, from an endemic state to…
This note gives an exponential tail approximation for the extinction time of a subcritical multitype branching process arising from the SIR epidemic model on a random graph with given degrees, where the type corresponds to the vertex…
In this paper, we investigate game-theoretic strategies for containing spreading processes on large-scale networks. Specifically, we consider the class of networked susceptible-infected-susceptible (SIS) epidemics where a large population…
In this paper we study the diffusion of an SIS-type epidemics on a network under the presence of a random environment, that enters in the definition of the infection rates of the nodes. Accordingly, we model the infection rates in the form…
We study the stability properties of a susceptible-infected-susceptible (SIS) diffusion model, so-called the $n$-intertwined Markov model, over arbitrary directed network topologies. As in the majority of the work on infection spread…
We study the curing of epidemics of a network contagion, which is modelled using a variation of the classical Polya urn process that takes into account spatial infection among neighbouring nodes. We introduce several quantities for…
Epidemic spreading can be suppressed by the introduction of containment measures such as social distancing and lock downs. Yet, when such measures are relaxed, new epidemic waves and infection cycles may occur. Here we explore this issue in…