相关论文: When is a network epidemic hard to eliminate?

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…

We propose an efficient strategy to suppress epidemic explosion in heterogeneous metapopulation networks, wherein each node represents a subpopulation with any number of individuals and is assigned a curing rate that is proportional to…

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…

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…

Given a network of fixed size $n$ and an initial distribution of data, we derive sufficient connectivity conditions on a sequence of time-varying digraphs for (a) data collection and (b) data dissemination, within at most $(n-1)$…

We consider an SIR epidemic model propagating on a configuration model network, where the degree distribution of the vertices is given and where the edges are randomly matched. The evolution of the epidemic is summed up into three…

In this paper we conduct a simulation study of the spread of an epidemic like COVID-19 with temporary immunity on finite spatial and non-spatial network models. In particular, we assume that an epidemic spreads stochastically on a…

Most previous studies of epidemic dynamics on complex networks suppose that the disease will eventually stabilize at either a disease-free state or an endemic one. In reality, however, some epidemics always exhibit sporadic and recurrent…

Suppose that a cascade (e.g., an epidemic) spreads on an unknown graph, and only the infection times of vertices are observed. What can be learned about the graph from the infection times caused by multiple distinct cascades? Most of the…

We consider optimal attacks or immunization schemes on different models of random graphs. We derive bounds for the minimum number of nodes needed to be removed from a network such that all remaining components are fragments of negligible…

We study one specific version of the contact process on a graph. Here, we allow multiple infections carried by the nodes and include a probability of removing nodes in a graph. The removal probability is purely determined by the number of…

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…

Numerous approaches study the vulnerability of networks against social contagion. Graph burning studies how fast a contagion, modeled as a set of fires, spreads in a graph. The burning process takes place in synchronous, discrete rounds. In…

Current understanding of the critical outbreak condition on temporal networks relies on approximations (time scale separation, discretization) that may bias the results. We propose a theoretical framework to compute the epidemic threshold…

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…

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…

This paper studies the SI1SI2S spreading model of two competing behaviors over a bilayer network. We address the problem of determining resource allocation strategies which design a spreading network so as to ensure the extinction of a…

Advances in mathematical epidemiology have led to a better understanding of the risks posed by epidemic spreading and informed strategies to contain disease spread. However, a challenge that has been overlooked is that, as a disease becomes…

The spread of disease on complex networks has attracted widely attention in the physics community. Recent works have demonstrated that heterogeneous degree and weight distributions have a significant influence on the epidemic dynamics. In…

Optimal curing strategy of suppressing competing epidemics spreading over complex networks is a critical issue. In this paper, we first establish a framework to capture the coupling between two epidemics, and then analyze the system's…