Cascade Size Distributions: Why They Matter and How to Compute Them Efficiently

Cascade models are central to understanding, predicting, and controlling epidemic spreading and information propagation. Related optimization, including influence maximization, model parameter inference, or the development of vaccination strategies, relies heavily on sampling from a model. This is either inefficient or inaccurate. As alternative, we present an efficient message passing algorithm that computes the probability distribution of the cascade size for the Independent Cascade Model on weighted directed networks and generalizations. Our approach is exact on trees but can be applied to any network topology. It approximates locally treelike networks well, scales to large networks, and can lead to surprisingly good performance on more dense networks, as we also exemplify on real world data.

[1]  David Saad,et al.  Scalable Influence Estimation Without Sampling , 2019, ArXiv.

[2]  Pierre-André Noël,et al.  Controlling self-organizing dynamics on networks using models that self-organize. , 2013, Physical review letters.

[3]  E. Young Contagion , 2015, New Scientist.

[4]  Andrey Y. Lokhov,et al.  Reconstructing Parameters of Spreading Models from Partial Observations , 2016, NIPS.

[5]  Sinan Aral,et al.  The spread of true and false news online , 2018, Science.

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

[7]  A. Vespignani,et al.  Changes in contact patterns shape the dynamics of the COVID-19 outbreak in China , 2020, Science.

[8]  Frank Schweitzer,et al.  Correlations between thresholds and degrees: An analytic approach to model attacks and failure cascades , 2017, Physical review. E.

[9]  M. Newman Spread of epidemic disease on networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Jure Leskovec,et al.  The dynamics of viral marketing , 2005, EC '06.

[11]  Frank Schweitzer,et al.  A framework for cascade size calculations on random networks , 2017, Physical review. E.

[12]  Éva Tardos,et al.  Influential Nodes in a Diffusion Model for Social Networks , 2005, ICALP.

[13]  Yaron Singer,et al.  Robust Influence Maximization for Hyperparametric Models , 2019, ICML.

[14]  K. Norlen 1 EVA : Extraction , Visualization and Analysis of the Telecommunications and Media Ownership Network , 2002 .

[15]  Rebekka Burkholz,et al.  Efficient message passing for cascade size distributions , 2018, Scientific Reports.

[16]  Frank Schweitzer,et al.  How damage diversification can reduce systemic risk. , 2015, Physical review. E.

[17]  Frank Schweitzer,et al.  Explicit size distributions of failure cascades redefine systemic risk on finite networks , 2018, Scientific Reports.

[18]  Jure Leskovec,et al.  Defining and evaluating network communities based on ground-truth , 2012, Knowledge and Information Systems.

[19]  Alexander J. McNeil,et al.  Quantitative Risk Management: Concepts, Techniques and Tools Revised edition , 2015 .

[20]  Duncan J Watts,et al.  A simple model of global cascades on random networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[21]  Dorothea Wagner,et al.  Approximating Clustering Coefficient and Transitivity , 2005, J. Graph Algorithms Appl..

[22]  Preetam Ghosh,et al.  Determining causal miRNAs and their signaling cascade in diseases using an influence diffusion model , 2017, Scientific Reports.

[23]  Andreas Krause,et al.  Cost-effective outbreak detection in networks , 2007, KDD '07.

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

[25]  Guido Caldarelli,et al.  The price of complexity in financial networks , 2015, Proceedings of the National Academy of Sciences.

[26]  Frank Schweitzer,et al.  Systemic risk in multiplex networks with asymmetric coupling and threshold feedback , 2015, 1506.06664.

[27]  Christian Borgs,et al.  Maximizing Social Influence in Nearly Optimal Time , 2012, SODA.

[28]  Constantine Caramanis,et al.  Learning Graphs from Noisy Epidemic Cascades , 2019, Abstracts of the 2019 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems.

[29]  John Quackenbush,et al.  Gene Regulatory Network Inference as Relaxed Graph Matching , 2020, bioRxiv.

[30]  Lei Ying,et al.  Catch'Em All: Locating Multiple Diffusion Sources in Networks with Partial Observations , 2016, AAAI.

[31]  Divyakant Agrawal,et al.  Limiting the spread of misinformation in social networks , 2011, WWW.

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

[33]  Masahiro Kimura,et al.  Learning Continuous-Time Information Diffusion Model for Social Behavioral Data Analysis , 2009, ACML.

[34]  Rebekka Burkholz,et al.  Initialization of ReLUs for Dynamical Isometry , 2019, NeurIPS.

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

[36]  Sebastian Tschiatschek,et al.  Fake News Detection in Social Networks via Crowd Signals , 2017, WWW.

[37]  Le Song,et al.  Influence Function Learning in Information Diffusion Networks , 2014, ICML.

[38]  Rediet Abebe Can Cascades be Predicted? , 2014 .

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

[40]  F. Schweitzer,et al.  International crop trade networks: the impact of shocks and cascades , 2019, Environmental Research Letters.

[41]  Zheng Wen,et al.  Online Influence Maximization under Independent Cascade Model with Semi-Bandit Feedback , 2016, NIPS.

[42]  Yuichi Yoshida,et al.  Portfolio Optimization for Influence Spread , 2017, WWW.

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

[44]  Mary K. Vernon,et al.  Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems , 1998, SIGMETRICS 1998.

[45]  Yong-Yeol Ahn Complex Spreading Phenomena in Social Systems , 2018 .

[46]  He Chen,et al.  Scalable Rumor Source Detection under Independent Cascade Model in Online Social Networks , 2015, 2015 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN).

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

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

[49]  Jacob Goldenberg,et al.  Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth , 2001 .

[50]  W. O. Kermack,et al.  A contribution to the mathematical theory of epidemics , 1927 .

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

[52]  My T. Thai,et al.  Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-scale Networks , 2016, SIGMOD Conference.

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

[54]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.