Can You Hear Me Now? A Benchmark for Long-Range Graph Propagation
Luca Miglior, Matteo Tolloso, Alessio Gravina, Davide Bacciu
Abstract
Effectively capturing long-range interactions remains a fundamental yet unresolved challenge in graph neural network (GNN) research, critical for applications across diverse fields of science. To systematically address this, we introduce ECHO (Evaluating Communication over long HOps), a novel benchmark specifically designed to rigorously assess the capabilities of GNNs in handling very long-range graph propagation. ECHO includes three synthetic graph tasks, namely single-source shortest paths, node eccentricity, and graph diameter, each constructed over diverse and structurally challenging topologies intentionally designed to introduce significant information bottlenecks. ECHO also includes two real-world datasets, ECHO-Charge and ECHO-Energy, which define chemically grounded benchmarks for predicting atomic partial charges and molecular total energies, respectively, with reference computations obtained at the density functional theory (DFT) level. Both tasks inherently depend on capturing complex long-range molecular interactions. Our extensive benchmarking of popular GNN architectures reveals clear performance gaps, emphasizing the difficulty of true long-range propagation and highlighting design choices capable of overcoming inherent limitations. ECHO thereby sets a new standard for evaluating long-range information propagation, also providing a compelling example for its need in AI for science.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 8a9985f3-4f4f-423d-9f3c-57c2fd2161abCited by top-tier papers1
Ask how each one uses itBuilds on30
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong et al.NeurIPS 2020 · 3,935 citations
- Simple and Deep Graph Convolutional NetworksMing Chen, Zhewei Wei, Zengfeng Huang, Bolin Ding et al.ICML 2020 · 1,910 citations
- Strategies for Pre-training Graph Neural NetworksWeihua Hu, Bowen Liu, Joseph Gomes, Marinka Zitnik et al.ICLR 2020 · 1,744 citations
- Recipe for a General, Powerful, Scalable Graph TransformerLadislav Rampásek, Michael Galkin, Vijay Prakash Dwivedi, Anh Tuan Luu et al.NeurIPS 2022 · 1,216 citations
- Principal Neighbourhood Aggregation for Graph NetsGabriele Corso, Luca Cavalleri, Dominique Beaini, Pietro Liò et al.NeurIPS 2020 · 914 citations
Related papers
- On Measuring Long-Range Interactions in Graph Neural NetworksJacob Bamberger, Benjamin Gutteridge, Scott le Roux, Michael M. Bronstein et al.ICML 2025
- SONAR: Long-Range Graph Propagation Through Information WavesAlessandro Trenta, Alessio Gravina, Davide BacciuNeurIPS 2025 · 5 citations
- Neural Atoms: Propagating Long-range Interaction in Molecular Graphs through Efficient Communication ChannelXuan Li, Zhanke Zhou, Jiangchao Yao, Yu Rong et al.ICLR 2024 · 13 citations
- GLoRa: A Benchmark to Evaluate the Ability to Learn Long-Range Dependencies in GraphsDongzhuoran Zhou, Evgeny Kharlamov, Egor V. KostylevICLR 2025
- TIDE: Time Derivative Diffusion for Deep Learning on GraphsMaysam Behmanesh, Maximilian Krahn, Maks OvsjanikovICML 2023 · 19 citations
