Competing activation mechanisms in epidemics on networks

@article{Castellano2012CompetingAM,
  title={Competing activation mechanisms in epidemics on networks},
  author={Claudio Castellano and Romualdo Pastor-Satorras},
  journal={Scientific Reports},
  year={2012},
  volume={2}
}
In contrast to previous common wisdom that epidemic activity in heterogeneous networks is dominated by the hubs with the largest number of connections, recent research has pointed out the role that the innermost, dense core of the network plays in sustaining epidemic processes. Here we show that the mechanism responsible of spreading depends on the nature of the process. Epidemics with a transient state are boosted by the innermost core. Contrarily, epidemics allowing a steady state present a… 

Impact of temporal connectivity patterns on epidemic process

It is observed that the presence of highly active nodes enables to trigger the initial spread of epidemic in a short period of time, but it also limits its final spread to the entire network, which implies that there is the trade-off between the spreading time of epidemic and its outbreak size.

Influential spreaders for recurrent epidemics on networks

This work applies the theoretical framework for avalanches on networks proposed by Larremore et al. to the Susceptible-Infected-Susceptible spreading model, and obtains detailed quantitative predictions for the spreading influence of individual nodes both above and below the epidemic threshold.

Epidemic processes in complex networks

A coherent and comprehensive review of the vast research activity concerning epidemic processes is presented, detailing the successful theoretical approaches as well as making their limits and assumptions clear.

Epidemic spreading and aging in temporal networks with memory

This paper derives analytical predictions for the epidemic threshold as a function of the parameters describing the distribution of activities and the strength of the memory effects and shows that memory reduces the threshold, which is the same for SIS and SIR dynamics, therefore favoring epidemic spreading.

Relevance of temporal cores for epidemic spread in temporal networks

The results show that the most stable and cohesive temporal cores play indeed an important role in epidemic processes on temporal networks, and that their nodes are likely to include influential spreaders.

Activation thresholds in epidemic spreading with motile infectious agents on scale-free networks.

A fermionic susceptible-infected-susceptible model with the mobility of infected individuals on uncorrelated scale-free networks with power-law degree distributions is investigated, indicating different activation mechanisms of the epidemic phases that are rationalized in terms of hubs or max k -core subgraphs.

Sufficient conditions of endemic threshold on metapopulation networks.

...

References

SHOWING 1-10 OF 43 REFERENCES

Thresholds for epidemic spreading in networks

It is conjecture that on quenched scale-rich networks the threshold of generic epidemic models is vanishing or finite depending on the presence or absence of a steady state.

The small world yields the most effective information spreading

This paper proposes a model to emphasize the essential difference between information spreading and epidemic spreading, where the memory effects, the social reinforcement and the non-redundancy of contacts are taken into account and shows that the spreading effectiveness can be sharply enhanced by introducing a little randomness into the regular structure, namely the small-world networks yield the most effective information spreading.

Spread of epidemic disease on networks.

  • M. Newman
  • Mathematics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2002
This paper shows that a large class of standard epidemiological models, the so-called susceptible/infective/removed (SIR) models can be solved exactly on a wide variety of networks.

The effect of network topology on the spread of epidemics

  • A. GaneshL. MassouliéD. Towsley
  • Mathematics, Computer Science
    Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
  • 2005
This paper identifies topological properties of the graph that determine the persistence of epidemics and shows that if the ratio of cure to infection rates is larger than the spectral radius of thegraph, then the mean epidemic lifetime is of order log n, where n is the number of nodes.

Evolution of networks

The recent rapid progress in the statistical physics of evolving networks is reviewed, and how growing networks self-organize into scale-free structures is discussed, and the role of the mechanism of preferential linking is investigated.

Immunization of complex networks.

It is shown that the random uniform immunization of individuals does not lead to the eradication of infections in all complex networks, and networks with scale-free properties do not acquire global immunity from major epidemic outbreaks even in the presence of unrealistically high densities of randomly immunized individuals.

Epidemic spreading in scale-free networks.

A dynamical model for the spreading of infections on scale-free networks is defined, finding the absence of an epidemic threshold and its associated critical behavior and this new epidemiological framework rationalizes data of computer viruses and could help in the understanding of other spreading phenomena on communication and social networks.

Epidemic spreading in real networks: an eigenvalue viewpoint

A general epidemic threshold condition that applies to arbitrary graphs is proposed and it is proved that, under reasonable approximations, the epidemic threshold for a network is closely related to the largest eigenvalue of its adjacency matrix.

Networks and epidemic models

A variety of methods are described that allow the mixing network, or an approximation to the network, to be ascertained and how the two fields of network theory and epidemiological modelling can deliver an improved understanding of disease dynamics and better public health through effective disease control are suggested.

Discrete-time Markov chain approach to contact-based disease spreading in complex networks

Many epidemic processes in networks spread by stochastic contacts among their connected vertices. There are two limiting cases widely analyzed in the physics literature, the so-called contact process