The spectral residual is characterized as a useful but domain-sensitive inductive bias for structural connectivity screening, andarse scaling extends to 20,000 nodes and separates one-time spectral setup from amortized screening cost.
Abstract
Rapid evaluation of many simultaneous road-link disruptions requires a practical compromise between exact spectral recomputation and local approximation. We estimate relative algebraic-connectivity loss after multi-edge deletion using graph neural networks (GNNs) that learn a bounded correction to a first-order Fiedler sensitivity. The study considers independent, spatially clustered, and edge-betweenness-targeted failures, with graph-disjoint synthetic splits and zero-shot transfer to 13 OpenStreetMap (OSM) areas in six countries. GCN, GraphSAGE, and edge-aware MPNN backbones are compared with analytical baselines. In expanded OSM tests, residual GCN improves spatial-failure MAE by 0.0391 (95% hierarchical interval 0.0151-0.0662), while residual GraphSAGE improves targeted-failure MAE by 0.0257 (0.0095-0.0446). Second-order perturbation improves first-order MAE by only 0.0028-0.0053. Correction slopes decrease under targeted transfer, indicating residual shrinkage around systematic prior error. Leave-one-country-out OSM-to-OSM transfer is mixed: residual GCN improves targeted-failure MAE by 0.0622 (0.0169-0.1153) but worsens the spatial point estimate. Sparse scaling extends to 20,000 nodes and separates one-time spectral setup from amortized screening cost. These results characterize the spectral residual as a useful but domain-sensitive inductive bias for structural connectivity screening. Code, cached networks, and reproducibility artifacts are archived at doi:10.5281/zenodo.22307723.
This study develops a framework for preserving network-wide traffic information while reconstructing flow and density at unobserved links and the macroscopic fundamental diagram, enabling a broad range of sensor budgets in large-scale networks without strict limits on the number of sensors.
Ying Zhang, F. Fakhrmoosavi, Arash E. Zaghi· 0 citations
A deeply fused GraphSAGE-GRU cell that embeds independent inductive GraphSAGE(SAmple and aggreGatE) encoders directly into each GRU gate, enabling simultaneous spatio-temporal feature extraction at every time step while remaining topology-agnostic.
Xuran Chen· Poster Volume 0008 The 2026...· 0 citations
Topology-Aware Dynamic Reweighting (TAR+), a model-agnostic framework for node classification under strict graph distribution shifts and related robustness stressors, is proposed, supporting the broad applicability of topology-aware reweighting across heterogeneous graph learning conditions.
Jia-Xing Li, Jia-Shuo Liu, Wei-Huang Zheng et al.· IEEE Transactions on Pattern...· 0 citations
DynaSTar is proposed, a Dynamic Spatio-Temporal Graph Invariant Learning model designed for reliable out-of-time (OOT) traffic prediction under evolving topologies, which employs a dynamic probabilistic graph structure, which is continuously refined through momentum-based updates and differentiable sparse sampling to m...
Xinyan Hao, Huai-Yu Wan, S. Guo et al.· Proceedings of the Thirty-Fi...· 0 citations
Experiments on PeMS03, PeMS04, and PeMS08 show that CausalST achieves the lowest MAPE among all compared methods while remaining competitive in MAE and RMSE, and ablation results reveal non-additive interactions between directed weighting and delayed aggregation.
Sparsifying large road-network graphs by removing a fraction of their edges is a common way to reduce storage and accelerate spatial queries, but the choice of which edges to remove can quietly degrade the network that remains. We compare three edge-importance criteria for deciding what to prune, namely uniform random...
Jian-Ru Shen· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduNov 17, 2026
By studying the computational foundations of language learning, Associate Professor Jacob Andreas builds intelligent systems that can communicate effectively with humans.
Microsoft Research Blog· microsoft.comNov 16, 2026
AI coding agents are increasingly help developers fix bugs and build features largely on their own, but every interaction with their models consumes tokens. In each session, an agent sends instructions, tool descriptions, and session history to its model. Most efforts to reduce this cost focus on individual tasks. Yet developers return to the same […] The post TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduNov 13, 2026