Related papers: Controlling Epidemic Spread using Probabilistic Di…
Many real networks exhibit a layered structure in which links in each layer reflect the function of nodes on different environments. These multiple types of links are usually represented by a multiplex network in which each layer has a…
The main aim to build models capable of simulating the spreading of infectious diseases is to control them. And along this way, the key to find the optimal strategy for disease control is to obtain a large number of simulations of disease…
Social connections are conduits through which individuals communicate, information propagates, and diseases spread. Identifying individuals who are more likely to adopt ideas and spread them is essential in order to develop effective…
We study the min-cost seed selection problem in online social networks, where the goal is to select a set of seed nodes with the minimum total cost such that the expected number of influenced nodes in the network exceeds a predefined…
Detection of patient-zero can give new insights to the epidemiologists about the nature of first transmissions into a population. In this paper, we study the statistical inference problem of detecting the source of epidemics from a snapshot…
We use the susceptible-infected-recovered (SIR) model for disease spread over a network, and empirically study how well various centrality measures perform at identifying which nodes in a network will be the best spreaders of disease on 10…
We study how international flights can facilitate the spread of an epidemic to a worldwide scale. We combine an infrastructure network of flight connections with a population density dataset to derive the mobility network, and then we…
We consider the problem of maximizing the spread of influence in a social network by choosing a fixed number of initial seeds, formally referred to as the influence maximization problem. It admits a $(1-1/e)$-factor approximation algorithm…
We present a distributed resource allocation strategy to control an epidemic outbreak in a networked population based on a Distributed Alternating Direction Method of Multipliers (D-ADMM) algorithm. We consider a linearized Susceptible-…
The problem of finding the optimal set of source nodes in a diffusion network that maximizes the spread of information, influence, and diseases in a limited amount of time depends dramatically on the underlying temporal dynamics of the…
In recent years, the exploration of node centrality has received significant attention and extensive investigation, primarily fuelled by its applications in diverse domains such as product recommendations, opinion propagation, disease…
In many cases, tainted information in a computer network can spread in a way similar to an epidemics in the human world. On the other had, information processing paths are often redundant, so a single infection occurrence can be easily…
We study proliferation of an action in binary action network coordination games that are generalized to include global effects. This captures important aspects of proliferation of a particular action or narrative in online social networks,…
In the present work the spread of epidemic is studied over complex networks which are characterized by power law degree distribution of links and heterogeneous rate of disease transmission. The random allocation of epidemic transmission…
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…
We focus on an epidemiological model (the archetypical SIR system) defined on graphs and study the asymptotic behavior of the solutions as the number of vertices in the graph diverges. By relying on the theory of so called graphons we…
Consider stochastic models for the spread of an infection in a structured community, where this structured community is itself described by a random network model. Some common network models and transmission models are defined and large…
We consider the problem of controlling a partially-observed dynamic process on a graph by a limited number of interventions. This problem naturally arises in contexts such as scheduling virus tests to curb an epidemic; targeted marketing in…
In this work, we formulate and study a data dissemination problem, which can be viewed as a generalization of the index coding problem and of the data exchange problem to networks with an arbitrary topology. We define $r$-solvable networks,…
Network immunization is an automated task in the field of network analysis that involves protecting a network (modeled as a graph) from being infected by an undesired arbitrary diffusion. In this article, we consider the spread of harmful…