Epidemics in networks: a master equation approach

  title={Epidemics in networks: a master equation approach},
  author={Mosh{\'e} Cotacallapa and M. O. Hase},
  journal={Journal of Physics A},
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 is able to propagate a disease/information. The relaxation timescale of this random variable is examined in both annealed and quenched limits, and the effectiveness of propagation of disease/information is analyzed. The dynamics of the model is governed by a… Expand
3 Citations

Figures from this paper

Weakening connections in heterogeneous mean-field models
Two versions of the susceptible-infected-susceptible epidemic model, which have different transmission rules, are analysed. Both models are considered on a weighted network to simulate a mitigationExpand
How the individuals' risk aversion affect the epidemic spreading
Considering the individual’s ability to avoid risks in the epidemic season, the proposed epidemic spreading model with individuals’ sensitivity is proposed and the probability of the latent individuals transforming into explosive individuals has a greater impact on the spread of infectious diseases. Expand
Knowledge discovery through chemical space networks: the case of organic electronics
This work generates and visualize a chemical space networks (CSN) of possible crystalline organic semiconductors based on an in-house database of > 64,000 molecular crystals that was extracted from the exhaustive Cambridge Structural Database and for which prominent charge-mobility descriptors were computed. Expand


Epidemic dynamics and endemic states in complex networks.
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
Infection dynamics on scale-free networks.
  • R. May, A. Lloyd
  • Computer Science, Medicine
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2001
Approximate expressions for the final size of an epidemic in an infinite closed population and for the dependence of infection probability on an individual's degree of connectivity within the population are derived. Expand
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. Expand
Absence of epidemic threshold in scale-free networks with degree correlations.
This work provides for the susceptible-infected-susceptible model an exact result showing that a scale-free degree distribution with diverging second moment is a sufficient condition to have null epidemic threshold in unstructured networks with either assortative or disassortative mixing. Expand
Network robustness and fragility: percolation on random graphs.
This paper studies percolation on graphs with completely general degree distribution, giving exact solutions for a variety of cases, including site percolators, bond percolations, and models in which occupation probabilities depend on vertex degree. Expand
Emergence of scaling in random networks
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
Resilience of the internet to random breakdowns
This work shows analytically and numerically that for alpha</=3 the transition never takes place, unless the network is finite, and finds that the physical structure of the Internet is impressively robust, with p(c)>0.99. Expand
Evolution of the social network of scientific collaborations
The results indicate that the co-authorship network of scientists is scale-free, and that the network evolution is governed by preferential attachment, affecting both internal and external links, and a simple model is proposed that captures the network's time evolution. Expand
Critical phenomena in complex networks
A wide range of critical phenomena in equilibrium and growing networks including the birth of the giant connected component, percolation, $k$-core percolations, phenomena near epidemic thresholds, condensation transitions,critical phenomena in spin models placed on networks, synchronization, and self-organized criticality effects in interacting systems on networks are mentioned. Expand
Breakdown of the internet under intentional attack.
It is argued that, near criticality, the average distance between sites in the spanning (largest) cluster scales with its mass, M, as square root of [M], rather than as log (k)M, as expected for random networks away from criticality. Expand