Reconstructing Parameters of Spreading Models from Partial Observations

Spreading processes are often modelled as a stochastic dynamics occurring on top of a given network with edge weights corresponding to the transmission probabilities. Knowledge of veracious transmission probabilities is essential for prediction, optimization, and control of diffusion dynamics. Unfortunately, in most cases the transmission rates are unknown and need to be reconstructed from the spreading data. Moreover, in realistic settings it is impossible to monitor the state of each node at every time, and thus the data is highly incomplete. We introduce an efficient dynamic message-passing algorithm, which is able to reconstruct parameters of the spreading model given only partial information on the activation times of nodes in the network. The method is generalizable to a large class of dynamic models, as well to the case of temporal graphs.

[1]  Jure Leskovec,et al.  On the Convexity of Latent Social Network Inference , 2010, NIPS.

[2]  Le Song,et al.  Estimating Diffusion Network Structures: Recovery Conditions, Sample Complexity & Soft-thresholding Algorithm , 2014, ICML.

[3]  Vincent Gripon,et al.  Reconstructing a graph from path traces , 2013, 2013 IEEE International Symposium on Information Theory.

[4]  David Saad,et al.  Optimal deployment of resources for maximizing impact in spreading processes , 2016, Proceedings of the National Academy of Sciences.

[5]  Alessandro Panconesi,et al.  Trace complexity of network inference , 2013, KDD.

[6]  Brian Karrer,et al.  Message passing approach for general epidemic models. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[8]  Hongyuan Zha,et al.  Back to the Past: Source Identification in Diffusion Networks from Partially Observed Cascades , 2015, AISTATS.

[9]  Bernhard Schölkopf,et al.  Uncovering the Temporal Dynamics of Diffusion Networks , 2011, ICML.

[10]  Shilpa Chakravartula,et al.  Complex Networks: Structure and Dynamics , 2014 .

[11]  Lenka Zdeborová,et al.  Dynamic message-passing equations for models with unidirectional dynamics , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Michael Kearns,et al.  Learning from Contagion (Without Timestamps) , 2014, ICML.

[13]  Benjamin A Carreras,et al.  Complex systems analysis of series of blackouts: cascading failure, critical points, and self-organization. , 2007, Chaos.

[14]  Sujay Sanghavi,et al.  Learning the graph of epidemic cascades , 2012, SIGMETRICS '12.

[15]  Riccardo Zecchina,et al.  Bayesian inference of epidemics on networks via Belief Propagation , 2013, Physical review letters.

[16]  Marcus Kaiser,et al.  Spreading dynamics on spatially constrained complex brain networks , 2013, Journal of The Royal Society Interface.

[17]  George J. Pappas,et al.  Analysis and Control of Epidemics: A Survey of Spreading Processes on Complex Networks , 2015, IEEE Control Systems.

[18]  Andrey Y. Lokhov,et al.  Efficient reconstruction of transmission probabilities in a spreading process from partial observations , 2015, ArXiv.

[19]  Jean Pouget-Abadie,et al.  Inferring Graphs from Cascades: A Sparse Recovery Framework , 2015, ICML.

[20]  Le Song,et al.  Learning Networks of Heterogeneous Influence , 2012, NIPS.

[21]  Piet Van Mieghem,et al.  Epidemic processes in complex networks , 2014, ArXiv.

[22]  Carl Kingsford,et al.  Convex Risk Minimization to Infer Networks from probabilistic diffusion data at multiple scales , 2015, 2015 IEEE 31st International Conference on Data Engineering.