The paper investigates how graph neural networks can quickly estimate the loss of algebraic connectivity after multiple road-link disruptions, comparing learned corrections to first‑order Fiedler sensitivity with analytical baselines. Experiments on synthetic failures and real OpenStreetMap data across six countries show that residual GCN and GraphSAGE models reduce mean absolute error for spatial and targeted failures, while second‑order perturbation offers minimal improvement. The study also demonstrates that sparse scaling allows the approach to scale to 20,000 nodes and that the spectral residual acts as a domain‑sensitive inductive bias for connectivity screening.
arXiv:2607. 21607v1 Announce Type: cross Abstract: Graph Neural Networks propagate information through local message passing, but the graph topologies themselves can silently prevent any amount of training from solving long-range tasks.
arXiv:2608. 14177v1 Announce Type: cross Abstract: Deep spatiotemporal models integrating graph convolutions and attention mechanisms have demonstrated excellent performance in network-level traffic flow prediction, owing to their exceptional ability to capture complex spatiotemporal dependencies.
arXiv:2608. 13171v1 Announce Type: cross Abstract: To avoid missing important variables and their connections in networks, more and more variables are included in network analysis.
Scaffold is a new unsupervised graph sparsification framework for graph neural networks that uses support graph theory preconditioners to jointly control dilation and congestion, thereby preserving short communication paths while avoiding bottlenecks. It achieves superior aggregate ranking across 19 homophilic and heterophilic benchmarks, recovering or closely approaching full‑graph GNN performance with only 10%–50% of the original edges. The method reduces memory usage to less than half and cuts end‑to‑end training time, including sparsification overhead.
arXiv:2606. 16580v1 Announce Type: new Abstract: Top-soil organic carbon (SOC) prediction is fundamental to agricultural sustainability, land use policy and fertilization planning.
arXiv:2607. 29293v1 Announce Type: new Abstract: Accurate fault location is critical for distribution network reliability.
arXiv:2609.35917v1 Announce Type: new Abstract: Graph neural networks are increasingly applied to road-level crash prediction, but the stability of their reported gains has received little scrutiny....
The paper introduces Explainable Graph-theoretical Machine Learning (XGML) to build individual metabolic brain graphs from FDG-PET data and identify subgraphs predictive of multivariate Alzheimer’s disease outcomes. Using ADNI data, the best model—kernel density estimation with Hellinger distance and random forest—achieved a Pearson correlation of 0.595 across eight cognitive scores, with the highest performance on ADAS13, ADAS11, and ADASQ4. Key edges were found to be jointly but differentially predictive, indicating potential network biomarkers for cognitive decline, though external validation on OASIS3 showed weaker performance likely due to cohort differences.
arXiv:2606. 01283v1 Announce Type: new Abstract: Modeling spatial dependencies is central to spatiotemporal data analysis using Graph Neural Networks (GNNs).
arXiv:2605. 15231v2 Announce Type: replace Abstract: Nonlinear finite element crash simulations are accurate but computationally expensive, limiting their use in iterative design optimisation.
arXiv:2607. 22381v1 Announce Type: new Abstract: Curvature notions on graphs, particularly Ollivier-Ricci and Forman, have emerged as powerful tools for addressing fundamental issues in Graph Neural Networks (GNNs) such as oversmoothing and oversquashing, but rely almost exclusively on local edge-level comparisons and therefore fail to certify how information actually propagates over long distances.
arXiv:2607. 19270v1 Announce Type: cross Abstract: The Traffic Assignment Problem is a fundamental but computationally expensive component of transportation planning.