Higher-order Network phenomena of cascading failures in resilient cities

• URL: http://arxiv.org/abs/2509.13808v1
• Date: Wed, 17 Sep 2025 08:22:12 GMT
• Title: Higher-order Network phenomena of cascading failures in resilient cities
• Authors: Jinghua Song, Yuan Wang, Zimo Yan,
• Abstract summary: We introduce a framework that confronts higher-order network theory with empirical evidence from a large-scale, real-world multimodal transport network.<n>Our findings confirm a fundamental duality: network integration enhances static robustness metrics but simultaneously creates the structural pathways for catastrophic cascades.<n>We provide strong evidence that metrics derived from the network's static blueprint-encompassing both conventional low-order centrality and novel higher-order structural analyses-are fundamentally disconnected from and thus poor predictors of a system's dynamic functional resilience.
• Score: 1.6858464664111417
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Modern urban resilience is threatened by cascading failures in multimodal transport networks, where localized shocks trigger widespread paralysis. Existing models, limited by their focus on pairwise interactions, often underestimate this systemic risk. To address this, we introduce a framework that confronts higher-order network theory with empirical evidence from a large-scale, real-world multimodal transport network. Our findings confirm a fundamental duality: network integration enhances static robustness metrics but simultaneously creates the structural pathways for catastrophic cascades. Crucially, we uncover the source of this paradox: a profound disconnect between static network structure and dynamic functional failure. We provide strong evidence that metrics derived from the network's static blueprint-encompassing both conventional low-order centrality and novel higher-order structural analyses-are fundamentally disconnected from and thus poor predictors of a system's dynamic functional resilience. This result highlights the inherent limitations of static analysis and underscores the need for a paradigm shift towards dynamic models to design and manage truly resilient urban systems.

Related papers

• PowerGrow: Feasible Co-Growth of Structures and Dynamics for Power Grid Synthesis [75.14189839277928]
  We present PowerGrow, a co-generative framework that significantly reduces computational overhead while maintaining operational validity.<n> Experiments across benchmark settings show that PowerGrow outperforms prior diffusion models in fidelity and diversity.<n>This demonstrates its ability to generate operationally valid and realistic power grid scenarios.
  arXiv  Detail & Related papers  (2025-08-29T01:47:27Z)
• Predicting Large-scale Urban Network Dynamics with Energy-informed Graph Neural Diffusion [51.198001060683296]
  Networked urban systems facilitate the flow of people, resources, and services.<n>Current models such as graph neural networks have shown promise but face a trade-off between efficacy and efficiency.<n>This paper addresses this trade-off by drawing inspiration from physical laws to inform essential model designs.
  arXiv  Detail & Related papers  (2025-07-31T01:24:01Z)
• Network Sparsity Unlocks the Scaling Potential of Deep Reinforcement Learning [57.3885832382455]
  We show that introducing static network sparsity alone can unlock further scaling potential beyond dense counterparts with state-of-the-art architectures.<n>Our analysis reveals that, in contrast to naively scaling up dense DRL networks, such sparse networks achieve both higher parameter efficiency for network expressivity.
  arXiv  Detail & Related papers  (2025-06-20T17:54:24Z)
• Causal Discovery in Dynamic Fading Wireless Networks [0.0]
  This paper addresses causal inference challenges in dynamic fading wireless environments by proposing a sequential regression-based algorithm.<n>We derive theoretical lower and upper bounds on the detection delay required to identify structural changes, explicitly quantifying their dependence on network size, noise variance, and fading severity.<n>Our findings provide rigorous theoretical insights and practical guidelines for designing robust online causal inference mechanisms to maintain network reliability under nonstationary wireless conditions.
  arXiv  Detail & Related papers  (2025-05-24T13:59:48Z)
• CaTs and DAGs: Integrating Directed Acyclic Graphs with Transformers and Fully-Connected Neural Networks for Causally Constrained Predictions [6.745494093127968]
  We introduce Causal Fully-Connected Neural Networks (CFCNs) and Causal Transformers (CaTs) CFCNs andCaTs operate under predefined causal constraints, as specified by a Directed Acyclic Graph (DAG) These models retain the powerful function approximation abilities of traditional neural networks while adhering to the underlying structural constraints.
  arXiv  Detail & Related papers  (2024-10-18T14:10:16Z)
• TDNetGen: Empowering Complex Network Resilience Prediction with Generative Augmentation of Topology and Dynamics [14.25304439234864]
  We introduce a novel resilience prediction framework for complex networks, designed to tackle this issue through generative data augmentation of network topology and dynamics. Experiment results on three network datasets demonstrate that our proposed framework TDNetGen can achieve high prediction accuracy up to 85%-95%.
  arXiv  Detail & Related papers  (2024-08-19T09:20:31Z)
• Disentangling the Causes of Plasticity Loss in Neural Networks [55.23250269007988]
  We show that loss of plasticity can be decomposed into multiple independent mechanisms. We show that a combination of layer normalization and weight decay is highly effective at maintaining plasticity in a variety of synthetic nonstationary learning tasks.
  arXiv  Detail & Related papers  (2024-02-29T00:02:33Z)
• Quantum-Inspired Analysis of Neural Network Vulnerabilities: The Role of Conjugate Variables in System Attacks [54.565579874913816]
  Neural networks demonstrate inherent vulnerability to small, non-random perturbations, emerging as adversarial attacks. A mathematical congruence manifests between this mechanism and the quantum physics' uncertainty principle, casting light on a hitherto unanticipated interdisciplinarity.
  arXiv  Detail & Related papers  (2024-02-16T02:11:27Z)
• Leveraging Low-Rank and Sparse Recurrent Connectivity for Robust Closed-Loop Control [63.310780486820796]
  We show how a parameterization of recurrent connectivity influences robustness in closed-loop settings. We find that closed-form continuous-time neural networks (CfCs) with fewer parameters can outperform their full-rank, fully-connected counterparts.
  arXiv  Detail & Related papers  (2023-10-05T21:44:18Z)
• Uncovering the Origins of Instability in Dynamical Systems: How Attention Mechanism Can Help? [0.0]
  We show that attention should be directed toward the collective behaviour of imbalanced structures and polarity-driven structural instabilities within the network. Our study provides a proof of concept to understand why perturbing some nodes of a network may cause dramatic changes in the network dynamics.
  arXiv  Detail & Related papers  (2022-12-19T17:16:41Z)
• Detecting structural perturbations from time series with deep learning [0.0]
  We present a graph neural network approach to infer structural perturbations from functional time series. We show our data-driven approach outperforms typical reconstruction methods. This work uncovers a practical avenue to study the resilience of real-world complex systems.
  arXiv  Detail & Related papers  (2020-06-09T13:08:40Z)
• Bridging Mode Connectivity in Loss Landscapes and Adversarial Robustness [97.67477497115163]
  We use mode connectivity to study the adversarial robustness of deep neural networks. Our experiments cover various types of adversarial attacks applied to different network architectures and datasets. Our results suggest that mode connectivity offers a holistic tool and practical means for evaluating and improving adversarial robustness.
  arXiv  Detail & Related papers  (2020-04-30T19:12:50Z)

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.