{"total":23,"rows":[{"id":"2212.09034","title":"Graph Neural Networks are Inherently Good Generalizers: Insights by Bridging GNNs and MLPs","created":"2022-12-18","cited_by_count":42,"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":"2401.09125","title":"Understanding Heterophily for Graph Neural Networks","created":"2024-01-17","cited_by_count":15,"area":null},{"id":"2211.10890","title":"Single-Pass Contrastive Learning Can Work for Both Homophilic and Heterophilic Graph","created":"2022-11-20","cited_by_count":14,"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":"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":"2306.13926","title":"Quantifying the Optimization and Generalization Advantages of Graph Neural Networks Over Multilayer Perceptrons","created":"2023-06-24","cited_by_count":12,"area":null},{"id":"2409.17386","title":"Beyond Redundancy: Information-aware Unsupervised Multiplex Graph Structure Learning","created":"2024-09-25","cited_by_count":12,"area":null},{"id":"2402.04621","title":"Feature Distribution on Graph Topology Mediates the Effect of Graph Convolution: Homophily Perspective","created":"2024-02-07","cited_by_count":9,"area":null},{"id":"2310.07430","title":"Non-backtracking Graph Neural Networks","created":"2023-10-11","cited_by_count":7,"area":null},{"id":"2505.20853","title":"Cooperation of Experts: Fusing Heterogeneous Information with Large Margin","created":"2025-05-27","cited_by_count":6,"area":null},{"id":"2211.03231","title":"A Spectral Analysis of Graph Neural Networks on Dense and Sparse Graphs","created":"2022-11-06","cited_by_count":5,"area":null},{"id":"2205.10403","title":"Tackling Provably Hard Representative Selection via Graph Neural Networks","created":"2022-05-20","cited_by_count":2,"area":null},{"id":"2306.06845","title":"Information-Theoretic Limits and Strong Consistency on Binary Non-uniform Hypergraph Stochastic Block Models","created":"2023-06-12","cited_by_count":2,"area":null},{"id":"2310.10953","title":"A Local Graph Limits Perspective on Sampling-Based GNNs","created":"2023-10-17","cited_by_count":2,"area":null},{"id":"2405.13987","title":"Analysis of Corrected Graph Convolutions","created":"2024-05-22","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":"2409.06998","title":"Mixture of Scope Experts at Test: Generalizing Deeper Graph Neural Networks with Shallow Variants","created":"2024-09-11","cited_by_count":1,"area":null},{"id":"2310.00183","title":"On the Equivalence of Graph Convolution and Mixup","created":"2023-09-29","cited_by_count":0,"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":"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":"2606.23572","title":"A Spectral Theory of Normalized Corrected GNN Propagation","created":"2026-06-22","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}