The effect of network topology on the spread of epidemics

@article{Ganesh2005TheEO,
  title={The effect of network topology on the spread of epidemics},
  author={Ayalvadi J. Ganesh and Laurent Massouli{\'e} and Donald F. Towsley},
  journal={Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.},
  year={2005},
  volume={2},
  pages={1455-1466 vol. 2}
}
  • A. Ganesh, L. Massoulié, D. Towsley
  • Published 13 March 2005
  • Mathematics, Computer Science
  • Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
Many network phenomena are well modeled as spreads of epidemics through a network. Prominent examples include the spread of worms and email viruses, and, more generally, faults. Many types of information dissemination can also be modeled as spreads of epidemics. In this paper we address the question of what makes an epidemic either weak or potent. More precisely, we identify topological properties of the graph that determine the persistence of epidemics. In particular, we show that if the ratio… 
A model for infection on graphs
We address the question of understanding the effect of the underlying network topology on the spread of a virus and the dissemination of information when users are mobile performing independent
A random walk model for infection on graphs: spread of epidemics & rumours with mobile agents
TLDR
It is proved that for homogeneous graphs including regular graphs and the classical Erdős–Rényi model, the coincidence time is inversely proportional to the number of nodes in the graph.
EPIDEMIC SPREADING IN NETWORKS-VARIANCE OF THE NUMBER OF INFECTED NODES
Abstract. The Susceptible Infected Susceptible (SIS) model is one of the basic models and it is applied for different networks and services in telecommunications. For more detailed prediction of the
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.
Rejuvenation and the Spread of Epidemics in General Topologies
TLDR
This paper presents a model to study the effect of rejuvenation and of the topology on the steady-state number of infected and failed nodes and numerically illustrates the impact of different system parameters on the optimal sampling rate, indicating when rejuvenation is more beneficial.
A random walk model for infection on graphs
TLDR
It is proved that for homogeneous graph including regular graphs and the classical Erdos-Renyi model, the coincidence time is inversely proportional to the number of nodes in the graph.
Distinguishing Infections on Different Graph Topologies
TLDR
The core of this paper is to obtain an understanding of the diagnostic power of network information, and derive sufficient conditions that networks must satisfy for these problems to be identifiable, and produce efficient, highly scalable algorithms that solve these problems.
Spectral Methods for Immunization of Large Networks
TLDR
Using novel graph theoretic techniques, ideas from spectral graph theory are employed to define relevance and importance of nodes and an efficient approximation algorithm is designed to immunize the graph.
The Cost of Uncertainty in Curing Epidemics
  • Jessica Hoffmann, C. Caramanis
  • Computer Science
    Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems
  • 2018
TLDR
This paper focuses on epidemics propagating on a graph, and considers so-called SI models where an infected node can only propagate the infection to its non-infected neighbor, as opposed to the fully mixed models considered in the early literature.
Effect of coupling on the epidemic threshold in interconnected complex networks: A spectral analysis
TLDR
Using bifurcation theory and spectral graph theory, the epidemic threshold of one network is found as a function of the infection strength of the other coupled network and adjacency matrices of each graph and their interconnection, and a quantitative measure to distinguish weak and strong interconnection topology is provided.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 38 REFERENCES
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.
Epidemic spreading in scale-free networks.
TLDR
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.
Directed-graph epidemiological models of computer viruses
  • J. Kephart, S. R. White
  • Computer Science
    Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy
  • 1991
TLDR
It is concluded that an imperfect defense against computer viruses can still be highly effective in preventing their widespread proliferation, provided that the infection rate does not exceed a well-defined critical epidemic threshold.
The Average Distance in a Random Graph with Given Expected Degrees
TLDR
It is shown that for certain families of random graphs with given expected degrees, the average distance is almost surely of order log n/ logd̃ where d̃ is the weighted average of the sum of squares of the expected degrees.
The average distances in random graphs with given expected degrees
  • F. Chung, Linyuan Lu
  • Mathematics, Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2002
TLDR
It is shown that for certain families of random graphs with given expected degrees the average distance is almost surely of order log n/log d́, where d̃ is the weighted average of the sum of squares of the expected degrees.
Eigenvalues of Random Power law Graphs
Abstract. Many graphs arising in various information networks exhibit the "power law" behavior –the number of vertices of degree k is proportional to k-β for some positive β. We show that if β > 2.5,
Epidemic dynamics in finite size scale-free networks.
TLDR
The present paper shows that the highly heterogeneous nature of scale-free networks does not allow the use of homogeneous approximations even for systems of a relatively small number of nodes.
On power-law relationships of the Internet topology
TLDR
These power-laws hold for three snapshots of the Internet, between November 1997 and December 1998, despite a 45% growth of its size during that period, and can be used to generate and select realistic topologies for simulation purposes.
Network Resilience: Exploring Cascading Failures within BGP∗
TLDR
This paper develops simple models for the interaction of routers, looking specifically at the clique topology, and indicates that it is indeed possible to have cascading failures in systems such as a BGP clique.
...
1
2
3
4
...