On RKHS Choices for Assessing Graph Generators via Kernel Stein Statistics

Score-based kernelised Stein discrepancy (KSD) tests have emerged as a powerful tool for the goodness of fit tests, especially in high dimensions; however, the test performance may depend on the choice of kernels in an underlying reproducing kernel Hilbert space (RKHS). Here we assess the effect of RKHS choice for KSD tests of random networks models, developed for exponential random graph models (ERGMs) in Xu and Reinert (2021) and for synthetic graph generators in Xu and Reinert (2022). We investigate the power performance and the computational runtime of the test in different scenarios, including both dense and sparse graph regimes. Experimental results on kernel performance for model assessment tasks are shown and discussed on synthetic and real-world network applications.

[1]  G. Reinert,et al.  AgraSSt: Approximate Graph Stein Statistics for Interpretable Assessment of Implicit Graph Generators , 2022, NeurIPS.

[2]  A. Gretton,et al.  KSD Aggregated Goodness-of-fit Test , 2022, NeurIPS.

[3]  Ulrike von Luxburg,et al.  NetGAN without GAN: From Random Walks to Low-Rank Approximations , 2020, ICML.

[4]  Lester W. Mackey,et al.  Stochastic Stein Discrepancies , 2020, NeurIPS.

[5]  Nils M. Kriege,et al.  A survey on graph kernels , 2019, Applied Network Science.

[6]  G. Reinert,et al.  Approximating stationary distributions of fast mixing Glauber dynamics, with applications to exponential random graphs , 2017, The Annals of Applied Probability.

[7]  Karsten M. Borgwardt,et al.  graphkernels: R and Python packages for graph comparison , 2017, Bioinform..

[8]  Nils M. Kriege,et al.  On Valid Optimal Assignment Kernels and Applications to Graph Classification , 2016, NIPS.

[9]  Michael I. Jordan,et al.  A Kernelized Stein Discrepancy for Goodness-of-fit Tests , 2016, ICML.

[10]  Arthur Gretton,et al.  A Kernel Test of Goodness of Fit , 2016, ICML.

[11]  Karsten M. Borgwardt,et al.  Halting in Random Walk Kernels , 2015, NIPS.

[12]  Ryan A. Rossi,et al.  Graphlet decomposition: framework, algorithms, and applications , 2015, Knowledge and Information Systems.

[13]  G. Reinert,et al.  Stein's method for comparison of univariate distributions , 2014, 1408.2998.

[14]  P. Diaconis,et al.  Estimating and understanding exponential random graph models , 2011, 1102.2650.

[15]  Kurt Mehlhorn,et al.  Weisfeiler-Lehman Graph Kernels , 2011, J. Mach. Learn. Res..

[16]  Kurt Mehlhorn,et al.  Efficient graphlet kernels for large graph comparison , 2009, AISTATS.

[17]  Guy Bresler,et al.  Mixing Time of Exponential Random Graphs , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[18]  D. Hunter,et al.  ergm: A Package to Fit, Simulate and Diagnose Exponential-Family Models for Networks. , 2008, Journal of statistical software.

[19]  D. Hunter,et al.  Goodness of Fit of Social Network Models , 2008 .

[20]  Hans-Peter Kriegel,et al.  Shortest-path kernels on graphs , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[21]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  J. Dall,et al.  Random geometric graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[24]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[25]  P. Holland,et al.  An Exponential Family of Probability Distributions for Directed Graphs , 1981 .

[26]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[27]  J. Sherman,et al.  Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix , 1950 .

[28]  Gesine Reinert,et al.  A Stein Goodness-of-test for Exponential Random Graph Models , 2021, AISTATS.

[29]  Markov Graphs , 2018, Encyclopedia of Social Network Analysis and Mining. 2nd Ed..

[30]  Thomas Gärtner,et al.  On Graph Kernels: Hardness Results and Efficient Alternatives , 2003, COLT.

[31]  S. Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994 .