Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Network Science perspective of Graph Convolutional Networks: A survey (2301.04824v1)

Published 12 Jan 2023 in cs.SI and cs.LG

Abstract: The mining and exploitation of graph structural information have been the focal points in the study of complex networks. Traditional structural measures in Network Science focus on the analysis and modelling of complex networks from the perspective of network structure, such as the centrality measures, the clustering coefficient, and motifs and graphlets, and they have become basic tools for studying and understanding graphs. In comparison, graph neural networks, especially graph convolutional networks (GCNs), are particularly effective at integrating node features into graph structures via neighbourhood aggregation and message passing, and have been shown to significantly improve the performances in a variety of learning tasks. These two classes of methods are, however, typically treated separately with limited references to each other. In this work, aiming to establish relationships between them, we provide a network science perspective of GCNs. Our novel taxonomy classifies GCNs from three structural information angles, i.e., the layer-wise message aggregation scope, the message content, and the overall learning scope. Moreover, as a prerequisite for reviewing GCNs via a network science perspective, we also summarise traditional structural measures and propose a new taxonomy for them. Finally and most importantly, we draw connections between traditional structural approaches and graph convolutional networks, and discuss potential directions for future research.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (141)
  1. Computing graph neural networks: A survey from algorithms to accelerators. ACM Computing Surveys (CSUR) 54, 9 (2021), 1–38.
  2. Alexandre H Abdo and APS de Moura. 2006. Clustering as a measure of the local topology of networks. arXiv preprint physics/0605235 (2006).
  3. Mixhop: Higher-order graph convolutional architectures via sparsified neighborhood mixing. In international conference on machine learning. PMLR, 21–29.
  4. Sara Ahajjam and Hassan Badir. 2018. Identification of influential spreaders in complex networks using HybridRank algorithm. Scientific reports 8, 1 (2018), 1–10.
  5. Missing link prediction using common neighbor and centrality based parameterized algorithm. Scientific reports 10, 1 (2020), 1–9.
  6. Sebastian E Ahnert and Thomas MA Fink. 2008. Clustering signatures classify directed networks. Physical Review E (2008).
  7. K-path centrality: A new centrality measure in social networks. In Proceedings of the 4th workshop on social network systems. 1–6.
  8. Understanding of a convolutional neural network. In 2017 international conference on engineering and technology (ICET). Ieee, 1–6.
  9. Non-backtracking PageRank: from the classic model to Hashimoto matrices. Chaos, Solitons & Fractals 126 (2019), 283–291.
  10. Centrality measures in networks based on nodes attributes, long-range interactions and group influence. Long-Range Interactions and Group Influence (2016).
  11. Extending the applicability of graphlets to directed networks. IEEE/ACM transactions on computational biology and bioinformatics 14, 6 (2016), 1302–1315.
  12. Joonhyun Bae and Sangwook Kim. 2014. Identifying and ranking influential spreaders in complex networks by neighborhood coreness. Physica A: Statistical Mechanics and its Applications 395 (2014), 549–559.
  13. Albert-László Barabási et al. 2016. Network science. Cambridge university press.
  14. Graph Neural Networks with Local Graph Parameters. arXiv preprint arXiv:2106.06707 (2021).
  15. The architecture of complex weighted networks. PNAS (2004).
  16. Identifying influential spreaders in complex multilayer networks: A centrality perspective. IEEE Transactions on Network Science and Engineering 6, 1 (2017), 31–45.
  17. Multilayer motif analysis of brain networks. Chaos: An Interdisciplinary Journal of Nonlinear Science 27, 4 (2017), 047404.
  18. Transportation network analysis. (1997).
  19. Node classification in social networks. In Social network data analytics. Springer.
  20. Ginestra Bianconi. 2018. Multilayer networks: structure and function. Oxford university press.
  21. Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment 2008, 10 (2008), P10008.
  22. The structure and dynamics of multilayer networks. Physics reports 544, 1 (2014), 1–122.
  23. Phillip Bonacich. 1972. Factoring and weighting approaches to status scores and clique identification. Journal of mathematical sociology 2, 1 (1972), 113–120.
  24. Phillip Bonacich. 1987. Power and centrality: A family of measures. American journal of sociology 92, 5 (1987), 1170–1182.
  25. Phillip Bonacich and Paulette Lloyd. 2001. Eigenvector-like measures of centrality for asymmetric relations. Social networks 23, 3 (2001), 191–201.
  26. Stephen P Borgatti and Martin G Everett. 2006. A graph-theoretic perspective on centrality. Social networks 28, 4 (2006), 466–484.
  27. Improving graph neural network expressivity via subgraph isomorphism counting. arXiv preprint arXiv:2006.09252 (2020).
  28. Ulrik Brandes. 2008. On variants of shortest-path betweenness centrality and their generic computation. Social networks 30, 2 (2008), 136–145.
  29. The use of actor-level attributes and centrality measures to identify key actors: A case study of an Australian drug trafficking network. Journal of contemporary criminal justice 31, 3 (2015), 262–278.
  30. Sergey Brin and Lawrence Page. 1998. The anatomy of a large-scale hypertextual web search engine. Computer networks and ISDN systems 30, 1-7 (1998), 107–117.
  31. A degree centrality in multi-layered social network. In 2011 International Conference on Computational Aspects of Social Networks (CASoN). IEEE, 237–242.
  32. Geometric deep learning: going beyond euclidean data. IEEE Signal Processing Magazine 34, 4 (2017), 18–42.
  33. Is the clustering coefficient a measure for fault tolerance in wireless sensor networks?. In 2012 IEEE International Conference on Communications (ICC). IEEE, 183–187.
  34. Structure of cycles and local ordering in complex networks. The European Physical Journal B 38, 2 (2004), 183–186.
  35. A new weighted degree centrality measure: The application in an animal disease epidemic. PloS one 11, 11 (2016), e0165781.
  36. Grarep: Learning graph representations with global structural information. In Proceedings of the 24th ACM international on conference on information and knowledge management. 891–900.
  37. A model of Internet topology using k-shell decomposition. Proceedings of the National Academy of Sciences 104, 27 (2007), 11150–11154.
  38. Automatic resource compilation by analyzing hyperlink structure and associated text. Computer networks and ISDN systems 30, 1-7 (1998), 65–74.
  39. Machine learning on graphs: A model and comprehensive taxonomy. arXiv preprint arXiv:2005.03675 (2020), 1.
  40. Identifying influential nodes in complex networks. Physica a: Statistical mechanics and its applications 391, 4 (2012), 1777–1787.
  41. Identifying influential nodes in large-scale directed networks: the role of clustering. PloS one 8, 10 (2013), e77455.
  42. Jun Chen and Haopeng Chen. 2021. Edge-featured graph attention network. arXiv preprint arXiv:2101.07671 (2021).
  43. Fastgcn: fast learning with graph convolutional networks via importance sampling. arXiv preprint arXiv:1801.10247 (2018).
  44. 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. 257–266.
  45. Jonathan Cohen. 2008. Trusses: Cohesive subgraphs for social network analysis. National security agency technical report 16, 3.1 (2008).
  46. Giulio Costantini and Marco Perugini. 2014. Generalization of clustering coefficients to signed correlation networks. PloS one (2014).
  47. Study on centrality measures in social networks: a survey. Social network analysis and mining 8, 1 (2018), 1–11.
  48. Mathematical formulation of multilayer networks. Physical Review X 3, 4 (2013), 041022.
  49. Centrality in interconnected multilayer networks. arXiv preprint arXiv:1311.2906 (2013).
  50. Ranking in interconnected multilayer networks reveals versatile nodes. Nature communications 6, 1 (2015), 1–6.
  51. A novel measure of edge centrality in social networks. Knowledge-based systems 30 (2012), 136–150.
  52. Convolutional neural networks on graphs with fast localized spectral filtering. Advances in neural information processing systems 29 (2016).
  53. A generalized co-hits algorithm and its application to bipartite graphs. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. 239–248.
  54. Graphlets in multiplex networks. Scientific reports 10, 1 (2020), 1–13.
  55. Investigating the topology of interacting networks. The European Physical Journal B 84, 4 (2011), 635–651.
  56. Complex networks in climate dynamics. The European Physical Journal Special Topics 174, 1 (2009), 157–179.
  57. Christina Durón. 2020. Heatmap centrality: A new measure to identify super-spreader nodes in scale-free networks. Plos one 15, 7 (2020), e0235690.
  58. Leo Egghe. 2006. Theory and practise of the g-index. Scientometrics 69, 1 (2006), 131–152.
  59. Victor M Eguiluz and Konstantin Klemm. 2002. Epidemic threshold in structured scale-free networks. Physical Review Letters 89, 10 (2002), 108701.
  60. Communicability betweenness in complex networks. Physica A: Statistical Mechanics and its Applications 388, 5 (2009), 764–774.
  61. Ernesto Estrada and Juan A Rodriguez-Velazquez. 2005. Subgraph centrality in complex networks. Physical Review E 71, 5 (2005), 056103.
  62. Giorgio Fagiolo. 2007. Clustering in complex directed networks. Physical Review E (2007).
  63. Lester Randolph Ford and Delbert Ray Fulkerson. 2015. Flows in networks. Princeton university press.
  64. Linton C Freeman. 1977. A set of measures of centrality based on betweenness. Sociometry (1977), 35–41.
  65. Linton C Freeman. 1978. Centrality in social networks conceptual clarification. Social networks 1, 3 (1978), 215–239.
  66. Centrality in valued graphs: A measure of betweenness based on network flow. Social networks 13, 2 (1991), 141–154.
  67. Higher order clustering coefficients in Barabási–Albert networks. Physica A: Statistical Mechanics and its Applications (2002).
  68. Large-scale learnable graph convolutional networks. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 1416–1424.
  69. Ranking the spreading ability of nodes in complex networks based on local structure. Physica A: Statistical Mechanics and its Applications 403 (2014), 130–147.
  70. Michelle Girvan and Mark EJ Newman. 2002. Community structure in social and biological networks. PNAS (2002).
  71. David F Gleich. 2015. PageRank beyond the web. Siam Review 57, 3 (2015), 321–363.
  72. Liyu Gong and Qiang Cheng. 2019. Exploiting edge features for graph neural networks. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. 9211–9219.
  73. Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In KDD.
  74. Recent advances in convolutional neural networks. Pattern recognition 77 (2018), 354–377.
  75. From homogeneous to heterogeneous network alignment via colored graphlets. Scientific reports 8, 1 (2018), 1–16.
  76. Closeness centrality for similarity-weight network and its application to measuring industrial sectors’ position on the Global Value Chain. Physica A: Statistical Mechanics and its Applications 541 (2020), 123337.
  77. Multiplex pagerank. PloS one 8, 10 (2013), e78293.
  78. Inductive representation learning on large graphs. In Proceedings of the 31st International Conference on Neural Information Processing Systems. 1025–1035.
  79. Representation learning on graphs: Methods and applications. arXiv preprint arXiv:1709.05584 (2017).
  80. Ki-ichiro Hashimoto. 1989. Zeta functions of finite graphs and representations of p-adic groups. In Automorphic forms and geometry of arithmetic varieties. Elsevier, 211–280.
  81. Jorge E Hirsch. 2005. An index to quantify an individual’s scientific research output. Proceedings of the National academy of Sciences 102, 46 (2005), 16569–16572.
  82. Tomaž Hočevar and Janez Demšar. 2016. Computation of graphlet orbits for nodes and edges in sparse graphs. Journal of Statistical Software 71 (2016), 1–24.
  83. It’s not all about autism: The emerging landscape of anti-vaccination sentiment on Facebook. Vaccine 37, 16 (2019), 2216–2223.
  84. Petter Holme and Jari Saramäki. 2012. Temporal networks. Physics reports 519, 3 (2012), 97–125.
  85. Global diversity of microbial communities in marine sediment. Proceedings of the national academy of sciences 117, 44 (2020), 27587–27597.
  86. Open graph benchmark: Datasets for machine learning on graphs. Advances in neural information processing systems 33 (2020), 22118–22133.
  87. A quad motifs index for directed link prediction. IEEE Access 7 (2019), 159527–159534.
  88. Kexin Huang and Marinka Zitnik. 2020. Graph meta learning via local subgraphs. Advances in Neural Information Processing Systems 33 (2020).
  89. Adaptive sampling towards fast graph representation learning. arXiv preprint arXiv:1809.05343 (2018).
  90. Graphs in molecular biology. BMC bioinformatics 8, 6 (2007), 1–14.
  91. Exploring the structure and function of temporal networks with dynamic graphlets. Bioinformatics 31, 12 (2015), i171–i180.
  92. The economic consequences of social-network structure. Journal of Economic Literature 55, 1 (2017), 49–95.
  93. Analysing Ego-Networks via Typed-Edge Graphlets: A Case Study of Chronic Pain Patients. In International Conference on Complex Networks and Their Applications. Springer, 514–526.
  94. Closure Coefficient in Complex Directed Networks. In International Conference on Complex Networks and Their Applications. Springer, 62–74.
  95. Directed closure coefficient and its patterns. Plos one 16, 6 (2021), e0253822.
  96. Measuring Quadrangle Formation in Complex Networks. IEEE Transactions on Network Science and Engineering (2021).
  97. Encoding edge type information in graphlets. PloS one 17, 8 (2022), e0273609.
  98. Controllability of multilayer networks. Asian Journal of Control (2021).
  99. Co-embedding of nodes and edges with graph neural networks. IEEE Transactions on Pattern Analysis and Machine Intelligence (2020).
  100. GraLSP: Graph neural networks with local structural patterns. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 34. 4361–4368.
  101. Rethinking knowledge graph propagation for zero-shot learning. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. 11487–11496.
  102. Leo Katz. 1953. A new status index derived from sociometric analysis. Psychometrika (1953).
  103. Hyoungshick Kim and Ross Anderson. 2012. Temporal node centrality in complex networks. Physical Review E 85, 2 (2012), 026107.
  104. Centrality prediction in dynamic human contact networks. Computer Networks 56, 3 (2012), 983–996.
  105. Thomas N Kipf and Max Welling. 2016a. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016).
  106. Thomas N Kipf and Max Welling. 2016b. Variational graph auto-encoders. arXiv preprint arXiv:1611.07308 (2016).
  107. Identification of influential spreaders in complex networks. Nature physics 6, 11 (2010), 888–893.
  108. Multilayer networks. Journal of complex networks 2, 3 (2014), 203–271.
  109. Jon M Kleinberg et al. 1998. Authoritative sources in a hyperlinked environment.. In SODA, Vol. 98. Citeseer, 668–677.
  110. Lobby index in networks. Physica A: Statistical Mechanics and its Applications 388, 11 (2009), 2221–2226.
  111. Network-based prediction of protein interactions. Nature communications 10, 1 (2019), 1–8.
  112. Temporal motifs in time-dependent networks. Journal of Statistical Mechanics: Theory and Experiment 2011, 11 (2011), P11005.
  113. Michael Krivelevich and Benny Sudakov. 2003. The largest eigenvalue of sparse random graphs. Combinatorics, Probability and Computing 12, 1 (2003), 61–72.
  114. Spectral redemption in clustering sparse networks. Proceedings of the National Academy of Sciences 110, 52 (2013), 20935–20940.
  115. The slashdot zoo: mining a social network with negative edges. In WWW.
  116. United neighborhood closeness centrality and orthology for predicting essential proteins. IEEE/ACM transactions on computational biology and bioinformatics 17, 4 (2018), 1451–1458.
  117. Distance encoding: Design provably more powerful neural networks for graph representation learning. arXiv preprint arXiv:2009.00142 (2020).
  118. Deeper insights into graph convolutional networks for semi-supervised learning. In Thirty-Second AAAI conference on artificial intelligence.
  119. Identifying influential spreaders by weighted LeaderRank. Physica A: Statistical Mechanics and its Applications 404 (2014), 47–55.
  120. A survey of convolutional neural networks: analysis, applications, and prospects. IEEE transactions on neural networks and learning systems (2021).
  121. Identifying influential spreaders by gravity model. Scientific reports 9, 1 (2019), 1–7.
  122. Ranking in evolving complex networks. Physics Reports 689 (2017), 1–54.
  123. David Liben-Nowell and Jon Kleinberg. 2007. The link-prediction problem for social networks. Journal of the American society for information science and technology (2007).
  124. Cycles and clustering in bipartite networks. Physical review E (2005).
  125. Leveraging local h-index to identify and rank influential spreaders in networks. Physica A: Statistical Mechanics and its Applications 512 (2018), 379–391.
  126. Zhiyuan Liu and Jie Zhou. 2020. Introduction to graph neural networks. Synthesis Lectures on Artificial Intelligence and Machine Learning 14, 2 (2020), 1–127.
  127. Vital nodes identification in complex networks. Physics Reports 650 (2016), 1–63.
  128. Similarity index based on local paths for link prediction of complex networks. Physical Review E 80, 4 (2009), 046122.
  129. Leaders in social networks, the delicious case. PloS one 6, 6 (2011), e21202.
  130. The H-index of a network node and its relation to degree and coreness. Nature communications 7, 1 (2016), 1–7.
  131. Identifying influential spreaders in complex networks based on gravity formula. Physica A: Statistical Mechanics and its Applications 451 (2016), 205–212.
  132. Qian Ma and Jun Ma. 2017. Identifying and ranking influential spreaders in complex networks with consideration of spreading probability. Physica A: Statistical Mechanics and its Applications 465 (2017), 312–330.
  133. Xiaoke Ma and Lin Gao. 2012. Biological network analysis: insights into structure and functions. Briefings in functional genomics 11, 6 (2012), 434–442.
  134. Xiaojian Ma and Yinghong Ma. 2019. The local triangle structure centrality method to rank nodes in networks. Complexity 2019 (2019).
  135. Yao Ma and Jiliang Tang. 2021. Deep learning on graphs. Cambridge University Press.
  136. An Empirical Evaluation of Network Representation Learning Methods. Big Data (2022).
  137. Localization and centrality in networks. Physical review E 90, 5 (2014), 052808.
  138. A survey of link prediction in complex networks. ACM computing surveys (CSUR) 49, 4 (2016), 1–33.
  139. Silvio Micali and Zeyuan Allen Zhu. 2016. Reconstructing markov processes from independent and anonymous experiments. Discrete Applied Mathematics 200 (2016), 108–122.
  140. Tijana Milenković and Nataša Pržulj. 2008. Uncovering biological network function via graphlet degree signatures. Cancer informatics 6 (2008), CIN–S680.
  141. Superfamilies of evolved and designed networks. Science 303, 5663 (2004), 1538–1542.
Citations (6)

Summary

We haven't generated a summary for this paper yet.