Dynamic Network Model from Partial Observations

Can evolving networks be inferred and modeled without directly observing their nodes and edges? In many applications, the edges of a dynamic network might not be observed, but one can observe the dynamics of stochastic cascading processes (e.g., information diffusion, virus propagation) occurring over the unobserved network. While there have been efforts to infer networks based on such data, providing a generative probabilistic model that is able to identify the underlying time-varying network remains an open question. Here we consider the problem of inferring generative dynamic network models based on network cascade diffusion data. We propose a novel framework for providing a non-parametric dynamic network model--based on a mixture of coupled hierarchical Dirichlet processes-- based on data capturing cascade node infection times. Our approach allows us to infer the evolving community structure in networks and to obtain an explicit predictive distribution over the edges of the underlying network--including those that were not involved in transmission of any cascade, or are likely to appear in the future. We show the effectiveness of our approach using extensive experiments on synthetic as well as real-world networks.

[1]  Andreas Krause,et al.  Learning Implicit Generative Models Using Differentiable Graph Tests , 2017, ArXiv.

[2]  R. Lyons Determinantal probability measures , 2002, math/0204325.

[3]  Michael I. Jordan,et al.  The Sticky HDP-HMM: Bayesian Nonparametric Hidden Markov Models with Persistent States , 2009 .

[4]  Walter Dempsey,et al.  Edge exchangeable models for network data , 2016, ArXiv.

[5]  Kathryn B. Laskey,et al.  Stochastic blockmodels: First steps , 1983 .

[6]  Zoubin Ghahramani,et al.  An Infinite Latent Attribute Model for Network Data , 2012, ICML.

[7]  Jia Wang,et al.  Topological Recurrent Neural Network for Diffusion Prediction , 2017, 2017 IEEE International Conference on Data Mining (ICDM).

[8]  Trevor Campbell,et al.  Edge-exchangeable graphs and sparsity , 2016, NIPS.

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

[10]  Thomas L. Griffiths,et al.  Nonparametric Latent Feature Models for Link Prediction , 2009, NIPS.

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

[12]  Sinead Williamson,et al.  Nonparametric Network Models for Link Prediction , 2016, J. Mach. Learn. Res..

[13]  Amr Ahmed,et al.  Recovering time-varying networks of dependencies in social and biological studies , 2009, Proceedings of the National Academy of Sciences.

[14]  Shang-Hua Teng,et al.  Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems , 2006, SIAM J. Matrix Anal. Appl..

[15]  Bernhard Schölkopf,et al.  Structure and dynamics of information pathways in online media , 2012, WSDM.

[16]  Thomas L. Griffiths,et al.  Learning Systems of Concepts with an Infinite Relational Model , 2006, AAAI.

[17]  Cheng Li,et al.  DeepCas: An End-to-end Predictor of Information Cascades , 2016, WWW.

[18]  T. Snijders,et al.  Estimation and Prediction for Stochastic Blockmodels for Graphs with Latent Block Structure , 1997 .

[19]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

[20]  Christos Faloutsos,et al.  Scalable modeling of real graphs using Kronecker multiplication , 2007, ICML '07.

[21]  Peter D. Hoff,et al.  Latent Space Approaches to Social Network Analysis , 2002 .

[22]  Edoardo M. Airoldi,et al.  A Survey of Statistical Network Models , 2009, Found. Trends Mach. Learn..

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

[24]  Zoubin Ghahramani,et al.  Random function priors for exchangeable arrays with applications to graphs and relational data , 2012, NIPS.

[25]  Kristina Lerman,et al.  The Simple Rules of Social Contagion , 2013, Scientific Reports.

[26]  Jure Leskovec,et al.  Inferring networks of diffusion and influence , 2010, KDD.

[27]  Edoardo M. Airoldi,et al.  Mixed Membership Stochastic Blockmodels , 2007, NIPS.

[28]  Morten Mørup,et al.  Completely random measures for modelling block-structured sparse networks , 2016, NIPS.

[29]  Sylvain Lamprier,et al.  Representation Learning for Information Diffusion through Social Networks: an Embedded Cascade Model , 2016, WSDM.

[30]  Jure Leskovec,et al.  Meme-tracking and the dynamics of the news cycle , 2009, KDD.

[31]  Naonori Ueda,et al.  Dynamic Infinite Relational Model for Time-varying Relational Data Analysis , 2010, NIPS.

[32]  A. H. Shirazi,et al.  Network analysis of a financial market based on genuine correlation and threshold method , 2011 .

[33]  D. Aldous Representations for partially exchangeable arrays of random variables , 1981 .