Qiu, J., Dong, Y., Ma, H., Li, J., Wang, K., and Tang, J. Network embedding as matrix factorization: Unifying deepwalk, line, pte, and node2vec. In Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, pp. 459-467. ACM, 2018.
Rendsburg, L., Heidrich, H., and Von Luxburg, U. Netgan without gan: From random walks to low-rank approximations. In International Conference on Machine Learning, pp. 8073-8082. PMLR, 2020.
Rubin-Delanchy, P., Cape, J., Tang, M., and Priebe, C. E. A statistical interpretation of spectral embedding: the generalised random dot product graph. arXiv preprint arXiv:1709.05506, 2017.
Sala, F., De Sa, C., Gu, A., and Ré, C. Representation tradeoffs for hyperbolic embeddings. In International Conference on Machine Learning, pp. 4460-4469. PMLR, 2018.
Schaeffer, S. E. Graph clustering. Computer Science Review, 1(1):27-64, 2007.
Scheinerman, E. R. and Tucker, K. Modeling graphs using dot product representations. Computational statistics, 25(1):1-16, 2010.
Scott, J. Social network analysis. Sociology, 22(1):109-127, 1988.
Seshadhri, C., Sharma, A., Stolman, A., and Goel, A. The impossibility of low-rank representations for triangle-rich complex networks. Proceedings of the National Academy of Sciences, 117(11): 5631-5637, 2020.
Shi, J. and Malik, J. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888-905, 2000.
Sun, F., Qu, M., Hoffmann, J., Huang, C., and Tang, J. vgraph: A generative model for joint community detection and node representation learning. In Advances in Neural Information Processing Systems 32, pp. 512-522, 2019.
Tang, L. and Liu, H. Relational learning via latent social dimensions. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 817-826. ACM, 2009.
Wang, Y.-X. and Zhang, Y.-J. Nonnegative matrix factorization: A comprehensive review. IEEE Transactions on Knowledge and Data Engineering, 25(6):1336-1353, 2012.
Xie, J., Kelley, S., and Szymanski, B. K. Overlapping community detection in networks: The state-of-the-art and comparative study. ACM Computing Surveys, 45(4):43:1-43:35, 2013.
Yan, Y., Hashemi, M., Swersky, K., Yang, Y., and Koutra, D. Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks. arXiv preprint arXiv:2102.06462, 2021.
Yang, J. and Leskovec, J. Overlapping community detection at scale: a nonnegative matrix factorization approach. In Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, pp. 587-596, 2013.
Yang, J. and Leskovec, J. Defining and evaluating network communities based on ground-truth. Knowledge and Information Systems, 42(1):181-213, 2015.
Yang, Z., Hao, T., Dikmen, O., Chen, X., and Oja, E. Clustering by nonnegative matrix factorization using graph random walk. In Advances in Neural Information Processing Systems, pp. 1079-1087, 2012.
Young, S. J. and Scheinerman, E. R. Random dot product graph models for social networks. In International Workshop on Algorithms and Models for the Web-Graph, pp. 138-149. Springer, 2007.
Yu, K., Yu, S., and Tresp, V. Soft clustering on graphs. In Advances in Neural Information Processing Systems, pp. 1553-1560, 2005.