The DOI matches its Crossref record; 130 of the 130 references it cites were found in a registry or an index.
Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting
Open accessAbstract
While Graph Neural Networks (GNNs) have achieved remarkable results in a variety of applications, recent studies exposed important shortcomings in their ability to capture the structure of the underlying graph. It has been shown that the expressive power of standard GNNs is bounded by the Weisfeiler-Leman (WL) graph isomorphism test, from which they inherit proven limitations such as the inability to detect and count graph substructures. On the other hand, there is significant empirical evidence, e.g. in network science and bioinformatics, that substructures are often intimately related to downstream tasks. To this end, we propose "Graph Substructure Networks" (GSN), a topologically-aware message passing scheme based on substructure encoding. We theoretically analyse the expressive power of our architecture, showing that it is strictly more expressive than the WL test, and provide sufficient conditions for universality. Importantly, we do not attempt to adhere to the WL hierarchy; this allows us to retain multiple attractive properties of standard GNNs such as locality and linear network complexity, while being able to disambiguate even hard instances of graph isomorphism. We perform an extensive experimental evaluation on graph classification and regression tasks and obtain state-of-the-art results in diverse real-world settings including molecular graphs and social networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A. N., Kaiser, L., & Polosukhin, I. (2017) · arXiv · doi:10.48550/arxiv.1706.03762 · Cited by 120,404
Exploiting Generative AI to Scale up Intelligent Tutoring Systems
Jakubův, J., Chvalovský, K., Goertzel, Z., Kaliszyk, C., Olšák, M., Piotrowski, B., Schulz, S., Suda, M., & Urban, J. (2023) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.itp.2023.19 · Cited by 76,658
PyTorch: An Imperative Style, High-Performance Deep Learning Library
Paszke, A., Gross, S., Massa, F., Lerer, A., Bradbury, J., Chanan, G., Killeen, T., Lin, Z., Gimelshein, N., Antiga, L., et al. (2019) · arXiv · doi:10.48550/arxiv.1912.01703 · Cited by 31,473
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
Veličković, P., Cucurull, G., Casanova, A., Romero, A., Liò, P., & Bengio, Y. (2017) · arXiv · doi:10.48550/arxiv.1710.10903 · Cited by 12,107
Backpropagation Applied to Handwritten Zip Code Recognition
LeCun, Y., Boser, B., Denker, J. S., Henderson, D., Howard, R. E., Hubbard, W., & Jackel, L. D. (1989) · Neural Computation · doi:10.1162/neco.1989.1.4.541 · Cited by 11,891
Inductive Representation Learning on Large Graphs
Hamilton, W. L., Ying, R., & Leskovec, J. (2017) · arXiv · doi:10.48550/arxiv.1706.02216 · Cited by 10,639
The Strength of Weak Ties: A Network Theory Revisited
Granovetter, M. (1983) · Sociological Theory · doi:10.2307/202051 · Cited by 8,263
Extended-Connectivity Fingerprints
Rogers, D., & Hahn, M. (2010) · Journal of Chemical Information and Modeling · doi:10.1021/ci100050t · Cited by 7,524
Network motifs: simple building blocks of complex networks.
Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., & Alon, U. (2002) · Science · doi:10.1126/science.298.5594.824 · Cited by 7,368 · cited 2×
“For example, small substructures (graphlets) have been extensively analysed in protein-protein interaction networks [44], triangles and cliques characterise the structure of ego-nets and social networks in general [20], simple cycles (rings) are central in molecular distributions, directed and temporal motifs have bee…”
BackgroundModeling Relational Data with Graph Convolutional Networks
Schlichtkrull, M., Kipf, T. N., Bloem, P., van den Berg, R., Titov, I., & Welling, M. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-93417-4_38 · Cited by 5,570
Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks
Silva, G., Rodrigues, M., Teixeira, A., & Amorim, M. (2024) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.sea.2024.20 · Cited by 5,183
Graph Convolutional Neural Networks for Web-Scale Recommender Systems
Ying, R., He, R., Chen, K., Eksombatchai, P., Hamilton, W. L., & Leskovec, J. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3219890 · Cited by 3,733
Neural Message Passing for Quantum Chemistry
Gilmer, J., Schoenholz, S. S., Riley, P. F., Vinyals, O., & Dahl, G. E. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.01212 · Cited by 3,440
Formal Semantics for Kolmogorov-Arnold Network Representations of Operational Games
Zhukov, G. A. (2025) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.15206559 · Cited by 3,212
Transformer-XL: Attentive language models beyond a fixed-length context
Dai, Z., Yang, Z., Yang, Y., Carbonell, J., Le, Q., & Salakhutdinov, R. (2019) · Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/p19-1285 · Cited by 3,169
Automatic Chemical Design Using a Data-Driven Continuous Representation of Molecules
Gómez-Bombarelli, R., Wei, J. N., Duvenaud, D., Hernández-Lobato, J. M., Sánchez-Lengeling, B., Sheberla, D., Aguilera-Iparraguirre, J., Hirzel, T. D., Adams, R. P., & Aspuru-Guzik, A. (2018) · ACS Central Science · doi:10.1021/acscentsci.7b00572 · Cited by 3,106
Deeper Insights Into Graph Convolutional Networks for Semi-Supervised Learning
Li, Q., Han, Z., & Wu, X.-M. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11604 · Cited by 2,872
Convolutional Sequence to Sequence Learning
Gehring, J., Auli, M., Grangier, D., Yarats, D., & Dauphin, Y. N. (2017) · arXiv · doi:10.48550/arxiv.1705.03122 · Cited by 2,850 · cited 1×
“local patches in CNNs for images [29] or positional encodings in language models for sequential data [30], [31], [32].”
BackgroundZINC: A Free Tool to Discover Chemistry for Biology
Irwin, J. J., Sterling, T., Mysinger, M. M., Bolstad, E. S., & Coleman, R. G. (2012) · Journal of Chemical Information and Modeling · doi:10.1021/ci3001277 · Cited by 2,509
Self-Attention with Relative Position Representations
Shaw, P., Uszkoreit, J., & Vaswani, A. (2018) · Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 2 (Short Papers) · doi:10.18653/v1/n18-2074 · Cited by 2,505
An Algorithm for Subgraph Isomorphism
Ullmann, J. R. (1976) · Journal of the ACM · doi:10.1145/321921.321925 · Cited by 2,277
A collection of mathematical problems
Ulam, S. M. (1960) · Medical Entomology and Zoology · Cited by 2,262
The Complexity of Enumeration and Reliability Problems
Valiant, L. G. (1979) · SIAM Journal on Computing · doi:10.1137/0208032 · Cited by 2,076
Reoptimization of MDL Keys for Use in Drug Discovery
Durant, J. L., Leland, B. A., Henry, D. R., & Nourse, J. G. (2002) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci010132r · Cited by 1,862
Geometric Deep Learning on Graphs and Manifolds Using Mixture Model CNNs
Monti, F., Boscaini, D., Masci, J., Rodola, E., Svoboda, J., & Bronstein, M. M. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.576 · Cited by 1,820
Self-citationAutomatic Chemical Design Using a Data-Driven Continuous Representation of Molecules.
Gómez‐Bombarelli, R., Wei, J. N., Duvenaud, D., Hernández-Lobato, J. M., Sánchez-Lengeling, B., Sheberla, D., Aguilera‐Iparraguirre, J., Hirzel, T. D., Adams, R. P., & Aspuru‐Guzik, A. (2018) · Cambridge University Engineering Department Publications Database · doi:10.17863/cam.34134 · Cited by 1,703
Weisfeiler-Lehman Graph Kernels
Shervashidze, N., Schweitzer, P., van Leeuwen, E. J., Mehlhorn, K., & Borgwardt, K. M. (2010) · Max Planck Digital Library · Cited by 1,644
Neural Tangent Kernel: Convergence and Generalization in Neural Networks
Jacot, A., Gabriel, F., & Hongler, C. (2018) · arXiv · doi:10.48550/arxiv.1806.07572 · Cited by 1,562
A (sub)graph isomorphism algorithm for matching large graphs
Cordella, L. P., Foggia, P., Sansone, C., & Vento, M. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.75 · Cited by 1,477
An End-to-End Deep Learning Architecture for Graph Classification
Zhang, M., Cui, Z., Neumann, M., & Chen, Y. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11782 · Cited by 1,461
Sukhbaatar, S., Szlam, A., Weston, J., & Fergus, R. (2015) · arXiv · doi:10.48550/arxiv.1503.08895 · Cited by 1,345
Higher-order organization of complex networks
Benson, A. R., Gleich, D. F., & Leskovec, J. (2016) · Science · doi:10.1126/science.aad9029 · Cited by 1,270
Weisfeiler and Leman Go Neural: Higher-Order Graph Neural Networks
Morris, C., Ritzert, M., Fey, M., Hamilton, W. L., Lenssen, J. E., Rattan, G., & Grohe, M. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33014602 · Cited by 1,210
Fast Graph Representation Learning with PyTorch Geometric
Fey, M., & Lenssen, J. E. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.02428 · Cited by 1,132
Kuramochi, M., & Karypis, G. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989534 · Cited by 1,068
Yanardag, P., & Vishwanathan, S. V. N. (2015) · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2783258.2783417 · Cited by 1,021
Interaction Networks for Learning about Objects, Relations and Physics
Battaglia, P. W., Pascanu, R., Lai, M., Rezende, D., & Kavukcuoglu, K. (2016) · arXiv · doi:10.48550/arxiv.1612.00222 · Cited by 969 · cited 1×
“In particular, Graph Neural Networks (GNNs), a family of neural architectures designed for irregularly structured data, have been successfully applied to problems ranging from social networks and recommender systems [1] to bioinformatics [2], [3], chemistry [4], [5], [6] and physics [7], [8], to name a few.”
BackgroundDiffusion-Convolutional Neural Networks
Atwood, J. R., & Towsley, D. (2016) · neural information processing systems · Cited by 925
Surveying macrocyclic chemistry: from flexible crown ethers to rigid cyclophanes
Liu, Z., Nalluri, S. K. M., & Stoddart, J. F. (2017) · Chemical Society Reviews · doi:10.1039/c7cs00185a · Cited by 909
Representation Learning on Graphs with Jumping Knowledge Networks
Xu, K., Li, C., Tian, Y., Sonobe, T., Kawarabayashi, K., & Jegelka, S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1806.03536 · Cited by 891
On Graph Kernels: Hardness Results and Efficient Alternatives
Gärtner, T., Flach, P., & Wrobel, S. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45167-9_11 · Cited by 879
Locality in Distributed Graph Algorithms
Linial, N. (1992) · SIAM Journal on Computing · doi:10.1137/0221015 · Cited by 870
Congruent Graphs and the Connectivity of Graphs
Whitney, H. (1932) · American Journal of Mathematics · doi:10.2307/2371086 · Cited by 863
Biological network comparison using graphlet degree distribution
Pržulj, N. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btl301 · Cited by 837
Deciphering interaction fingerprints from protein molecular surfaces using geometric deep learning
Gainza, P., Sverrisson, F., Monti, F., Rodolà, E., Boscaini, D., Bronstein, M. M., & Correia, B. E. (2020) · Nature Methods · doi:10.1038/s41592-019-0666-6 · Cited by 834
Self-citationLiu, Z., & Zhou, J. (2020) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.1007/978-3-031-01587-8_7 · Cited by 806
Hierarchical Graph Representation Learning with Differentiable Pooling
Ying, R., You, J., Morris, C., Ren, X., Hamilton, W. L., & Leskovec, J. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1806.08804 · Cited by 798
Learning Convolutional Neural Networks for Graphs
Niepert, M., Ahmed, M. M., & Kutzkov, K. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.05273 · Cited by 775
FANMOD: a tool for fast network motif detection
Wernicke, S., & Rasche, F. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl038 · Cited by 745
Geodesic Convolutional Neural Networks on Riemannian Manifolds
Masci, J., Boscaini, D., Bronstein, M. M., & Vandergheynst, P. (2015) · 2015 IEEE International Conference on Computer Vision Workshop (ICCVW) · doi:10.1109/iccvw.2015.112 · Cited by 721 · cited 1×
“For instance, in geometric graphs, such as 3D molecular graphs and meshes, directional biases are usually employed in order to model the positional information of the vertices [9], [10], [11], [12], [13]; for proteins, ordering information is used to disambiguate amino-acids at different positions in the sequence [14]…”
BackgroundSelf-citationJunction Tree Variational Autoencoder for Molecular Graph Generation
Jin, W., Barzilay, R., & Jaakkola, T. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.04364 · Cited by 720
Modeling interactome: scale-free or geometric?
Pržulj, N., Corneil, D. G., & Jurisica, I. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth436 · Cited by 706
Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks
Wang, M., Zheng, D., Ye, Z., Gan, Q., Li, M., Song, X. H., Zhou, J., Ma, C., Yu, L., Gai, Y. L., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.01315 · Cited by 666
Generative models for graph-based protein design
Ingraham, J., Garg, V., Barzilay, R., & Jaakkola, T. (2019) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 662
A Convergence Theory for Deep Learning via Over-Parameterization
Allen-Zhu, Z., Li, Y., & Song, Z. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.03962 · Cited by 657
Efficient Graphlet Kernels for Large Graph Comparison
Sherashidze, N., Vishwanathan, S. V. N., Petri, T., Mehlhorn, K., & Borgwardt, K. M. (2009) · MPG.PuRe (Max Planck Society) · Cited by 644
Paranjape, A., Benson, A. R., & Leskovec, J. (2017) · Proceedings of the Tenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3018661.3018731 · Cited by 540
Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs
Kashtan, N., Itzkovitz, S., Milo, R., & Alon, U. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth163 · Cited by 537
Protein interface prediction using graph convolutional networks
Fout, A., Ben‐Hur, A., Anderson, C., Chitsaz, H., & Zhou, W. (2017) · Digital Collections of Colorado (Colorado State University) · doi:10.25675/3.021826 · Cited by 513
An optimal lower bound on the number of variables for graph identification
Cai, J.-Y., F�rer, M., & Immerman, N. (1992) · Combinatorica · doi:10.1007/bf01305232 · Cited by 502
Deep SetsPreprint
Zaheer, M., Kottur, S., Ravanbakhsh, S., Póczos, B., Salakhutdinov, R., & Smola, A. J. (2017) · arXiv (Cornell University) · Cited by 484
Diffusion-Convolutional Neural Networks
Atwood, J. R., & Towsley, D. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1511.02136 · Cited by 476
Neural Relational Inference for Interacting Systems
Kipf, T., Fetaya, E., Wang, K.-C. J., Welling, M., & Zemel, R. S. (2018) · UvA-DARE (University of Amsterdam) · Cited by 475
Local Structure in Social Networks
Holland, P. W., & Leinhardt, S. (1976) · Sociological Methodology · doi:10.2307/270703 · Cited by 439
Distance Encoding: Design Provably More Powerful Neural Networks for Graph Representation LearningPreprint
Li, P., Wang, Y., Wang, H., & Leskovec, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.00142 · Cited by 409
Efficient Detection of Network Motifs
Wernicke, S. (2006) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2006.51 · Cited by 402
Efficient Graphlet Kernels for Large Graph Comparison
Shervashidze, N., Vishwanathan, S. V. N., Petri, T. H., Mehlhorn, K., Borgwardt, K. M., Dyk, D. V., & Welling, M. (2009) · Cited by 394
Directional Message Passing for Molecular GraphsPreprint
Klicpera, J., Groß, J., & Günnemann, S. (2020) · arXiv (Cornell University) · Cited by 383
Frequent substructure-based approaches for classifying chemical compounds
Deshpande, M., Kuramochi, M., Wale, N., & Karypis, G. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.127 · Cited by 371
Invariant and Equivariant Graph NetworksPreprint
Maron, H., Ben-Hamu, H., Shamir, N., & Lipman, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.09902 · Cited by 336
Graph Neural Tangent Kernel: Fusing Graph Neural Networks with Graph KernelsPreprint
Du, S. S., Hou, K., Póczos, B., Salakhutdinov, R., Wang, R., & Xu, K. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.13192 · Cited by 335
Cyclic pattern kernels for predictive graph mining
Horváth, T., Gärtner, T., & Wrobel, S. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014072 · Cited by 308
Directional Message Passing for Molecular Graphs
Gasteiger, J., Groß, J., & Günnemann, S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.03123 · Cited by 301
Uncovering Biological Network Function via Graphlet Degree SignaturesPreprint
Milenković, T., & Pržulj, N. (2008) · Europe PMC (PubMed Central) · doi:10.48550/arxiv.0802.0556 · Cited by 295
Babai, L., Erdo˝s, P., & Selkow, S. M. (1980) · SIAM Journal on Computing · doi:10.1137/0209047 · Cited by 293
Random Features Strengthen Graph Neural Networks
Sato, R., Yamada, M., & Kashima, H. (2021) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611976700.38 · Cited by 285
Uncovering Biological Network Function via Graphlet Degree Signatures
Milenković, T., & Pržulj, N. (2008) · Cancer Informatics · doi:10.4137/cin.s680 · Cited by 278
A Survey on The Expressive Power of Graph Neural NetworksPreprint
Sato, R. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.04078 · Cited by 241
DeeperGCN: All You Need to Train Deeper GCNs
Li, G., Xiong, C., Thabet, A., & Ghanem, B. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.07739 · Cited by 239
Neural Relational Inference for Interacting Systems
Kipf, T., Fetaya, E., Wang, K.-C., Welling, M., & Zemel, R. S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.04687 · Cited by 235
Principal Neighbourhood Aggregation for Graph Nets
Corso, G., Cavalleri, L., Beaini, D., Lió, P., & Veličković, P. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.05718 · Cited by 230
Propagation kernels: efficient graph kernels from propagated information
Neumann, M., Garnett, R., Bauckhage, C., & Kersting, K. (2016) · Machine Learning · doi:10.1007/s10994-015-5517-9 · Cited by 229
Molecular feature mining in HIV data
Kramer, S., De Raedt, L., & Helma, C. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502533 · Cited by 226
Bresson, X., & Laurent, T. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1711.07553 · Cited by 224
Bouritsas, G., Bokhnyak, S., Ploumpis, S., Zafeiriou, S. P., & Bronstein, M. M. (2019) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00731 · Cited by 218
Self-citationA combinatorial approach to graphlet counting
Hočevar, T., & Demšar, J. (2014) · Bioinformatics · doi:10.1093/bioinformatics/btt717 · Cited by 214
Benchmarking Graph Neural Networks
Dwivedi, V. P., Joshi, C. K., Luu, A. T., Laurent, T., Bengio, Y., & Bresson, X. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.00982 · Cited by 211
Generalization and Representational Limits of Graph Neural NetworksPreprint
Garg, V., Jegelka, S., & Jaakkola, T. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.06157 · Cited by 209
Machine Learning for Scent: Learning Generalizable Perceptual Representations of Small MoleculesPreprint
Sánchez-Lengeling, B., Wei, J. N., Lee, B. K., Gerkin, R. C., Aspuru‐Guzik, A., & Wiltschko, A. B. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.10685 · Cited by 168
Fast Neighborhood Subgraph Pairwise Distance Kernel
Costa, F., & Grave, K. D. (2010) · Lirias · Cited by 167
GraphNorm: A Principled Approach to Accelerating Graph Neural Network TrainingPreprint
Cai, T., Luo, S., Xu, K., He, D., Liu, T., & Wang, L. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.03294 · Cited by 167
Universal Invariant and Equivariant Graph Neural NetworksPreprint
Keriven, N., & Gabriel Peyré, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.04943 · Cited by 165
Hunt For The Unique, Stable, Sparse And Fast Feature Learning On Graphs
Verma, S. M., & Zhang, Z. L. (2017) · neural information processing systems · Cited by 157
Covariant Compositional Networks For Learning GraphsPreprint
Kondor, R., Son, H. T., Pan, H., Anderson, B., & Trivedi, S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1801.02144 · Cited by 157
Anonymous Walk EmbeddingsPreprint
Ivanov, S., & Burnaev, E. V. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.11921 · Cited by 153
A Faster Algorithm for Detecting Network Motifs
Wernicke, S. (2005) · Lecture notes in computer science · doi:10.1007/11557067_14 · Cited by 144
Gauge Equivariant Mesh CNNs: Anisotropic convolutions on geometric graphsPreprint
de Haan, P., Weiler, M., Cohen, T., & Welling, M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.05425 · Cited by 141
Higher-order Network Representation Learning
Rossi, R. A., Ahmed, N. K., & Koh, E. (2018) · International World Wide Web Conference (WWW) · doi:10.1145/3184558.3186900 · Cited by 140
MOTIFNET: A MOTIF-BASED GRAPH CONVOLUTIONAL NETWORK FOR DIRECTED GRAPHS
Monti, F., Otness, K., & Bronstein, M. M. (2018) · IEEE Data Science Workshop (DSW) · doi:10.1109/dsw.2018.8439897 · Cited by 136
Self-citationWeisfeiler and Leman go sparse: Towards scalable higher-order graph embeddingsPreprint
Morris, C., Rattan, G., & Mutzel, P. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.01543 · Cited by 134
Graphlet-based Characterization of Directed Networks
Sarajlić, A., Malod‐Dognin, N., Yaveroğlu, Ö. N., & Pržulj, N. (2016) · Scientific Reports · doi:10.1038/srep35098 · Cited by 125
Graph Convolutional Networks with Motif-based Attention
Lee, J. B., Rossi, R. A., Kong, X., Kim, S., Koh, E., & Rao, A. B. (2019) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3357384.3357880 · Cited by 122
Neural Subgraph MatchingPreprint
Rex, Ying, Lou, Z., You, J., Wen, C., Canedo, A., & Leskovec, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.03092 · Cited by 118
Introducing VF3: A New Algorithm for Subgraph Isomorphism
Carletti, V., Foggia, P., Saggese, A., & Vento, M. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-58961-9_12 · Cited by 101
Coloring Graph Neural Networks for Node Disambiguation
Dasoulas, G., Santos, L. D., Scaman, K., & Virmaux, A. (2020) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2020/294 · Cited by 90
de Haan, P., Cohen, T., & Welling, M. (2020) · UvA-DARE (University of Amsterdam) · doi:10.48550/arxiv.2007.08349 · Cited by 90
The Weisfeiler-Lehman Method and Graph Isomorphism TestingPreprint
Douglas, B. L. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1101.5211 · Cited by 84
Chapter 11. Junction Tree Variational Autoencoder for Molecular Graph Generation
Jin, W., Barzilay, R., & Jaakkola, T. (2020) · RSC drug discovery/RSC drug discovery series · doi:10.1039/9781788016841-00228 · Cited by 79
Sankar, A., Zhang, X., & Chang, K. C. (2019) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1145/3341161.3342859 · Cited by 70
Hierarchical Inter-Message Passing for Learning on Molecular GraphsPreprint
Fey, M., Yuen, J.-G., & Weichert, F. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.12179 · Cited by 67
FLAG: Adversarial Data Augmentation for Graph Neural NetworksPreprint
Kong, K., Li, G., Ding, M., Wu, Z., Zhu, C., Ghanem, B., Taylor, G., & Goldstein, T. (2021) · arXiv (Cornell University) · Cited by 67
Beaini, D., Passaro, S., Létourneau, V., Hamilton, W. L., Corso, G., & Lió, P. (2021) · Cited by 64
A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs
McCreesh, C., & Prosser, P. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-23219-5_21 · Cited by 58
Neural message passing on high order paths
Flam-Shepherd, D., Wu, T., Friederich, P., & Aspuru‐Guzik, A. (2021) · Machine Learning Science and Technology · doi:10.1088/2632-2153/abf5b8 · Cited by 53
Houbraken, M., Demeyer, S., Michoel, T., Audenaert, P., Colle, D., & Pickavet, M. (2014) · PLoS ONE · doi:10.1371/journal.pone.0097896 · Cited by 50
A Persistent Weisfeiler–Lehman Procedure for Graph Classification
Rieck, B., Bock, C., & Borgwardt, K. M. (2019) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-b-000352231 · Cited by 48
Parameterized Hypercomplex Graph Neural Networks for Graph Classification
Le, T., Bertolini, M., Noé, F., & Clevert, D.-A. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-86365-4_17 · Cited by 45
On the Combinatorial Power of the Weisfeiler-Lehman Algorithm
Fürer, M. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-57586-5_22 · Cited by 38
Global Attention Improves Graph Networks GeneralizationPreprint
Puny, O., Ben-Hamu, H., & Lipman, Y. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.07846 · Cited by 37
motif2vec: Motif Aware Node Representation Learning for Heterogeneous Networks
Dareddy, M. R., Das, M., & Yang, H. (2019) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata47090.2019.9005670 · Cited by 34
HONE: Higher-Order Network EmbeddingsPreprint
Rossi, R. A., Ahmed, N. K., Koh, E., Kim, S., Rao, A., & Yadkori, Y. A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1801.09303 · Cited by 27
Distance Encoding -- Design Provably More Powerful GNNs for Structural Representation LearningPreprint
Li, P., Wang, Y., Wang, H., & Leskovec, J. (2020) · arXiv (Cornell University) · Cited by 19
Understanding Isomorphism Bias in Graph Data SetsPreprint
Ivanov, S., Sviridov, S., & Burnaev, E. V. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.12091 · Cited by 17
On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties
Arvind, V., Fuhlbrück, F., Köbler, J., & Verbitsky, O. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-25027-0_8 · Cited by 12
Graph Homomorphism ConvolutionPreprint
Nt, H., & Maehara, T. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.01214 · Cited by 10
From Graph Low-Rank Global Attention to 2-FWL Approximation.Preprint
Puny, O., Ben-Hamu, H., & Lipman, Y. (2020) · arXiv (Cornell University) · Cited by 8
NEAR: Neighborhood Edge AggregatoR for Graph Classification
Kim, C., Moon, H., & Hwang, H. J. (2022) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3506714 · Cited by 7
A Hierarchy of Graph Neural Networks Based on Learnable Local FeaturesPreprint
Li, M. L., Dong, M., Zhou, J., & Rush, A. M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.05256 · Cited by 7
Chen, T., Wang, Z., Li, L., Li, D., Li, Z., Chang, X., Bian, P., Liang, G., Wang, Q., & Xie, T. (2025) · Schloss Dagstuhl – Leibniz-Zentrum für Informatik · doi:10.4230/lipics.ecoop.2025.6
Cited by
A compact review of molecular property prediction with graph neural networks
Wieder, O., Kohlbacher, S., Kuenemann, M., Garon, A., Ducrot, P., Seidel, T., & Langer, T. (2020) · Drug Discovery Today: Technologies · doi:10.1016/j.ddtec.2020.11.009 · Cited by 522
A Realization-Theoretic Foundation for Fault Diagnosis, with Diagnosability Equivalence Predictions
Bronstein, M. M., Bruna, J., Cohen, T., & Veličković, P. (2021) · arXiv (Cornell University) · doi:10.4230/oasics.dx.2026.1 · Cited by 519
Self-citationCorso, G., Stark, H., Jegelka, S., Jaakkola, T., & Barzilay, R. (2024) · Nature Reviews Methods Primers · doi:10.1038/s43586-024-00294-7 · Cited by 454
A Comprehensive Survey on Deep Graph Representation Learning
Ju, W., Fang, Z., Gu, Y., Liu, Z., Long, Q., Qiao, Z., Qin, Y., Shen, J., Sun, F., Xiao, Z., et al. (2024) · Neural Networks · doi:10.1016/j.neunet.2024.106207 · Cited by 341
Topological Graph Neural Networks
Horn, M., De Brouwer, E., Moor, M., Moreau, Y., Rieck, B., & Borgwardt, K. (2021) · arXiv · doi:10.48550/arxiv.2102.07835 · Cited by 31
Metadata
- Authors
- Bouritsas, G., Frasca, F., Zafeiriou, S., & Bronstein, M. M.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2023-01-01
- Volume
- 45
- Issue
- 1
- Pages
- 657-668
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- 1939-3539
- OpenAlex
- W3035664258
- Cited by
- 309
- References
- 130
- FWCI
- 17.93
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.