* Jacot et al. [2018] Arthur Jacot, Franck Gabriel, and Clement Hongler.  Neural tangent kernel: Convergence and generalization in neural networks.  In S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett, editors, Advances in Neural Information Processing Systems, volume 31. Curran Associates, Inc., 2018.  URL https://proceedings.neurips.cc/paper_files/paper/2018/file/5a4be1fa34e62bb8a6ec6b91d2462f5a-Paper.pdf.
  * Yang [2020] Greg Yang.  Tensor programs II: neural tangent kernel for any architecture.  CoRR, abs/2006.14548, 2020.  URL https://arxiv.org/abs/2006.14548.
  * Arora et al. [2019] Sanjeev Arora, Simon Shaolei Du, Wei Hu, Zhiyuan Li, Ruslan Salakhutdinov, and Ruosong Wang.  On exact computation with an infinitely wide neural net.  In Neural Information Processing Systems, 2019.
  * Du et al. [2019a] Simon S. Du, Xiyu Zhai, Barnabás Póczos, and Aarti Singh.  Gradient descent provably optimizes over-parameterized neural networks.  In 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019. OpenReview.net, 2019a.  URL https://openreview.net/forum?id=S1eK3i09YQ.
  * Xiao et al. [2020] Lechao Xiao, Jeffrey Pennington, and Sam Schoenholz.  Disentangling trainability and generalization in deep learning, 2020.  URL https://openreview.net/forum?id=Bkx1mxSKvB.
  * Seleznova and Kutyniok [2022] Mariia Seleznova and Gitta Kutyniok.  Neural tangent kernel beyond the infinite-width limit: Effects of depth and initialization.  In Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvári, Gang Niu, and Sivan Sabato, editors, International Conference on Machine Learning, ICML 2022, 17-23 July 2022, Baltimore, Maryland, USA, volume 162 of Proceedings of Machine Learning Research, pages 19522–19560. PMLR, 2022.  URL https://proceedings.mlr.press/v162/seleznova22a.html.
  * Chen et al. [2019] Zhengdao Chen, Lisha Li, and Joan Bruna.  Supervised community detection with line graph neural networks.  In International Conference on Learning Representations, 2019.  URL https://openreview.net/forum?id=H1g0Z3A9Fm.
  * Vapnik [2006] Vladimir Vapnik.  Estimation of Dependences Based on Empirical Data, Second Editiontion.  Springer, 2006.  ISBN 978-0-387-30865-4.  doi: 10.1007/0-387-34239-7.  URL https://doi.org/10.1007/0-387-34239-7.
  * Yang et al. [2016] Zhilin Yang, William W. Cohen, and Ruslan Salakhutdinov.  Revisiting semi-supervised learning with graph embeddings.  In Maria-Florina Balcan and Kilian Q. Weinberger, editors, Proceedings of the 33nd International Conference on Machine Learning, ICML 2016, New York City, NY, USA, June 19-24, 2016, volume 48 of JMLR Workshop and Conference Proceedings, pages 40–48. JMLR.org, 2016.  URL http://proceedings.mlr.press/v48/yanga16.html.
  * Du et al. [2019b] Simon S. Du, Kangcheng Hou, Ruslan Salakhutdinov, Barnabás Póczos, Ruosong Wang, and Keyulu Xu.  Graph neural tangent kernel: Fusing graph neural networks with graph kernels.  In Hanna M. Wallach, Hugo Larochelle, Alina Beygelzimer, Florence d’Alché-Buc, Emily B. Fox, and Roman Garnett, editors, Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, December 8-14, 2019, Vancouver, BC, Canada, pages 5724–5734, 2019b.  URL https://proceedings.neurips.cc/paper/2019/hash/663fd3c5144fd10bd5ca6611a9a5b92d-Abstract.html.
  * Niu et al. [2023] Zehao Niu, Mihai Anitescu, and Jie Chen.  Graph neural network-inspired kernels for gaussian processes in semi-supervised learning.  In The Eleventh International Conference on Learning Representations, ICLR 2023, Kigali, Rwanda, May 1-5, 2023. OpenReview.net, 2023.  URL https://openreview.net/pdf?id=flap0Bo6TK_.
  * Xu et al. [2019] Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka.  How powerful are graph neural networks?  In 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019. OpenReview.net, 2019.  URL https://openreview.net/forum?id=ryGs6iA5Km.
  * Chen et al. [2020] Ming Chen, Zhewei Wei, Zengfeng Huang, Bolin Ding, and Yaliang Li.  Simple and deep graph convolutional networks.  In Hal Daumé III and Aarti Singh, editors, Proceedings of the 37th International Conference on Machine Learning, volume 119 of Proceedings of Machine Learning Research, pages 1725–1735. PMLR, 13–18 Jul 2020.  URL https://proceedings.mlr.press/v119/chen20v.html.
  * Sabanayagam et al. [2022] Mahalakshmi Sabanayagam, Pascal Esser, and Debarghya Ghoshdastidar.  Analysis of graph convolutional networks using neural tangent kernels.  In 18th International Workshop on Mining and Learning with Graphs. OpenReview.net, 2022.  URL https://openreview.net/forum?id=qNQE83D9tF1.
  * Sabanayagam et al. [2023] Mahalakshmi Sabanayagam, Pascal Esser, and Debarghya Ghoshdastidar.  Representation power of graph convolutions : Neural tangent kernel analysis, 2023.  URL https://openreview.net/forum?id=jgUqPzuMiJQ.
  * Hron et al. [2020] Jiri Hron, Yasaman Bahri, Jascha Sohl-Dickstein, and Roman Novak.  Infinite attention: NNGP and NTK for deep attention networks.  In Hal Daumé III and Aarti Singh, editors, Proceedings of the 37th International Conference on Machine Learning, volume 119 of Proceedings of Machine Learning Research, pages 4376–4386. PMLR, 13–18 Jul 2020.  URL https://proceedings.mlr.press/v119/hron20a.html.
  * Yang [2019] Greg Yang.  Tensor programs I: wide feedforward or recurrent neural networks of any architecture are gaussian processes.  CoRR, abs/1910.12478, 2019.  URL http://arxiv.org/abs/1910.12478.
  * Du et al. [2019c] Simon S. Du, Xiyu Zhai, Barnabas Poczos, and Aarti Singh.  Gradient descent provably optimizes over-parameterized neural networks.  In International Conference on Learning Representations, 2019c.  URL https://openreview.net/forum?id=S1eK3i09YQ.
  * Neal [1996] Radford M. Neal.  Priors for Infinite Networks.  Springer New York, New York, NY, 1996.  ISBN 978-1-4612-0745-0.  doi: 10.1007/978-1-4612-0745-0˙2.  URL https://doi.org/10.1007/978-1-4612-0745-0_2.
  * Lee et al. [2017] Jaehoon Lee, Yasaman Bahri, Roman Novak, Samuel S. Schoenholz, Jeffrey Pennington, and Jascha Sohl-Dickstein.  Deep neural networks as gaussian processes.  CoRR, abs/1711.00165, 2017.  URL http://arxiv.org/abs/1711.00165.
  * de G. Matthews et al. [2018] Alexander G. de G. Matthews, Jiri Hron, Mark Rowland, Richard E. Turner, and Zoubin Ghahramani.  Gaussian process behaviour in wide deep neural networks.  In 6th International Conference on Learning Representations, ICLR 2018, Vancouver, BC, Canada, April 30 - May 3, 2018, Conference Track Proceedings. OpenReview.net, 2018.  URL https://openreview.net/forum?id=H1-nGgWC-.
  * Han et al. [2022] Insu Han, Amir Zandieh, Jaehoon Lee, Roman Novak, Lechao Xiao, and Amin Karbasi.  Fast neural kernel embeddings for general activations.  In NeurIPS, 2022.  URL http://papers.nips.cc/paper_files/paper/2022/hash/e7be1f4c6212c24919cd743512477c13-Abstract-Conference.html.
  * Novak et al. [2020] Roman Novak, Lechao Xiao, Jiri Hron, Jaehoon Lee, Alexander A. Alemi, Jascha Sohl-Dickstein, and Samuel S. Schoenholz.  Neural tangents: Fast and easy infinite neural networks in python.  In International Conference on Learning Representations, 2020.  URL https://github.com/google/neural-tangents.
  * Nguyen et al. [2021] Quynh Nguyen, Marco Mondelli, and Guido F. Montúfar.  Tight bounds on the smallest eigenvalue of the neural tangent kernel for deep relu networks.  In Marina Meila and Tong Zhang, editors, Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event, volume 139 of Proceedings of Machine Learning Research, pages 8119–8129. PMLR, 2021.  URL http://proceedings.mlr.press/v139/nguyen21g.html.
  * Zachary [1977] Wayne W. Zachary.  An information flow model for conflict and fission in small groups.  Journal of Anthropological Research, 33(4):452–473, 1977.  ISSN 00917710.  URL http://www.jstor.org/stable/3629752.
  * Yang et al. [2020] Renchi Yang, Jieming Shi, Xiaokui Xiao, Yin Yang, Juncheng Liu, and Sourav S. Bhowmick.  Scaling attributed network embedding to massive graphs.  Proc. VLDB Endow., 14(1):37–49, 2020.  doi: 10.14778/3421424.3421430.  URL http://www.vldb.org/pvldb/vol14/p37-yang.pdf.
  * Rozemberczki et al. [2021] Benedek Rozemberczki, Carl Allen, and Rik Sarkar.  Multi-scale attributed node embedding.  J. Complex Networks, 9(2), 2021.  doi: 10.1093/comnet/cnab014.  URL https://doi.org/10.1093/comnet/cnab014.
  * Rasmussen and Williams [2006] Carl Edward Rasmussen and Christopher K. I. Williams.  Gaussian processes for machine learning.  Adaptive computation and machine learning. MIT Press, 2006.  ISBN 026218253X.  URL https://www.worldcat.org/oclc/61285753.
  * Spielman and Srivastava [2011] Daniel A. Spielman and Nikhil Srivastava.  Graph sparsification by effective resistances.  SIAM J. Comput., 40(6):1913–1926, 2011.  doi: 10.1137/080734029.  URL https://doi.org/10.1137/080734029.
  * Srinivasa et al. [2020] Rakshith Sharma Srinivasa, Cao Xiao, Lucas Glass, Justin Romberg, and Jimeng Sun.  Fast graph attention networks using effective resistance based graph sparsification.  CoRR, abs/2006.08796, 2020.  URL https://arxiv.org/abs/2006.08796.