[38] M. Z. Racz and D. E. Rigobon, "Towards consensus: Reducing polarization by perturbing social networks," arXiv preprint arXiv:2206.08996, 2022.
[39] U. Chitra and C. Musco, "Analyzing the impact of filter bubbles on social network polarization," in Proceedings of the 13th International Conference on Web Search and Data Mining, 2020, pp. 115-123.
[40] T. Opsahl, "Triadic closure in two-mode networks: Redefining the global and local clustering coefficients," Social networks, vol. 35, no. 2, pp. 159-167, 2013.
[41] Y. Wang, P. Li, C. Bai, V. Subrahmanian, and J. Leskovec, "Generic representation learning for dynamic social interaction," in Proc. 26th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining Workshop, 2020.
[42] Y. Wang, Y.-Y. Chang, Y. Liu, J. Leskovec, and P. Li, "Inductive representation learning in temporal networks via causal anonymous walks," arXiv preprint arXiv:2101.05974, 2021.
[43] P. Li, Y. Wang, H. Wang, and J. Leskovec, “Distance encoding: Design provably more powerful neural networks for graph representation learning,” Advances in Neural Information Processing Systems, vol. 33, pp. 4465–4478, 2020.
[44] H. Yin, Y. Wang, and P. Li, “Revisiting graph neural networks and distance encoding from a practical view,” arXiv preprint arXiv:2011.12228, 2020.
[45] Y. Wang, P. Li, C. Bai, and J. Leskovec, "Tedic: Neural modeling of behavioral patterns in dynamic social interaction networks," in Proceedings of the Web Conference 2021, 2021, pp. 693-705.
[46] B. Bahmani, A. Chowdhury, and A. Goel, "Fast incremental and personalized pagerank," arXiv preprint arXiv:1006.2880, 2010.
[47] L. Katz, “A new status index derived from sociometric analysis,” Psychometrika, vol. 18, no. 1, pp. 39–43, 1953.
[48] G. Salton, “Introduction to modern information retrieval,” McGraw-Hill, 1983.
[49] L. A. Adamic and E. Adar, “Friends and neighbors on the web,” Social networks, vol. 25, no. 3, pp. 211–230, 2003.
[50] M. E. Newman, “Clustering and preferential attachment in growing networks,” *Physical review E*, vol. 64, no. 2, p. 025102, 2001.
[51] T. Zhou, L. Lu, and Y.-C. Zhang, "Predicting missing links via local information," The European Physical Journal B, vol. 71, pp. 623-630, 2009.
[52] A. Grover and J. Leskovec, "node2vec: Scalable feature learning for networks," in Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining, 2016, pp. 855-864.
[53] T. N. Kipf and M. Welling, "Semi-supervised classification with graph convolutional networks," arXiv preprint arXiv:1609.02907, 2016.
[54] M. Schlichtkrull, T. N. Kipf, P. Bloem, R. Van Den Berg, I. Titov, and M. Welling, "Modeling relational data with graph convolutional networks," in The Semantic Web: 15th International Conference, ESWC 2018, Heraklion, Crete, Greece, June 3-7, 2018, Proceedings 15. Springer, 2018, pp. 593-607.
[55] L. Rampášek, M. Galkin, V. P. Dwivedi, A. T. Luu, G. Wolf, and D. Beaini, “Recipe for a general, powerful, scalable graph transformer,” Advances in Neural Information Processing Systems, vol. 35, pp. 14501–14515, 2022.
[56] D. Kim and A. Oh, "How to find your friendly neighborhood: Graph attention design with self-supervision," arXiv preprint arXiv:2204.04879, 2022.
[57] D. Bindel, J. Kleinberg, and S. Oren, “How bad is forming your own opinion?” Games and Economic Behavior, vol. 92, pp. 248–265, 2015.
[58] M. S. Bartlett, “An inverse matrix adjustment arising in discriminant analysis,” The Annals of Mathematical Statistics, vol. 22, no. 1, pp. 107–111, 1951.
[59] P. Chebotarev and E. Shamis, "Matrix-forest theorems," arXiv preprint math/0602575, 2006.
[60] W. Watkins, “Convex matrix functions,” Proceedings of the American Mathematical Society, pp. 31–34, 1974.