相关论文: An efficient curing policy for epidemics on graphs
In this paper, we develop a node-based approximate model for Markovian contagion dynamics on networks. We prove that our approximate model is exact for SIR (susceptible-infectious-recovered) and SEIR…
This article considers the minimization of the total number of infected individuals over the course of an epidemic in which the rate of infectious contacts can be reduced by time-dependent nonpharmaceutical interventions. The societal and…
In this paper we consider a simple virus infection spread model on a finite population of $n$ agents connected by some neighborhood structure. Given a graph $G$ on $n$ vertices, we begin with some fixed number of initial infected vertices.…
This paper presents an optimal network topology control framework using cutting-plane methods for efficient network partitioning with controllable edges. The objective is to enable real-time reconfiguration of interconnected sub-networks…
In this paper, we study an adaptive spatial network. We consider an SIS (susceptible-infectedsusceptible) epidemic on the network, with a link/contact rewiring process constrained by spatial proximity. In particular, we assume that…
The spread of an infectious disease depends on intrinsic properties of the disease as well as the connectivity and actions of the population. This study investigates the dynamics of an SIR type model which accounts for human tendency to…
We study the Susceptible-Infectious-Susceptible (SIS) model on arbitrary networks. The well-established pair approximation treats neighboring pairs of nodes exactly while making a mean field approximation for the rest of the network. We…
In this work, we aim to understand the influence of the heterogeneity of infection rates on the Susceptible-Infected-Susceptible (SIS) epidemic spreading. Employing the classic SIS model as the benchmark, we study the influence of the…
Consider an SI process on a graph $G$ where each S--I connection becomes I--I at rate $\lambda$. Here S and I stand for ``susceptible'' and ``infected'' respectively. The evoSI model is a modification of the SI model in which S--I edges are…
We propose a fully dynamic algorithm for maintaining reachability information in directed graphs. The proposed deterministic dynamic algorithm has an update time of $O((ins*n^{2}) + (del * (m+n*log(n))))$ where $m$ is the current number of…
Effective resistances are ubiquitous in graph algorithms and network analysis. In this work, we study sublinear time algorithms to approximate the effective resistance of an adjacent pair $s$ and $t$. We consider the classical adjacency…
In this paper we study the susceptible-infectious (SI) epidemiological model using dynamical graphs. Dynamical structures have been recently applied in many areas including complex systems. Dynamical structures include the mutual…
A significant proportion of the infections driving the current {SARS-CoV-2} pandemic are transmitted asymptomatically. Here we introduce and study a simple epidemic model with separate compartments comprising asymptomatic and symptomatic…
Epidemic propagation on complex networks has been widely investigated, mostly with invariant parameters. However, the process of epidemic propagation is not always constant. Epidemics can be affected by various perturbations, and may bounce…
This paper studies the distribution function of the time of extinction of a subcritical epidemic, when a large enough proportion of the population has been immunized and/or the infectivity of the infectious individuals has been reduced, so…
During a pandemic, there are conflicting demands arising from public health and economic cost. Lockdowns are a common way of containing infections, but they adversely affect the economy. We study the question of how to minimise the economic…
The metapopulation network model is effectively used to study the spatial spread of epidemics with individuals mobility. Considering the time-varying nature of individual activity and the preferences for attractive destinations in…
We investigate the effects of modular and temporal connectivity patterns on epidemic spreading. To this end, we introduce and analytically characterise a model of time-varying networks with tunable modularity. Within this framework, we…
We give an algorithm for augmenting the edge connectivity of an undirected graph by using the isolating cuts framework (Li and Panigrahi, FOCS '20). Our algorithm uses poly-logarithmic calls to any max-flow algorithm, which yields a running…
We study the optimal control problem of maximizing the spread of an information epidemic on a social network. Information propagation is modeled as a Susceptible-Infected (SI) process and the campaign budget is fixed. Direct recruitment and…