[1] Abbe, E. and Sandon, C. (2015). Community detection in general stochastic block models: Fundamental limits and efficient algorithms for recovery. In IEEE 56th Annual Symposium on Foundations of Computer Science, pages 670-688.
[2] Airoldi, E. M., Costa, T. B., and Chan, S. H. (2013). Stochastic blockmodel approximation of a graphon: Theory and consistent estimation. Advances in Neural Information Processing Systems, 26.
[3] Ambroise, C. and Matias, C. (2012). New consistent and asymptotically normal parameter estimates for random-graph mixture models. Journal of the Royal Statistical Society, Series B, 74:3-35.
[4] Anandkumar, A., Ge, R., Hsu, D., and Kakade, S. (2013). A tensor spectral approach to learning mixed membership community models. In Conference on Learning Theory, pages 867-881. PMLR.
[5] Bickel, P. J., Chen, A., and Levina, E. (2011). The method of moments and degree distributions for network models. Annals of Statistics, 39(5):2280-2301.
[6] Borgs, C. and Chayes, J. (2017). Graphons: A nonparametric method to model, estimate, and design algorithms for massive networks. In Proceedings of the 2017 ACM Conference on Economics and Computation, pages 665-672.
[7] Bravo-Hermsdorff, G., Gunderson, L. M., Maugis, P.-A., and Priebe, C. E. (2023). Quantifying network similarity using graph cumulants. Journal of Machine Learning Research, 24(187):1-27.
[8] Celisse, A., Daudin, J.-J., and Pierre, L. (2012). Consistency of maximum-likelihood and variational estimators in the stochastic block model. *Electronic Journal of Statistics*, 6:1847 - 1899.
[9] Channarond, A., Daudin, J.-J., and Robin, S. (2012). Classification and estimation in the stochastic blockmodel based on the empirical degrees.
[10] De Nicola, G., Sischka, B., and Kauermann, G. (2022). Mixture models and networks: The stochastic blockmodel. Statistical Modelling, 22(1-2):67-94.
[11] Deng, J., Huang, D., Chang, X., and Zhang, B. (2023). Subsampling-based modified bayesian information criterion for large-scale stochastic block models. arXiv:2304.06900.
[12] Diaconis, P. and Janson, S. (2008). Graph limits and exchangeable random graphs. *Rendiconti di Matematica*, 28:33-61.
[13] Gao, C., Lu, Y., and Zhou, H. H. (2015). Rate-optimal graphon estimation.
[14] Gordon, S., Mazaheri, B. H., Rabani, Y., and Schulman, L. (2021). Source identification for mixtures of product distributions. In Conference on Learning Theory, pages 2193-2216. PMLR.
[15] Gunderson, L. M. and Bravo-Hermsdorff, G. (2020). Introducing graph cumulants: What is the variance of your social network? arXiv:2002.03959.
[16] Karwa, V., Petrovic, S., and Bajić, D. (2016). DERGMs: Degeneracy-restricted exponential random graph models. arXiv:1612.03054.
[17] Kaur, G. and Röllin, A. (2021). Higher-order fluctuations in dense random graph models. Electronic Journal of Probability, 26:1-36.
[18] Latouche, P. and Robin, S. (2016). Variational bayes model averaging for graphon functions and motif frequencies inference in W-graph models. Statistics and Computing, 26:1173-1185.
[19] Lauritzen, S., Rinaldo, A., and Sadeghi, K. (2018). Random networks, graphical models and exchangeability. Journal of the Royal Statistical Society, Series B, 80(3):481-508.
[20] Li, Y., Fan, X., Chen, L., Li, B., and Sisson, S. A. (2022). Smoothing graphons for modelling exchangeable relational data. Machine Learning, 111(1):319-344.