相关论文: A note on general epidemic region for infinite reg…

The contagion threshold for diffusion of innovations is defined and calculated in finite graphs (two-dimensional regular lattices, regular random networks (RRNs), and two kinds of scale-free networks (SFNs)) with and without the bilingual…

We consider the propagation of a contagion process (epidemic) on a network and study the problem of dynamically allocating a fixed curing budget to the nodes of the graph, at each time instant. For bounded degree graphs, we provide a lower…

We analyze a game-theoretic abstraction of epidemic containment played on an undirected graph $G$: each player is associated with a node in $G$ and can either acquire protection from a contagious process or risk infection. After decisions…

A random graph model with prescribed degree distribution and degree dependent edge weights is introduced. Each vertex is independently equipped with a random number of half-edges and each half-edge is assigned an integer valued weight…

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…

We study the epidemic source detection problem in contact tracing networks modeled as a graph-constrained maximum likelihood estimation problem using the susceptible-infected model in epidemiology. Based on a snapshot observation of the…

A more connected world has brought major consequences such as facilitate the spread of diseases all over the world to quickly become epidemics, reason why researchers are concentrated in modeling the propagation of epidemics and outbreaks…

Research in epidemiology often focusses on designing interventions that result in the number of infected individuals asymptotically approaching zero, without considering that this number may peak at high values during transients. Recent…

Epidemic spreading is well understood when a disease propagates around a contact graph. In a stochastic susceptible-infected-susceptible setting, spectral conditions characterise whether the disease vanishes. However, modelling human…

When an epidemic spreads into a population, it is often unpractical or impossible to have a continuous monitoring of all subjects involved. As an alternative, algorithmic solutions can be used to infer the state of the whole population from…

Given a network of nodes, minimizing the spread of a contagion using a limited budget is a well-studied problem with applications in network security, viral marketing, social networks, and public health. In real graphs, virus may infect a…

Many real world networks are characterized by adaptive changes in their topology depending on the dynamic state of their nodes. Here we study epidemic dynamics in an adaptive network, where susceptibles are able to avoid contact with…

In this paper we quantify the total economic impact of an epidemic over a complex network using tools from random matrix theory. Incorporating the direct and indirect costs of infection, we calculate the disease cost in the large graph…

We introduce a new percolation model to describe and analyze the spread of an epidemic on a general directed and locally finite graph. We assign a two-dimensional random weight vector to each vertex of the graph in such a way that the…

We study the problem of parameter estimation based on infection data from an epidemic outbreak on a graph. We assume that successive infections occur via contagion; i.e., transmissions can only spread across existing directed edges in the…

A problem closely related to epidemiology, where a subgraph of 'infected' links is defined inside a larger network, is investigated. This subgraph is generated from the underlying network by a random variable, which decides whether a link…

In the real world, many complex systems interact with other systems. In addition, the intra- or inter-systems for the spread of information about infectious diseases and the transmission of infectious diseases are often not random, but with…

Motivated by problems modeling the spread of infections in networks, in this paper we explore which bipartite graphs are most resilient to widespread infections under various parameter settings. Namely, we study bipartite networks with a…

Multigraphs are graphs in which multiple links between pairs of nodes are allowed, whereas they are forbidden in simple graphs, the latter being widely used in network science. Simple graphs generated by the configuration model have served…

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…