[56] Peter Orbanz and Daniel M Roy. Bayesian models of graphs, arrays and other exchangeable random structures. IEEE Transactions on Pattern Analysis and Machine Intelligence, 37(2): 437-461, 2014.
[57] Apostolos N Papadopoulos and Yannis Manolopoulos. Structure-based similarity search with graph histograms. Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99, pages 174-178, 1999.
[58] Zhan Qin, Ting Yu, Yin Yang, Issa Khalil, Xiaokui Xiao, and Kui Ren. Generating synthetic decentralized social graphs with local differential privacy. ACM SIGSAC Conference on Computer and Communications Security, pages 425-438, 2017.
[59] Bruno Ribeiro and Don Towsley. On the estimation accuracy of degree distributions from graph sampling. IEEE Conference on Decision and Control, pages 5240-5247, 2012.
[60] Matthew Richardson and Pedro M. Domingos. Markov logic networks. Mach. Learn., 62(1-2): 107-136, 2006.
[61] Edo Roth, Karan Newatia, Yiping Ma, Ke Zhong, Sebastian Angel, and Andreas Haeberlen. Mycelium: Large-scale distributed graph queries with differential privacy. The ACM Symposium on Operating Systems Principles, pages 327-343, 2021.
[62] Oleh Rybkin, Kostas Daniilidis, and Sergey Levine. Simple and effective vae training with calibrated decoders. International Conference on Machine Learning, pages 9179-9189, 2021.
[63] Alessandra Sala, Xiaohan Zhao, Christo Wilson, Haitao Zheng, and Ben Y. Zhao. Sharing graphs using differentially private graph models. ACM SIGCOMM Internet Measurement Conference, IMC '11, Berlin, Germany, November 2-, 2011, pages 81-98, 2011.
[64] Dylan Sandfelder, Priyesh Vijayan, and William L Hamilton. Ego-gnns: Exploiting ego structures in graph neural networks. IEEE International Conference on Acoustics, Speech and Signal Processing, pages 8523-8527, 2021.
[65] Leonardo BL Santos, Luiz Max Carvalho, Giovanni G Soares, Leonardo N Ferreira, and Igor M Sokolov. Beyond the shortest path: the path length index as a distribution. arXiv preprint arXiv:2210.03216, 2022.
[66] Adam Sealfon. Shortest paths and distances with differential privacy. ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pages 29-41, 2016.
[67] Comandur Seshadhri, Tamara G Kolda, and Ali Pinar. Community structure and scale-free collections of Erdős-Rényi graphs. Physical Review E, 85(5):056109, 2012.
[68] Hamed Shirzad, Kaveh Hassani, and Danica J Sutherland. Evaluating graph generative models with contrastively learned features. Advances in Neural Information Processing Systems, 2022.
[69] Satyaki Sikdar, Daniel Gonzalez Cedre, Trenton W Ford, and Tim Weninger. The infinity mirror test for graph models. IEEE Transactions on Knowledge and Data Engineering, 35(4): 4281-4292, 2022.
[70] Martin Simonovsky and Nikos Komodakis. GraphVAE: Towards generation of small graphs using variational autoencoders. Artificial Neural Networks and Machine Learning, 11139: 412-422, 2018.
[71] Abhradeep Guha Thakurta, Andrew H Vyrros, Umesh S Vaishampayan, Gaurav Kapoor, Julien Freudiger, Vivek Rangarajan Sridhar, and Doug Davidson. Learning new words. Granted US Patents, 9594741, 2017.
[72] Rylee Thompson, Boris Knyazev, Elahe Ghalebi, Jungtaek Kim, and Graham W Taylor. On evaluation metrics for graph generative models. International Conference on Learning Representations, 2022.
[73] Hannu Toivonen, Ashwin Srinivasan, Ross D King, Stefan Kramer, and Christoph Helma. Statistical evaluation of the predictive toxicology challenge 2000-2001. Bioinformatics, 19(10): 1183-1193, 2003.