6,481 research outputs found
Containing epidemic outbreaks by message-passing techniques
The problem of targeted network immunization can be defined as the one of
finding a subset of nodes in a network to immunize or vaccinate in order to
minimize a tradeoff between the cost of vaccination and the final (stationary)
expected infection under a given epidemic model. Although computing the
expected infection is a hard computational problem, simple and efficient
mean-field approximations have been put forward in the literature in recent
years. The optimization problem can be recast into a constrained one in which
the constraints enforce local mean-field equations describing the average
stationary state of the epidemic process. For a wide class of epidemic models,
including the susceptible-infected-removed and the
susceptible-infected-susceptible models, we define a message-passing approach
to network immunization that allows us to study the statistical properties of
epidemic outbreaks in the presence of immunized nodes as well as to find
(nearly) optimal immunization sets for a given choice of parameters and costs.
The algorithm scales linearly with the size of the graph and it can be made
efficient even on large networks. We compare its performance with topologically
based heuristics, greedy methods, and simulated annealing
Optimal Vaccine Allocation to Control Epidemic Outbreaks in Arbitrary Networks
We consider the problem of controlling the propagation of an epidemic
outbreak in an arbitrary contact network by distributing vaccination resources
throughout the network. We analyze a networked version of the
Susceptible-Infected-Susceptible (SIS) epidemic model when individuals in the
network present different levels of susceptibility to the epidemic. In this
context, controlling the spread of an epidemic outbreak can be written as a
spectral condition involving the eigenvalues of a matrix that depends on the
network structure and the parameters of the model. We study the problem of
finding the optimal distribution of vaccines throughout the network to control
the spread of an epidemic outbreak. We propose a convex framework to find
cost-optimal distribution of vaccination resources when different levels of
vaccination are allowed. We also propose a greedy approach with quality
guarantees for the case of all-or-nothing vaccination. We illustrate our
approaches with numerical simulations in a real social network
A Convex Framework for Optimal Investment on Disease Awareness in Social Networks
We consider the problem of controlling the propagation of an epidemic
outbreak in an arbitrary network of contacts by investing on disease awareness
throughout the network. We model the effect of agent awareness on the dynamics
of an epidemic using the SAIS epidemic model, an extension of the SIS epidemic
model that includes a state of "awareness". This model allows to derive a
condition to control the spread of an epidemic outbreak in terms of the
eigenvalues of a matrix that depends on the network structure and the
parameters of the model. We study the problem of finding the cost-optimal
investment on disease awareness throughout the network when the cost function
presents some realistic properties. We propose a convex framework to find
cost-optimal allocation of resources. We validate our results with numerical
simulations in a real online social network.Comment: IEEE GlobalSIP Symposium on Network Theor
- …