[19] Yan, Y., M. Hashemi, K. Swersky, et al. Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks. In 22nd IEEE International Conference on Data Mining. 2022.
[20] Luan, S., C. Hua, Q. Lu, et al. Revisiting heterophily for graph neural networks. In 36th Advances in Neural Information Processing Systems. 2022.
[21] Xu, K., C. Li, Y. Tian, et al. Representation learning on graphs with jumping knowledge networks. In 35th International Conference on Machine Learning, vol. 80. PMLR, 2018.
[22] Li, X., R. Zhu, Y. Cheng, et al. Finding global homophily in graph neural networks when meeting heterophily. In 39th International Conference on Machine Learning. 2022.
[23] Maurya, S. K., X. Liu, T. Murata. Simplifying approach to node classification in graph neural networks. Journal of Computational Science, 62:101695, 2022.
[24] Peng, J., Z. Chen, Y. Shao, et al. Sancus: Staleness-aware communication-avoiding full-graph decentralized training in large-scale graph neural networks. Proceedings of the VLDB Endowment, 15(9):1937–1950, 2022.
[25] Liao, N., D. Mo, S. Luo, et al. Scara: Scalable graph neural networks with feature-oriented optimization. Proceedings of the VLDB Endowment, 15(11):3240-3248, 2022.
[26] Lim, D., F. Hohne, X. Li, et al. Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods. In 34th Advances in Neural Information Processing Systems. 2021.
[27] Zeng, H., H. Zhou, A. Srivastava, et al. Graphsaint: Graph sampling based learning method. In International Conference on Learning Representations. 2019.
[28] Klicpera, J., A. Bojchevski, S. Gunnemann. Predict then propagate: Graph neural networks meet personalized pagerank. 7th International Conference on Learning Representations, pages 1-15, 2019.
[29] Bojchevski, A., J. Klicpera, B. Perozzi, et al. Scaling graph neural networks with approximate pagerank. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pages 2464-2473. ACM, 2020.
[30] Wu, F., A. Souza, T. Zhang, et al. Simplifying graph convolutional networks. In K. Chaudhuri, R. Salakhutdinov, eds., Proceedings of the 36th International Conference on Machine Learning, vol. 97, pages 6861-6871. 2019.
[31] Chen, M., Z. Wei, B. Ding, et al. Scalable graph neural networks via bidirectional propagation. 33rd Advances in Neural Information Processing Systems, 2020.
[32] Wang, H., M. He, Z. Wei, et al. Approximate graph propagation. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, pages 1686-1696. ACM, 2021.
[33] Chiang, W.-L., X. Liu, S. Si, et al. Cluster-gcn: An efficient algorithm for training deep and large graph convolutional networks. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pages 257-266. 2019.
[34] He, M., Z. Wei, Z. Huang, et al. Bernnet: Learning arbitrary graph spectral filters via bernstein approximation. In 34th Advances in Neural Information Processing Systems. 2021.
[35] He, M., Z. Wei, J.-R. Wen. Convolutional neural networks on graphs with chebyshev approximation, revisited. In 35th Advances in Neural Information Processing Systems. 2022.
[36] Gasteiger, J., S. Weißenberger, S. Gunnemann. Diffusion improves graph learning. In 32nd Advances in Neural Information Processing Systems. 2019.
[37] Wang, X., M. Zhu, D. Bo, et al. Am-gcn: Adaptive multi-channel graph convolutional networks. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD '20, page 1243-1253. Association for Computing Machinery, 2020.
[38] Cavallo, A., C. Grohnfeldt, M. Russo, et al. 2-hop neighbor class similarity (2ncs): A graph structural metric indicative of graph neural network performance. In 3rd Workshop on Graphs and More Complex Structures for Learning and Reasoning (GCLR) at AAAI 2023. 2022.
[39] Belkin, M., P. Niyogi. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15(6):1373-1396, 2003.