Related papers: The Stochastic Firefighter Problem
Spreading processes represent a very efficient tool to investigate the structural properties of networks and the relative importance of their constituents, and have been widely used to this aim in static networks. Here we consider simple…
In this paper, a stochastic dynamic control strategy is presented to prevent the spread of an infection over a homogeneous network. The infectious process is persistent, i.e., it continues to contaminate the network once it is established.…
Consider a random graph, having a pre-specified degree distribution F but other than that being uniformly distributed, describing the social structure (friendship) in a large community. Suppose one individual in the community is externally…
The problem of identifying important players in a given network is of pivotal importance for viral marketing, public health management, network security and various other fields of social network analysis. In this work we find the most…
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…
Graph burning is a model for the spread of social contagion. The burning number is a graph parameter associated with graph burning that measures the speed of the spread of contagion in a graph; the lower the burning number, the faster the…
The spread of infectious disease in a human community or the proliferation of fake news on social media can be modeled as a randomly growing tree-shaped graph. The history of the random growth process is often unobserved but contains…
Vaccination has played an important role in preventing the spread of infectious diseases. However, the limited availability of vaccines and personnel at the roll-out of a new vaccine and the costs of vaccination campaigns often limit how…
Unit disk graphs are the set of graphs which represent the intersection of disk graphs and interval graphs. These graphs are of great importance due to their structural similarity with wireless communication networks. Firefighter problem on…
Covid-19 has caused hundred of thousands of deaths and an economic damage amounting to trillions of dollars, creating a desire for the rapid development of vaccine. Once available, vaccine is gradually produced, evoking the question on how…
We develop a model of infection spread that takes into account the existence of a vulnerable group as well as the variability of the social relations of individuals. We develop a compartmentalized power-law model, with power-law connections…
We tackle a stochastic version of the Critical Node Problem (CNP) where the goal is to minimize the pairwise connectivity of a graph by attacking a subset of its nodes. In the stochastic setting considered, the attacks on nodes can fail…
This paper is concerned with the analysis of vaccination strategies in a stochastic SIR (susceptible $\to$ infected $\to$ removed) model for the spread of an epidemic amongst a population of individuals with a random network of social…
The graph burning problem is an NP-hard combinatorial optimization problem that helps quantify the vulnerability of a graph to contagion. This paper introduces a simple farthest-first traversal-based approximation algorithm for this problem…
In this work we analyze the evolution of voluntary vaccination in networked populations by entangling the spreading dynamics of an influenza-like disease with an evolutionary framework taking place at the end of each influenza season so…
Graph burning is a discrete-time process that models the spread of influence in a network. Vertices are either burning or unburned, and in each round, a burning vertex causes all of its neighbours to become burning before a new fire source…
We introduce and study a model stemming from game theory for the spread of an epidemic throughout a given population. Each agent is allowed to choose an action whose value dictates to what extent they limit their social interactions, if at…
The design of an efficient curing policy, able to stem an epidemic process at an affordable cost, has to account for the structure of the population contact network supporting the contagious process. Thus, we tackle the problem of…
A Reed-Frost epidemic with inhomogeneous infection probabilities on a graph with prescribed degree distribution is studied. Each edge $(u,v)$ in the graph is equipped with two weights $W_{(u,v)}$ and $W_{(v,u)}$ that represent the…
Our main goal is to examine the role of communities in epidemic spread in a random graph model. More precisely, we consider a random graph model which consists of overlapping complete graphs, representing households, workplaces, school…