Using network motifs to characterize temporal network evolution leading to diffusion inhibition

Network motifs are patterns of over-represented node interactions in a network which have been previously used as building blocks to understand various aspects of the social networks. In this paper, we use motif patterns to characterize the information diffusion process in social networks. We study the lifecycle of information cascades to understand what leads to saturation of growth in terms of cascade reshares, thereby resulting in expiration, an event we call “diffusion inhibition”. In an attempt to understand what causes inhibition, we use motifs to dissect the network obtained from information cascades coupled with traces of historical diffusion or social network links. Our main results follow from experiments on a dataset of cascades from the Weibo platform and the Flixster movie ratings. We observe the temporal counts of 5-node undirected motifs from the cascade temporal networks leading to the inhibition stage. Empirical evidences from the analysis lead us to conclude the following about stages preceding inhibition: (1) individuals tend to adopt information more from users they have known in the past through social networks or previous interactions thereby creating patterns containing triads more frequently than acyclic patterns with linear chains and (2) users need multiple exposures or rounds of social reinforcement for them to adopt an information and as a result information starts spreading slowly thereby leading to the death of the cascade. Following these observations, we use motif-based features to predict the edge cardinality of the network exhibited at the time of inhibition. We test features of motif patterns using regression models for both individual patterns and their combination and we find that motifs as features are better predictors of the future network organization than individual node centralities.

[1]  Sebastian Wernicke,et al.  FANMOD: a tool for fast network motif detection , 2006, Bioinform..

[2]  Ruocheng Guo,et al.  Diffusion in Social Networks , 2015, SpringerBriefs in Computer Science.

[3]  Jure Leskovec,et al.  SEISMIC: A Self-Exciting Point Process Model for Predicting Tweet Popularity , 2015, KDD.

[4]  Janez Demsar,et al.  A combinatorial approach to graphlet counting , 2014, Bioinform..

[5]  Fei Wang,et al.  Cascading outbreak prediction in networks: a data-driven approach , 2013, KDD.

[6]  M. Yuan,et al.  Model selection and estimation in regression with grouped variables , 2006 .

[7]  R. Tibshirani Regression Shrinkage and Selection via the Lasso , 1996 .

[8]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[9]  Nicola Parolini,et al.  Link Prediction in Criminal Networks: A Tool for Criminal Intelligence Analysis , 2016, PloS one.

[10]  Ruocheng Guo,et al.  Understanding and forecasting lifecycle events in information cascades , 2017, Social Network Analysis and Mining.

[11]  Jure Leskovec,et al.  Higher-order organization of complex networks , 2016, Science.

[12]  Niloy Ganguly,et al.  An author is known by the context she keeps: significance of network motifs in scientific collaborations , 2015, Social Network Analysis and Mining.

[13]  Katarzyna Musial,et al.  Link Prediction Based on Subgraph Evolution in Dynamic Social Networks , 2011, 2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing.

[14]  G. Caldarelli,et al.  The spreading of misinformation online , 2016, Proceedings of the National Academy of Sciences.

[15]  Jure Leskovec,et al.  Do Cascades Recur? , 2016, WWW.

[16]  David Liben-Nowell,et al.  The link-prediction problem for social networks , 2007 .

[17]  Concettina Guerra,et al.  A review on models and algorithms for motif discovery in protein-protein interaction networks. , 2008, Briefings in functional genomics & proteomics.

[18]  Jure Leskovec,et al.  The Network Completion Problem: Inferring Missing Nodes and Edges in Networks , 2011, SDM.

[19]  J. Stark,et al.  Network motifs: structure does not determine function , 2006, BMC Genomics.

[20]  Jon M. Kleinberg,et al.  The link-prediction problem for social networks , 2007, J. Assoc. Inf. Sci. Technol..

[21]  Shuang Li,et al.  COEVOLVE: A Joint Point Process Model for Information Diffusion and Network Co-evolution , 2015, NIPS.

[22]  Pedro M. Domingos Mining Social Networks for Viral Marketing , 2022 .

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

[24]  Zhiming Zheng,et al.  Searching for superspreaders of information in real-world social media , 2014, Scientific Reports.

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

[26]  Tanya Y. Berger-Wolf,et al.  Structure Prediction in Temporal Networks using Frequent Subgraphs , 2007, 2007 IEEE Symposium on Computational Intelligence and Data Mining.

[27]  Scott Sanner,et al.  The Lifecyle of a Youtube Video: Phases, Content and Popularity , 2015, ICWSM.

[28]  Ruocheng Guo,et al.  Toward early and order-of-magnitude cascade prediction in social networks , 2016, Social Network Analysis and Mining.

[29]  Sergey N. Dorogovtsev,et al.  K-core Organization of Complex Networks , 2005, Physical review letters.

[30]  Sebastian Wernicke,et al.  Efficient Detection of Network Motifs , 2006, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[31]  S. Shen-Orr,et al.  Network motifs in the transcriptional regulation network of Escherichia coli , 2002, Nature Genetics.

[32]  Hsinchun Chen,et al.  Link prediction approach to collaborative filtering , 2005, Proceedings of the 5th ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL '05).

[33]  Paulo Shakarian,et al.  Large Social Networks Can Be Targeted for Viral Marketing with Small Seed Sets , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

[34]  Aristides Gionis,et al.  Reconstructing an Epidemic Over Time , 2016, KDD.

[35]  Jinfei Xie,et al.  PATTERN-BASED CHARACTERIZATION OF TIME SERIES , 2007 .

[36]  László Babai,et al.  Canonical labeling of graphs , 1983, STOC.

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

[38]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[39]  Shuang-Hong Yang,et al.  Mixture of Mutually Exciting Processes for Viral Diffusion , 2013, ICML.

[40]  Lev Muchnik,et al.  Identifying influential spreaders in complex networks , 2010, 1001.5285.

[41]  A. Barabasi,et al.  Social group dynamics in networks , 2009 .

[42]  Kristina Lerman,et al.  What Stops Social Epidemics? , 2011, ICWSM.

[43]  S. Shen-Orr,et al.  Networks Network Motifs : Simple Building Blocks of Complex , 2002 .

[44]  Andreas Björklund,et al.  The traveling salesman problem in bounded degree graphs , 2012, TALG.

[45]  Chun-Hsi Huang,et al.  Biological network motif detection: principles and practice , 2012, Briefings Bioinform..

[46]  Tiago P. Peixoto,et al.  The graph-tool python library , 2014 .

[47]  S. Shen-Orr,et al.  Superfamilies of Evolved and Designed Networks , 2004, Science.

[48]  Jiming Liu,et al.  Inferring Motif-Based Diffusion Models for Social Networks , 2016, IJCAI.

[49]  Nataša Pržulj,et al.  Graphlet-based Characterization of Directed Networks , 2016, Scientific Reports.

[50]  Kai Liu,et al.  Detecting stochastic temporal network motifs for human communication patterns analysis , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).

[51]  T. Vicsek,et al.  Clique percolation in random networks. , 2005, Physical review letters.

[52]  Jure Leskovec,et al.  Patterns of Influence in a Recommendation Network , 2006, PAKDD.

[53]  Daniel G. Goldstein,et al.  The structure of online diffusion networks , 2012, EC '12.

[54]  Paulo Shakarian,et al.  Finding Near-Optimal Groups of Epidemic Spreaders in a Complex Network , 2014, PloS one.

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

[56]  Scott Sanner,et al.  Expecting to be HIP: Hawkes Intensity Processes for Social Media Popularity , 2016, WWW.

[57]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[58]  E. Levina,et al.  Community extraction for social networks , 2010, Proceedings of the National Academy of Sciences.

[59]  M. Sarvary,et al.  Network Effects and Personal Influences: The Diffusion of an Online Social Network , 2011 .

[60]  Sarit Kraus,et al.  Diffusion centrality: A paradigm to maximize spread in social networks , 2016, Artif. Intell..

[61]  Steffen Staab,et al.  Social Networks Applied , 2005, IEEE Intell. Syst..

[62]  U. Alon Network motifs: theory and experimental approaches , 2007, Nature Reviews Genetics.

[63]  Jari Saramäki,et al.  Temporal motifs reveal homophily, gender-specific patterns, and group talk in call sequences , 2013, Proceedings of the National Academy of Sciences.

[64]  Y. Ogata Space-Time Point-Process Models for Earthquake Occurrences , 1998 .

[65]  Chris Arney,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World (Easley, D. and Kleinberg, J.; 2010) [Book Review] , 2013, IEEE Technology and Society Magazine.

[66]  Rami Puzis,et al.  Link Prediction in Social Networks Using Computationally Efficient Topological Features , 2011, 2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing.