When does a spectral prior help graph learning? Connectivity-loss estimation under road-network disruptions

• URL: http://arxiv.org/abs/2609.11166v1
• Date: Thu, 10 Sep 2026 07:12:22 GMT
• Title: When does a spectral prior help graph learning? Connectivity-loss estimation under road-network disruptions
• Abstract summary: We estimate relative algebraic-connectivity loss after multi-edge deletion using graph neural networks (GNNs)<n>GCN, GraphSAGE, and edge-aware MPNN backbones are compared with analytical baselines.<n>Results characterize the spectral residual as a useful but domain-sensitive inductive bias for structural connectivity screening.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• ShiftSplit-AD: Separating Domain Shift from Defects in Foundation-Feature Visual Anomaly Detection [0.0]
  We investigate whether structured decomposition of nearest-normal DINOv2 residuals can suppress shift-induced evidence.<n>ShiftSplit-AD decomposes the patch residual matrix into low-rank and row-sparse components.<n>Experiments expose a central trade-off rather than a universal separation.
  arXiv  Detail & Related papers  (2026-08-27T18:42:38Z)
• Continuity-Driven Representation Learning for Industrial Defect Detection [10.126273003671388]
  Industrial defect detection differs from natural-image object detection because inspection images contain large normal-dominant regions with repetitive structures.<n>We propose a continuity-driven representation regularization framework that exploits normal-dominant regions as dense auxiliary supervision.
  arXiv  Detail & Related papers  (2026-08-18T04:31:55Z)
• Kohn-Sham Spectral Embedding on Sparse Graphs at the Nishimori Temperature for Image Classification [0.0]
  Kohn-Sham Spectral Embedding (KSSE)<n>An energy-based model replacing the top-layer of convolutional networks with a sparse-graph spectral embedding at the Nishimori temperature of an associated Random-Bond Ising Model.<n>On ImageNet-1000 with frozen EfficientNet-B4 features, KSSE achieves 88.93% Top-1 accuracy with 21.24M parameters-beating Swin-L (197M, 86.4-87.3%) and matching the lower end of ViT-H/14 (632M, 88.0-89.5%) with 10x and 30x fewer parameters.
  arXiv  Detail & Related papers  (2026-07-30T16:05:51Z)
• GeoID-PINN: Identifiability-Aware Regional Epidemic Inference with Geographic Coupling [1.0875426095207128]
  We introduce a physics-informed neural network (PINN) for susceptible-infectious-recovered-deceased dynamics.<n>We regularize a spatial prior constructed from distance, adjacency, commuting, or lead-lag information.<n>Relative to an autoregressive negative-binomial baseline, Forecast-Trained Geo-PINN reduces mean squared error (MSE) from 32,957 to 11,468 and mean absolute error (MAE) from 70.60 to 57.73.
  arXiv  Detail & Related papers  (2026-07-28T05:59:23Z)
• Unified Geometry-Guided ML-FTLE for Tracking Transient Chaos from Scalar Time Series [0.0]
  We propose a geometry-guided machine learning framework that unifies predictive trajectory divergence with macroscopic attractor morphology to track abrupt regime shifts.<n>This equation-free framework provides a highly accurate, noise-resilient diagnostic for monitoring structural transitions in complex non-stationary systems.
  arXiv  Detail & Related papers  (2026-06-05T15:22:57Z)
• Learning Higher-Order Structure from Incomplete Spatiotemporal Data: Multi-Scale Hypergraph Laplacians with Neural Refinement [26.873671102536438]
  Sensor networks govern modern infrastructure, yet the data they lose are rarely missing in the uniform-random patterns assumed by standard imputation benchmarks.<n>We introduce Multi-Scale Hypergraph Laplacians, a framework for learning higher-order structure from incomplete observations.<n>We prove that MSHL represents group-conservation patterns inaccessible to pairwise graph priors, adapts to the best fixed scale up to a logarithmic factor, and admits a one-sided refinement guarantee.
  arXiv  Detail & Related papers  (2026-05-17T08:15:16Z)
• Monitoring Neural Training with Topology: A Footprint-Predictable Collapse Index [51.56484100374058]
  We propose an online, topology-aware monitor for evolving neural representations that couples Modular Morse Homology Maintenance (MMHM) with a composite Collapse Index (CI)<n>Instead of rebuilding complexes each epoch, we apply sparse edits at a fixed scale and maintain a discrete Morse matching, yielding fast, incremental updates.
  arXiv  Detail & Related papers  (2026-04-28T19:21:21Z)
• Generalizing GNNs with Tokenized Mixture of Experts [75.8310720413187]
  We show that improving stability requires reducing reliance on shift-sensitive features, leaving an irreducible worst-case generalization floor.<n>We propose STEM-GNN, a pretrain-then-finetune framework with a mixture-of-experts encoder for diverse computation paths.<n>Across nine node, link, and graph benchmarks, STEM-GNN achieves a stronger three-way balance, improving robustness to degree/homophily shifts and to feature/edge corruptions while remaining competitive on clean graphs.
  arXiv  Detail & Related papers  (2026-02-09T22:48:30Z)
• Learning Wireless Interference Patterns: Decoupled GNN for Throughput Prediction in Heterogeneous Multi-Hop p-CSMA Networks [4.303580795892996]
  Decoupled Graph Convolutional Network (D-GCN) is a novel architecture that explicitly separates processing of a node's own transmission probability from neighbor interference effects.<n>D-GCN attains 3.3% NMAE, outperforms strong baselines, remains tractable even when exact analytical methods become computationally infeasible.
  arXiv  Detail & Related papers  (2025-10-15T22:13:59Z)
• Decentralized Nonconvex Composite Federated Learning with Gradient Tracking and Momentum [78.27945336558987]
  Decentralized server (DFL) eliminates reliance on client-client architecture.<n>Non-smooth regularization is often incorporated into machine learning tasks.<n>We propose a novel novel DNCFL algorithm to solve these problems.
  arXiv  Detail & Related papers  (2025-04-17T08:32:25Z)
• Point Cloud Denoising With Fine-Granularity Dynamic Graph Convolutional Networks [58.050130177241186]
  Noise perturbations often corrupt 3-D point clouds, hindering downstream tasks such as surface reconstruction, rendering, and further processing. This paper introduces finegranularity dynamic graph convolutional networks called GDGCN, a novel approach to denoising in 3-D point clouds.
  arXiv  Detail & Related papers  (2024-11-21T14:19:32Z)
• Towards Communication-efficient Federated Learning via Sparse and Aligned Adaptive Optimization [90.08459757321405]
  Federated Adam (FedAdam) algorithms suffer from a threefold increase in uplink communication overhead.<n>We propose a novel sparse FedAdam algorithm called FedAdam-SSM, wherein distributed devices sparsify the updates local model parameters and moment estimates.<n>By minimizing the divergence bound between the model trained by FedAdam-SSM and centralized Adam, we optimize the SSM to mitigate the learning performance degradation caused by sparsification error.
  arXiv  Detail & Related papers  (2024-05-28T07:56:49Z)
• Mixed Graph Contrastive Network for Semi-Supervised Node Classification [63.924129159538076]
  We propose a novel graph contrastive learning method, termed Mixed Graph Contrastive Network (MGCN)<n>In our method, we improve the discriminative capability of the latent embeddings by an unperturbed augmentation strategy and a correlation reduction mechanism.<n>By combining the two settings, we extract rich supervision information from both the abundant nodes and the rare yet valuable labeled nodes for discriminative representation learning.
  arXiv  Detail & Related papers  (2022-06-06T14:26:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.