Epidemic spreading in scale-free networks.

@article{PastorSatorras2001EpidemicSI,
  title={Epidemic spreading in scale-free networks.},
  author={Romualdo Pastor-Satorras and Alessandro Vespignani},
  journal={Physical review letters},
  year={2001},
  volume={86 14},
  pages={
          3200-3
        }
}
The Internet has a very complex connectivity recently modeled by the class of scale-free networks. This feature, which appears to be very efficient for a communications network, favors at the same time the spreading of computer viruses. We analyze real data from computer virus infections and find the average lifetime and persistence of viral strains on the Internet. We define a dynamical model for the spreading of infections on scale-free networks, finding the absence of an epidemic threshold… Expand

Figures and Topics from this paper

Paper Mentions

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. Expand
Epidemics of computer viruses: A complex-network approach
TLDR
It is found that (1) a higher network heterogeneity is conducive to the diffusion of computer viruses, and (2) a scale-free network with lower power-law exponent benefits virus spreading. Expand
Epidemic spreading in lattice-embedded scale-free networks
TLDR
The more geographically constrained the network is, the more smoothly the epidemic spreads, which is different from the clearly hierarchical dynamics that the infection pervades the networks in a progressive cascade across smaller-degree classes in Barabasi–Albert scale-free networks. Expand
Epidemic Spread in Weighted Scale-Free Networks
We investigate the detailed epidemic spreading process in scale-free networks with link weights that denote familiarity between two individuals. It is found that the spreading velocity reaches a peakExpand
Effects of maximum node degree on computer virus spreading in scale-free networks
The increase of the use of the Internet networks favors the spread of viruses. In this paper, we studied the spread of viruses in the scale-free network with different topologies based on theExpand
On the spread of viruses on the internet
TLDR
The contact process on random graphs generated according to the preferential attachment scheme as a model for the spread of viruses in the Internet is analyzed and an interesting dichotomy is discovered: for a virus with effective spread rate λ, if the infection starts at a typical vertex, then it develops into an epidemic with probability λΘ(log(1/λ)/log log( 1/λ), but on average the epidemic probability is λ Θ(1). Expand
Velocity and hierarchical spread of epidemic outbreaks in scale-free networks.
TLDR
This work studies the effect of the connectivity pattern of complex networks on the propagation dynamics of epidemics, indicating that epidemics spread almost instantaneously in networks with scale-free degree distributions. Expand
Epidemic spreading on an alternate network
TLDR
An alternate network is presented, changing between scale free network and one-to-one random network, to simulate the topology structure between day and night, and it is found that spreading velocity is smaller on the alternate network than on Scale free network. Expand
Epidemic spreading in correlated complex networks.
TLDR
A dynamical model of epidemic spreading on complex networks in which there are explicit correlations among the node's connectivities finds an epidemic threshold inversely proportional to the largest eigenvalue of the connectivity matrix that gives the average number of links. Expand
Epidemie spreading in partial dynamic networks
TLDR
The analysis and simulations reveal that a larger fraction of dynamic connections may lead a larger epidemic size, while the influence of the cluster coefficient to the epidemic spreading on the partial dynamic network finds that higher clustering may lead to a smaller epidemic size. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 67 REFERENCES
Epidemics and percolation in small-world networks.
  • C. Moore, M. Newman
  • Mathematics, Medicine
  • Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
  • 2000
TLDR
The resulting models display epidemic behavior when the infection or transmission probability rises above the threshold for site or bond percolation on the network, and are given exact solutions for the position of this threshold in a variety of cases. Expand
Mean-field theory for scale-free random networks
TLDR
A mean-field method is developed to predict the growth dynamics of the individual vertices of the scale-free model, and this is used to calculate analytically the connectivity distribution and the scaling exponents. Expand
Emergence of scaling in random networks
TLDR
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems. Expand
The fractal properties of Internet
In this paper we show that the Internet web, from a user's perspective, manifests robust scaling properties of the type P(n) n−τ, where n is the size of the basin connected to a given point, PExpand
Computers and epidemiology
TLDR
The findings of computer virus epidemiology show that computer viruses are far less rife than many have claimed, that many fail to thrive, that even successful viruses spread at nowhere near the exponential rate, and that centralized reporting and response within an organization is an extremely effective defense. Expand
Collective dynamics of ‘small-world’ networks
TLDR
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs. Expand
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. Expand
Internet: Diameter of the World-Wide Web
TLDR
The World-Wide Web becomes a large directed graph whose vertices are documents and whose edges are links that point from one document to another, which determines the web's connectivity and consequently how effectively the authors can locate information on it. Expand
Branching annihilating random walk on random regular graphs
  • Szabó
  • Physics, Mathematics
  • Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
  • 2000
TLDR
The branching annihilating random walk is studied on a random graph whose sites have a uniform number of neighbors and it is shown that the concentration decreases linearly with the branching rate for z>/=4, while the coefficient of the linear term becomes zero if z=3. Expand
On the properties of small-world network models
Abstract:We study the small-world networks recently introduced by Watts and Strogatz [Nature 393, 440 (1998)], using analytical as well as numerical tools. We characterize the geometrical propertiesExpand
...
1
2
3
4
5
...