{"total":201,"rows":[{"id":"2205.12454","title":"Recipe for a General, Powerful, Scalable Graph Transformer","created":"2022-05-25","cited_by_count":713,"area":null},{"id":"2110.07875","title":"Graph Neural Networks with Learnable Structural and Positional Representations","created":"2021-10-15","cited_by_count":333,"area":null},{"id":"2102.09544","title":"Combinatorial optimization and reasoning with graph neural networks","created":"2021-02-18","cited_by_count":268,"area":null},{"id":"2205.11172","title":"How Powerful are Spectral Graph Neural Networks","created":"2022-05-23","cited_by_count":169,"area":null},{"id":"2110.03336","title":"Frame Averaging for Invariant and Equivariant Network Design","created":"2021-10-07","cited_by_count":168,"area":null},{"id":"2110.03753","title":"From Stars to Subgraphs: Uplifting Any GNN with Local Structure Awareness","created":"2021-10-07","cited_by_count":155,"area":null},{"id":"2110.02910","title":"Equivariant Subgraph Aggregation Networks","created":"2021-10-06","cited_by_count":154,"area":null},{"id":"2305.17589","title":"Graph Inductive Biases in Transformers without Message Passing","created":"2023-05-27","cited_by_count":153,"area":null},{"id":"2110.13197","title":"Nested Graph Neural Networks","created":"2021-10-25","cited_by_count":137,"area":null},{"id":"2306.02896","title":"Representational Strengths and Limitations of Transformers","created":"2023-06-05","cited_by_count":133,"area":null},{"id":"2101.11859","title":"Interpreting and Unifying Graph Neural Networks with An Optimization Framework","created":"2021-01-28","cited_by_count":131,"area":null},{"id":"2106.06610","title":"Scalars are universal: Equivariant machine learning, structured like classical physics","created":"2021-06-11","cited_by_count":127,"area":null},{"id":"2111.06283","title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","created":"2021-11-11","cited_by_count":118,"area":null},{"id":"2205.12156","title":"Not too little, not too much: a theoretical analysis of graph (over)smoothing","created":"2022-05-24","cited_by_count":106,"area":null},{"id":"2212.13350","title":"A Generalization of ViT/MLP-Mixer to Graphs","created":"2022-12-27","cited_by_count":93,"area":null},{"id":"2205.13328","title":"How Powerful are K-hop Message Passing Graph Neural Networks","created":"2022-05-26","cited_by_count":90,"area":null},{"id":"2301.08210","title":"Everything is Connected: Graph Neural Networks","created":"2023-01-19","cited_by_count":85,"area":null},{"id":"2402.09268","title":"Transformers, parallel computation, and logarithmic depth","created":"2024-02-14","cited_by_count":79,"area":null},{"id":"2112.03806","title":"OOD-GNN: Out-of-Distribution Generalized Graph Neural Network","created":"2021-12-07","cited_by_count":78,"area":null},{"id":"2102.06966","title":"Graph Convolution for Semi-Supervised Classification: Improved Linear Separability and Out-of-Distribution Generalization","created":"2021-02-13","cited_by_count":70,"area":null},{"id":"2405.18512","title":"Understanding Transformer Reasoning Capabilities via Graph Algorithms","created":"2024-05-28","cited_by_count":67,"area":"lr"},{"id":"2203.04810","title":"Benchmarking Graphormer on Large-Scale Molecular Modeling Datasets","created":"2022-03-09","cited_by_count":64,"area":null},{"id":"2204.07697","title":"Theory of Graph Neural Networks: Representation and Learning","created":"2022-04-16","cited_by_count":61,"area":null},{"id":"2110.15174","title":"On Provable Benefits of Depth in Training Graph Convolutional Networks","created":"2021-10-28","cited_by_count":58,"area":null},{"id":"2209.15059","title":"Provably expressive temporal graph networks","created":"2022-09-29","cited_by_count":56,"area":null},{"id":"2210.13978","title":"Boosting the Cycle Counting Power of Graph Neural Networks with I$^2$-GNNs","created":"2022-10-22","cited_by_count":56,"area":null},{"id":"2306.03589","title":"How does over-squashing affect the power of GNNs?","created":"2023-06-06","cited_by_count":53,"area":null},{"id":"2106.06707","title":"Graph Neural Networks with Local Graph Parameters","created":"2021-06-12","cited_by_count":52,"area":null},{"id":"2201.07083","title":"A Short Tutorial on The Weisfeiler-Lehman Test And Its Variants","created":"2022-01-18","cited_by_count":52,"area":null},{"id":"2201.12884","title":"A Theoretical Comparison of Graph Neural Network Extensions","created":"2022-01-30","cited_by_count":48,"area":null},{"id":"2202.11097","title":"Message passing all the way up","created":"2022-02-22","cited_by_count":47,"area":null},{"id":"2203.10800","title":"Graph Neural Networks for Wireless Communications: From Theory to Practice","created":"2022-03-21","cited_by_count":46,"area":null},{"id":"2206.01003","title":"Shortest Path Networks for Graph Property Prediction","created":"2022-06-02","cited_by_count":46,"area":null},{"id":"2101.08543","title":"Boost then Convolve: Gradient Boosting Meets Graph Neural Networks","created":"2021-01-21","cited_by_count":44,"area":null},{"id":"2103.04886","title":"Lipschitz Normalization for Self-Attention Layers with Application to Graph Neural Networks","created":"2021-03-08","cited_by_count":39,"area":null},{"id":"2110.14363","title":"VQ-GNN: A Universal Framework to Scale up Graph Neural Networks using Vector Quantization","created":"2021-10-27","cited_by_count":39,"area":null},{"id":"2111.07337","title":"$p$-Laplacian Based Graph Neural Networks","created":"2021-11-14","cited_by_count":39,"area":null},{"id":"2209.12288","title":"On Representing Linear Programs by Graph Neural Networks","created":"2022-09-25","cited_by_count":39,"area":null},{"id":"2111.04964","title":"On Representation Knowledge Distillation for Graph Neural Networks","created":"2021-11-09","cited_by_count":38,"area":"distill"},{"id":"2302.11556","title":"Equivariant Polynomials for Graph Neural Networks","created":"2023-02-22","cited_by_count":38,"area":null},{"id":"2207.07888","title":"SizeShiftReg: a Regularization Method for Improving Size-Generalization in Graph Neural Networks","created":"2022-07-16","cited_by_count":37,"area":null},{"id":"2310.01267","title":"Cooperative Graph Neural Networks","created":"2023-10-02","cited_by_count":36,"area":null},{"id":"2505.10960","title":"Relational Graph Transformer","created":"2025-05-16","cited_by_count":34,"area":null},{"id":"2205.15674","title":"Generalised Implicit Neural Representations","created":"2022-05-31","cited_by_count":31,"area":null},{"id":"2402.01107","title":"Simulation of Graph Algorithms with Looped Transformers","created":"2024-02-02","cited_by_count":30,"area":null},{"id":"2410.05298","title":"How Do Large Language Models Understand Graph Patterns? A Benchmark for Graph Pattern Comprehension","created":"2024-10-04","cited_by_count":30,"area":null},{"id":"2109.12144","title":"Spatial Aggregation and Temporal Convolution Networks for Real-time Kriging","created":"2021-09-24","cited_by_count":27,"area":null},{"id":"2306.11586","title":"Provably Powerful Graph Neural Networks for Directed Multigraphs","created":"2023-06-20","cited_by_count":27,"area":null},{"id":"2308.08235","title":"The Expressive Power of Graph Neural Networks: A Survey","created":"2023-08-16","cited_by_count":27,"area":null},{"id":"2105.13099","title":"On the Universality of Graph Neural Networks on Large Random Graphs","created":"2021-05-27","cited_by_count":26,"area":null},{"id":"2310.02156","title":"Probabilistically Rewired Message-Passing Neural Networks","created":"2023-10-03","cited_by_count":26,"area":null},{"id":"2202.13060","title":"Graph Attention Retrospective","created":"2022-02-26","cited_by_count":24,"area":null},{"id":"2502.01122","title":"Learning Efficient Positional Encodings with Graph Neural Networks","created":"2025-02-03","cited_by_count":24,"area":null},{"id":"2210.10759","title":"On Representing Mixed-Integer Linear Programs by Graph Neural Networks","created":"2022-10-19","cited_by_count":23,"area":null},{"id":"2311.06152","title":"Going beyond persistent homology using persistent homology","created":"2023-11-10","cited_by_count":22,"area":null},{"id":"2211.03232","title":"Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks","created":"2022-11-06","cited_by_count":21,"area":null},{"id":"2310.18716","title":"Laplacian Canonization: A Minimalist Approach to Sign and Basis Invariant Spectral Embedding","created":"2023-10-28","cited_by_count":21,"area":null},{"id":"2112.03328","title":"Learning Connectivity with Graph Convolutional Networks for Skeleton-based Action Recognition","created":"2021-12-06","cited_by_count":20,"area":null},{"id":"2205.15733","title":"Template based Graph Neural Network with Optimal Transport Distances","created":"2022-05-31","cited_by_count":20,"area":null},{"id":"2210.09521","title":"A Practical, Progressively-Expressive GNN","created":"2022-10-18","cited_by_count":20,"area":null},{"id":"2107.10234","title":"Bridging the Gap between Spatial and Spectral Domains: A Unified Framework for Graph Neural Networks","created":"2021-07-21","cited_by_count":19,"area":null},{"id":"2207.11311","title":"Understanding Non-linearity in Graph Neural Networks from the Bayesian-Inference Perspective","created":"2022-07-22","cited_by_count":19,"area":null},{"id":"2306.04495","title":"Limits, approximation and size transferability for GNNs on sparse graphs via graphops","created":"2023-06-07","cited_by_count":18,"area":null},{"id":"2501.18739","title":"Beyond Message Passing: Neural Graph Pattern Machine","created":"2025-01-30","cited_by_count":17,"area":null},{"id":"2101.10050","title":"Learning Parametrised Graph Shift Operators","created":"2021-01-25","cited_by_count":16,"area":null},{"id":"2108.10733","title":"Graph Neural Networks: Methods, Applications, and Opportunities","created":"2021-08-24","cited_by_count":16,"area":null},{"id":"2402.08595","title":"Homomorphism Counts for Graph Neural Networks: All About That Basis","created":"2024-02-13","cited_by_count":16,"area":null},{"id":"2202.10156","title":"1-WL Expressiveness Is (Almost) All You Need","created":"2022-02-21","cited_by_count":15,"area":null},{"id":"2205.14368","title":"Going Deeper into Permutation-Sensitive Graph Neural Networks","created":"2022-05-28","cited_by_count":15,"area":null},{"id":"2103.03113","title":"Towards Deepening Graph Neural Networks: A GNTK-based Optimization Perspective","created":"2021-03-03","cited_by_count":14,"area":null},{"id":"2405.13526","title":"Understanding Virtual Nodes: Oversquashing and Node Heterogeneity","created":"2024-05-22","cited_by_count":14,"area":null},{"id":"2206.11010","title":"Agent-based Graph Neural Networks","created":"2022-06-22","cited_by_count":13,"area":null},{"id":"2208.06975","title":"Rethinking Graph Neural Networks for the Graph Coloring Problem","created":"2022-08-15","cited_by_count":13,"area":null},{"id":"2306.15632","title":"Asynchronous Algorithmic Alignment with Cocycles","created":"2023-06-27","cited_by_count":13,"area":null},{"id":"2311.14864","title":"Effective Structural Encodings via Local Curvature Profiles","created":"2023-11-24","cited_by_count":13,"area":null},{"id":"2401.01869","title":"On the hardness of learning under symmetries","created":"2024-01-03","cited_by_count":13,"area":null},{"id":"2407.01214","title":"Revisiting Random Walks for Learning on Graphs","created":"2024-07-01","cited_by_count":13,"area":null},{"id":"2210.03990","title":"Weisfeiler-Lehman goes Dynamic: An Analysis of the Expressive Power of Graph Neural Networks for Attributed and Dynamic Graphs","created":"2022-10-08","cited_by_count":12,"area":null},{"id":"2211.16494","title":"On the Ability of Graph Neural Networks to Model Interactions Between Vertices","created":"2022-11-29","cited_by_count":12,"area":null},{"id":"2305.14814","title":"What functions can Graph Neural Networks compute on random graphs? The role of Positional Encoding","created":"2023-05-24","cited_by_count":12,"area":null},{"id":"2309.12253","title":"SALSA-CLRS: A Sparse and Scalable Benchmark for Algorithmic Reasoning","created":"2023-09-21","cited_by_count":12,"area":null},{"id":"2402.07099","title":"Rethinking the Capacity of Graph Neural Networks for Branching Strategy","created":"2024-02-11","cited_by_count":12,"area":null},{"id":"2205.09833","title":"Learning Interface Conditions in Domain Decomposition Solvers","created":"2022-05-19","cited_by_count":11,"area":null},{"id":"2307.01180","title":"PlanE: Representation Learning over Planar Graphs","created":"2023-07-03","cited_by_count":11,"area":null},{"id":"2310.00526","title":"Are Graph Neural Networks Optimal Approximation Algorithms?","created":"2023-10-01","cited_by_count":11,"area":null},{"id":"2408.00165","title":"Non-convolutional Graph Neural Networks","created":"2024-07-31","cited_by_count":11,"area":null},{"id":"2503.01805","title":"Depth-Width tradeoffs in Algorithmic Reasoning of Graph Tasks with Transformers","created":"2025-03-03","cited_by_count":11,"area":null},{"id":"2503.19173","title":"Graph neural networks extrapolate out-of-distribution for shortest paths","created":"2025-03-24","cited_by_count":11,"area":null},{"id":"2107.01952","title":"Partition and Code: learning how to compress graphs","created":"2021-07-05","cited_by_count":10,"area":null},{"id":"2306.07735","title":"Discrete Graph Auto-Encoder","created":"2023-06-13","cited_by_count":10,"area":null},{"id":"2106.08992","title":"On the approximation capability of GNNs in node classification/regression tasks","created":"2021-06-16","cited_by_count":9,"area":null},{"id":"2206.05070","title":"Fundamental Limits in Formal Verification of Message-Passing Neural Networks","created":"2022-06-10","cited_by_count":9,"area":null},{"id":"2406.19244","title":"Improving the Expressiveness of $K$-hop Message-Passing GNNs by Injecting Contextualized Substructure Information","created":"2024-06-27","cited_by_count":9,"area":null},{"id":"2202.13185","title":"Domain Knowledge-Based Automated Analog Circuit Design with Deep Reinforcement Learning","created":"2022-02-26","cited_by_count":7,"area":null},{"id":"2301.13060","title":"Zero-One Laws of Graph Neural Networks","created":"2023-01-30","cited_by_count":7,"area":null},{"id":"2312.11862","title":"Topo-MLP : A Simplicial Network Without Message Passing","created":"2023-12-19","cited_by_count":7,"area":null},{"id":"2410.18676","title":"Homomorphism Counts as Structural Encodings for Graph Learning","created":"2024-10-24","cited_by_count":7,"area":null},{"id":"2201.08481","title":"Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling","created":"2022-01-20","cited_by_count":6,"area":null},{"id":"2205.13234","title":"DT+GNN: A Fully Explainable Graph Neural Network using Decision Trees","created":"2022-05-26","cited_by_count":6,"area":null},{"id":"2212.04934","title":"Learning Graph Algorithms With Recurrent Graph Neural Networks","created":"2022-12-09","cited_by_count":6,"area":null}],"next_cursor":"100"}