{"total":23,"rows":[{"id":"2212.10701","title":"A Non-Asymptotic Analysis of Oversmoothing in Graph Neural Networks","created":"2022-12-21","cited_by_count":49,"area":null},{"id":"2305.16102","title":"Demystifying Oversmoothing in Attention-Based Graph Neural Networks","created":"2023-05-25","cited_by_count":49,"area":null},{"id":"2306.01323","title":"Demystifying Structural Disparity in Graph Neural Networks: Can One Size Fit All?","created":"2023-06-02","cited_by_count":41,"area":null},{"id":"2204.09297","title":"Effects of Graph Convolutions in Multi-layer Networks","created":"2022-04-20","cited_by_count":24,"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":"2305.00851","title":"Revisiting Robustness in Graph Machine Learning","created":"2023-05-01","cited_by_count":19,"area":null},{"id":"2305.10391","title":"Optimality of Message-Passing Architectures for Sparse Graphs","created":"2023-05-17","cited_by_count":13,"area":null},{"id":"2406.07955","title":"How Interpretable Are Interpretable Graph Neural Networks?","created":"2024-06-12","cited_by_count":13,"area":null},{"id":"2211.11853","title":"Learnable Graph Convolutional Attention Networks","created":"2022-11-21","cited_by_count":8,"area":null},{"id":"2211.14425","title":"PatchGT: Transformer over Non-trainable Clusters for Learning Graph Representations","created":"2022-11-26","cited_by_count":8,"area":null},{"id":"2310.07430","title":"Non-backtracking Graph Neural Networks","created":"2023-10-11","cited_by_count":7,"area":null},{"id":"2210.10014","title":"On Classification Thresholds for Graph Attention with Edge Features","created":"2022-10-18","cited_by_count":5,"area":null},{"id":"2406.00418","title":"GATE: How to Keep Out Intrusive Neighbors","created":"2024-06-01","cited_by_count":5,"area":null},{"id":"2210.10946","title":"Causally-guided Regularization of Graph Attention Improves Generalizability","created":"2022-10-20","cited_by_count":3,"area":null},{"id":"2303.10140","title":"Geometric Deep Learning for Molecular Crystal Structure Prediction","created":"2023-03-17","cited_by_count":3,"area":null},{"id":"2405.13987","title":"Analysis of Corrected Graph Convolutions","created":"2024-05-22","cited_by_count":2,"area":null},{"id":"2412.08310","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","created":"2024-12-11","cited_by_count":2,"area":null},{"id":"2412.15496","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","created":"2024-12-20","cited_by_count":2,"area":null},{"id":"2310.07667","title":"Global Minima, Recoverability Thresholds, and Higher-Order Structure in GNNS","created":"2023-10-11","cited_by_count":0,"area":null},{"id":"2407.11615","title":"Graph Dimension Attention Networks for Enterprise Credit Assessment","created":"2024-07-16","cited_by_count":0,"area":null},{"id":"2412.13754","title":"Optimal Exact Recovery in Semi-Supervised Learning: A Study of Spectral Methods and Graph Convolutional Networks","created":"2024-12-18","cited_by_count":0,"area":null},{"id":"2605.25452","title":"Different Statistical Perspectives for Understanding Generalisation in Graph Neural Networks","created":"2026-05-25","cited_by_count":0,"area":null},{"id":"2607.16676","title":"The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy","created":"2026-07-18","cited_by_count":0,"area":null}],"next_cursor":null}