Finding the Graph of Epidemic Cascades

02/08/2012
by   Praneeth Netrapalli, et al.
0

We consider the problem of finding the graph on which an epidemic cascade spreads, given only the times when each node gets infected. While this is a problem of importance in several contexts -- offline and online social networks, e-commerce, epidemiology, vulnerabilities in infrastructure networks -- there has been very little work, analytical or empirical, on finding the graph. Clearly, it is impossible to do so from just one cascade; our interest is in learning the graph from a small number of cascades. For the classic and popular "independent cascade" SIR epidemics, we analytically establish the number of cascades required by both the global maximum-likelihood (ML) estimator, and a natural greedy algorithm. Both results are based on a key observation: the global graph learning problem decouples into n local problems -- one for each node. For a node of degree d, we show that its neighborhood can be reliably found once it has been infected O(d^2 n) times (for ML on general graphs) or O(d n) times (for greedy on trees). We also provide a corresponding information-theoretic lower bound of Ω(d n); thus our bounds are essentially tight. Furthermore, if we are given side-information in the form of a super-graph of the actual graph (as is often the case), then the number of cascade samples required -- in all cases -- becomes independent of the network size n. Finally, we show that for a very general SIR epidemic cascade model, the Markov graph of infection times is obtained via the moralization of the network graph.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/06/2019

Learning Graphs from Noisy Epidemic Cascades

We consider the problem of learning the weighted edges of a graph by obs...
research
05/24/2022

Inference of a Rumor's Source in the Independent Cascade Model

We consider the so-called Independent Cascade Model for rumor spreading ...
research
05/21/2015

Inferring Graphs from Cascades: A Sparse Recovery Framework

In the Network Inference problem, one seeks to recover the edges of an u...
research
04/24/2023

Inoculation strategies for bounded degree graphs

We analyze a game-theoretic abstraction of epidemic containment played o...
research
08/19/2023

Explicit Time Embedding Based Cascade Attention Network for Information Popularity Prediction

Predicting information cascade popularity is a fundamental problem in so...
research
06/07/2019

Approximate Identification of the Optimal Epidemic Source in Complex Networks

We consider the problem of identifying the source of an epidemic, spread...
research
10/18/2021

Algorithms Using Local Graph Features to Predict Epidemics

We study a simple model of epidemics where an infected node transmits th...

Please sign up or login with your details

Forgot password? Click here to reset