Joint Subgraph-to-Subgraph Transitions: Generalizing Triadic Closure for Powerful and Interpretable Graph Modeling

We generalize triadic closure, along with previous generalizations of triadic closure, under an intuitive umbrella generalization: the Subgraph-to-Subgraph Transition (SST). We present algorithms and code to model graph evolution in terms of collections of these SSTs. We then use the SST framework to create link prediction models for both static and temporal, directed and undirected graphs which produce highly interpretable results. Quantitatively, our models match out-of-the-box performance of state of the art graph neural network models, thereby validating the correctness and meaningfulness of our interpretable results.

[1]  Davide Eynard,et al.  Temporal Graph Networks for Deep Learning on Dynamic Graphs , 2020, ArXiv.

[2]  Natasa Przulj,et al.  Biological network comparison using graphlet degree distribution , 2007, Bioinform..

[3]  Ryan A. Rossi,et al.  From Closing Triangles to Closing Higher-Order Motifs , 2019, WWW.

[4]  David Avis,et al.  Reverse Search for Enumeration , 1996, Discret. Appl. Math..

[5]  Mark Goadrich,et al.  The relationship between Precision-Recall and ROC curves , 2006, ICML.

[6]  Wiley Interscience.  Journal of the American Society for Information Science and Technology , 2013 .

[7]  Kristian Kersting,et al.  Color Refinement and Its Applications , 2021 .

[8]  Bo Bai,et al.  Adaptive Multiple Non-negative Matrix Factorization for Temporal Link Prediction in Dynamic Networks , 2018, NetAI@SIGCOMM.

[9]  Jure Leskovec,et al.  Motifs in Temporal Networks , 2016, WSDM.

[10]  Michalis Vazirgiannis,et al.  Simple and Effective Graph Autoencoders with One-Hop Linear Models , 2020, ArXiv.

[11]  Jon M. Kleinberg,et al.  Subgraph frequencies: mapping the empirical and extremal geography of large graph collections , 2013, WWW.

[12]  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.

[13]  Gianmarco De Francisci Morales,et al.  Link Prediction via Higher-Order Motif Features , 2019, ECML/PKDD.

[14]  Ali Pinar,et al.  ESCAPE: Efficiently Counting All 5-Vertex Subgraphs , 2016, WWW.

[15]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[16]  Jon Kleinberg,et al.  The link prediction problem for social networks , 2003, CIKM '03.

[17]  Max Welling,et al.  Variational Graph Auto-Encoders , 2016, ArXiv.

[18]  Austin R. Benson,et al.  Measuring directed triadic closure with closure coefficients , 2019, Network Science.

[19]  Tamara G. Kolda,et al.  Directed closure measures for networks with reciprocity , 2013, J. Complex Networks.

[20]  Paul S. Bonsma,et al.  Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement , 2013, Theory of Computing Systems.

[21]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[22]  Brendan D. McKay,et al.  Practical graph isomorphism, II , 2013, J. Symb. Comput..

[23]  Eugene M. Luks,et al.  Isomorphism of graphs of bounded valence can be tested in polynomial time , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[24]  Nitesh V. Chawla,et al.  Evaluating link prediction methods , 2014, Knowledge and Information Systems.

[25]  Lada A. Adamic,et al.  Friends and neighbors on the Web , 2003, Soc. Networks.

[26]  Michalis Vazirgiannis,et al.  Gravity-Inspired Graph Autoencoders for Directed Link Prediction , 2019, CIKM.

[27]  W. Marsden.  I and J , 2012 .

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

[29]  Ali Pinar,et al.  Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts , 2014, WWW.

[30]  Yixin Chen,et al.  Weisfeiler-Lehman Neural Machine for Link Prediction , 2017, KDD.

[31]  Stefan Thurner,et al.  Triadic closure dynamics drives scaling laws in social multiplex networks , 2013, 1301.0259.

[32]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.