Algorithms Using Local Graph Features to Predict Epidemics

10/18/2021
by   Yeganeh Alimohammadi, et al.
0

We study a simple model of epidemics where an infected node transmits the infection to its neighbors independently with probability p. This is also known as the independent cascade or Susceptible-Infected-Recovered (SIR) model with fixed recovery time. The size of an outbreak in this model is closely related to that of the giant connected component in “edge percolation”, where each edge of the graph is kept independently with probability p, studied for a large class of networks including configuration model <cit.> and preferential attachment <cit.>. Even though these models capture the effects of degree inhomogeneity and the role of super-spreaders in the spread of an epidemic, they only consider graphs that are locally tree like i.e. have a few or no short cycles. Some generalizations of the configuration model were suggested to capture local communities, known as household models <cit.>, or hierarchical configuration model <cit.>. Here, we ask a different question: what information is needed for general networks to predict the size of an outbreak? Is it possible to make predictions by accessing the distribution of small subgraphs (or motifs)? We answer the question in the affirmative for large-set expanders with local weak limits (also known as Benjamini-Schramm limits). In particular, we show that there is an algorithm which gives a (1-ϵ) approximation of the probability and the final size of an outbreak by accessing a constant-size neighborhood of a constant number of nodes chosen uniformly at random. We also present corollaries of the theorem for the preferential attachment model, and study generalizations with household (or motif) structure. The latter was only known for the configuration model.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/27/2017

Random Overlapping Communities: Approximating Motif Densities of Large Graphs

A wide variety of complex networks (social, biological, information etc....
research
04/12/2023

Locality via Global Ties: Stability of the 2-Core Against Misspecification

For many random graph models, the analysis of a related birth process su...
research
02/07/2021

Asynchronous semi-anonymous dynamics over large-scale networks

We analyze a class of stochastic processes, referred to as asynchronous ...
research
06/15/2023

On the Giant Component of Geometric Inhomogeneous Random Graphs

In this paper we study the threshold model of geometric inhomogeneous ra...
research
05/18/2022

Bond Percolation in Small-World Graphs with Power-Law Distribution

Full-bond percolation with parameter p is the process in which, given a ...
research
02/08/2012

Finding the Graph of Epidemic Cascades

We consider the problem of finding the graph on which an epidemic cascad...
research
09/09/2019

Cascade Size Distributions and Why They Matter

How likely is it that a few initial node activations are amplified to pr...

Please sign up or login with your details

Forgot password? Click here to reset