Transient Dynamics of Epidemic Spreading and Its Mitigation on Large Networks

@article{Lee2019TransientDO,
  title={Transient Dynamics of Epidemic Spreading and Its Mitigation on Large Networks},
  author={Chul-Ho Lee and Srinivasarao Tenneti and Do Young Eun},
  journal={Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing},
  year={2019}
}
In this paper, we aim to understand the transient dynamics of a susceptible-infected (SI) epidemic spreading process on a large network. The SI model has been largely overlooked in the literature, while it is naturally a better fit for modeling the malware propagation in early times when patches/vaccines are not available, or over a wider range of timescales when massive patching is practically infeasible. Nonetheless, its analysis is simply non-trivial, as its important dynamics are all… 

Figures from this paper

Prophylaxis of Epidemic Spreading with Transient Dynamics
TLDR
The results show that individual behaviours can be extremely inefficient in the face of epidemic propagation but that policy can take advantage of the network structure to design efficient containment policies.
Social interactions and the prophylaxis of SI epidemics on networks☆
Dynamics impose limits to detectability of network structure
TLDR
This paper argues that the dynamical activity of the nodes may strongly reshape their relevance inside the network, making centrality measures in many cases, misleading, and proposes a generalisation of the communicability function.
Universal transient behavior in large dynamical systems on networks
TLDR
Analytical results reveal that unidirectional systems exhibit a high degree of universality in the sense that the average squared norm only depends on a single parameter encoding the average interaction strength between the individual constituents.
Risk-Dependent Centrality in Economic and Financial Networks
TLDR
It is found that a high position in the ranking of the analyzed financial companies according to their risk-dependent centrality corresponds to companies more sensitive to the external market variations during the periods of crisis.
Quantifying Nonrandomness in Evolving Networks
  • P. Pandey, M. Singh
  • Computer Science
    IEEE Transactions on Computational Social Systems
  • 2020
TLDR
This article empirically showcase severe limitations associated with the state-of-the-art graph spectral-based quantification approaches and introduces a novel graph signature (termed “cumulative spectral difference”) to visualize the nonrandomness in the network.
From networked SIS model to the Gompertz function
Communicability in the World Trade Network - A new perspective for community detection
TLDR
A new perspective is provided in which clusters of strongly interacting countries are identified by means of a specific distance criterion, referring to the Estrada communicability distance and the vibrational communicable distance, which turn out to be particularly suitable for catching the inner structure of the economic network.
The many facets of the Estrada indices of graphs and networks
  • E. Estrada
  • Mathematics, Computer Science
    SeMA Journal
  • 2021
TLDR
This article formalizes many of the Estrada indices proposed and studied in the mathematical literature serving as a guide for their further studies and analyses many of them computationally for small graphs as well as large complex networks.
...
1
2
...

References

SHOWING 1-10 OF 102 REFERENCES
Analysis of Exact and Approximated Epidemic Models over Complex Networks
TLDR
This work provides a complete global analysis of the epidemic dynamics of the nonlinear mean-field approximation of the Markov chain model and shows that depending on the largest eigenvalue of the underlying graph adjacency matrix and the rates of infection, recovery, and vaccination, the global dynamics takes on one of two forms.
On the dynamics of deterministic epidemic propagation over networks
Thresholds for virus spread on networks
TLDR
This work characterise how the size of the population that eventually becomes infected depends on the network topology, and shows that if the ratio of cure to infection rates is larger than the spectral radius of the graph, and the initial infected population is small, then the finalinfected population is also small in a sense that can be made precise.
Epidemic thresholds in real networks
TLDR
A general epidemic threshold condition is proposed for the NLDS system: it is proved that the epidemic threshold for a network is exactly the inverse of the largest eigenvalue of its adjacency matrix, and it is shown that below the epidemic thresholds, infections die out at an exponential rate.
The effect of network topology on the spread of epidemics
  • A. Ganesh, L. Massoulié, D. Towsley
  • Mathematics, Computer Science
    Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
  • 2005
TLDR
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.
Epidemic dynamics and endemic states in complex networks.
TLDR
A dynamical model for the spreading of epidemics in complex networks that implies that scale-free networks are prone to the spreading and the persistence of infections whatever spreading rate the epidemic agents might possess.
Optimal vaccine allocation to control epidemic outbreaks in arbitrary networks
TLDR
A convex framework to find cost-optimal distribution of vaccination resources when different levels of vaccination are allowed is proposed to find the optimal distribution of vaccines throughout the network to control the spread of an epidemic outbreak.
Analysis and Control of Epidemics: A Survey of Spreading Processes on Complex Networks
TLDR
Various solved and open problems in the development, analysis, and control of epidemic models are reviewed and presented.
Epidemic spreading in real networks: an eigenvalue viewpoint
TLDR
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.
Threshold Conditions for Arbitrary Cascade Models on Arbitrary Networks
TLDR
The G2-threshold (twice generalized) theorem is shown, which nicely de-couples the effect of the topology and the virus model and has broad implications for the vulnerability of real, complex networks, and numerous applications, including viral marketing, blog dynamics, influence propagation, easy answers to 'what-if' questions, and simplified design and evaluation of immunization policies.
...
1
2
3
4
5
...