Quantum percolation theory for dynamic propagation connectivity of transport networks

• URL: http://arxiv.org/abs/2606.30218v1
• Date: Mon, 29 Jun 2026 12:32:23 GMT
• Title: Quantum percolation theory for dynamic propagation connectivity of transport networks
• Abstract summary: Connectivity degradation in transport networks under structural disturbance is a central problem in network resilience research.<n>Existing methods rely mainly on percolation theory and topological connectivity measures.<n>This paper introduces quantum percolation theory into transport network connectivity analysis.
• Score: 2.519906683279153
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Connectivity degradation in transport networks under structural disturbance is a central problem in network resilience research. Existing methods rely mainly on percolation theory and topological connectivity measures. They focus on whether paths exist and whether connected components fragment. These approaches cannot capture functional degradation where network topology remains intact but propagation ability has already declined substantially. This paper introduces quantum percolation theory into transport network connectivity analysis and proposes Dynamic Propagation Connectivity (DPC) as a new measure that characterises network propagation ability under disturbance. By mapping a transport network under disturbance into a propagation operator system, this paper establishes a spectral analysis framework for DPC and defines the time-averaged participation index as its core quantification. This paper provides a series of rigorous theoretical results. DPC remains constant under homogeneous disturbance and degrades under heterogeneous disturbance. This paper establishes a quantitative relationship between the degradation rate, the minimum eigenvalue spacing of the propagation operator, and heterogeneous deviation strength. This paper proves a separation theorem between DPC and algebraic connectivity. It derives an analytical expression for DPC and a second-order perturbation approximation on the ring graph. Numerical experiments on three transport benchmark networks verify all theoretical conclusions and confirm degradation monotonicity, separation from algebraic connectivity, and degradation amplification by network size. This paper provides a theoretical framework for transport network resilience assessment that goes beyond topological connectivity.

Related papers

• Connectivity--Interference Competition in Coherent Transport on Percolated Hierarchical Small-World Networks [0.0]
  Adding links generally improves classical transport by increasing the number of available paths.<n>We show that coherent quantum transport can display the opposite behavior.<n>Results provide a design principle for coherent transport in disordered photonic and quantum-network architectures.
  arXiv  Detail & Related papers  (2026-08-19T17:26:32Z)
• Multi-Criticality and RG Topology in the Charge-Kondo-Breakdown Scenario in the Cuprates [0.0]
  We study the charge-Kondo-breakdown scenario proposed for cuprate superconductors within the perspective of renormalization group (RG) topology.<n>By analyzing the coupled RG flow equations governing the effective low-energy theory, we determine the fixed-point structure, stability properties, and global organization of the flow.
  arXiv  Detail & Related papers  (2026-07-22T06:41:22Z)
• Quantum percolation based dynamic propagation connectivity for critical-area identification in transport networks [14.492101931546765]
  Link-centred and binary percolation measures identify important facilities or connectivity failures.<n>Time-varying link travel times are converted into continuous propagation strengths.<n>Candidate regions are then evaluated by a regional degradation experiment.
  arXiv  Detail & Related papers  (2026-06-29T12:52:47Z)
• The Inductive Bias of Convolutional Neural Networks: Locality and Weight Sharing Reshape Implicit Regularization [57.37943479039033]
  We study how architectural inductive bias reshapes the implicit regularization induced by the edge-of-stability phenomenon in gradient descent.<n>We show that locality and weight sharing fundamentally change this picture.
  arXiv  Detail & Related papers  (2026-03-05T04:50:51Z)
• On Evolution-Based Models for Experimentation Under Interference [7.262048441360133]
  We study an evolution-based approach that investigates how outcomes change across observation rounds in response to interventions.<n>We highlight causal message passing as an instantiation of this method in dense networks.<n>We discuss the limits of this approach, showing that strong temporal trends or endogenous interference can undermine identification.
  arXiv  Detail & Related papers  (2025-11-26T18:53:46Z)
• PAC-Bayesian Generalization Bounds for Graph Convolutional Networks on Inductive Node Classification [20.5924958759845]
  We present a PAC-Bayesian theoretical analysis of graph convolutional networks (GCNs) for inductive node classification.<n>We derive novel generalization bounds for one-layer GCNs that explicitly incorporate the effects of data dependency and non-stationarity.<n>We extend our analysis to two-layer GCNs, and reveal that it requires stronger assumptions on graph topology to guarantee convergence.
  arXiv  Detail & Related papers  (2025-09-08T12:10:54Z)
• 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)
• Topology-Aware Conformal Prediction for Stream Networks [68.02503121089633]
  We propose Spatio-Temporal Adaptive Conformal Inference (textttCISTA), a novel framework that integrates network topology and temporal dynamics into the conformal prediction framework.<n>Our results show that textttCISTA effectively balances prediction efficiency and coverage, outperforming existing conformal prediction methods for stream networks.
  arXiv  Detail & Related papers  (2025-03-06T21:21:15Z)
• Tight Stability, Convergence, and Robustness Bounds for Predictive Coding Networks [60.3634789164648]
  Energy-based learning algorithms, such as predictive coding (PC), have garnered significant attention in the machine learning community. We rigorously analyze the stability, robustness, and convergence of PC through the lens of dynamical systems theory.
  arXiv  Detail & Related papers  (2024-10-07T02:57:26Z)
• Towards Understanding Theoretical Advantages of Complex-Reaction Networks [77.34726150561087]
  We show that a class of functions can be approximated by a complex-reaction network using the number of parameters. For empirical risk minimization, our theoretical result shows that the critical point set of complex-reaction networks is a proper subset of that of real-valued networks.
  arXiv  Detail & Related papers  (2021-08-15T10:13:49Z)
• Localisation in quasiperiodic chains: a theory based on convergence of local propagators [68.8204255655161]
  We present a theory of localisation in quasiperiodic chains with nearest-neighbour hoppings, based on the convergence of local propagators. Analysing the convergence of these continued fractions, localisation or its absence can be determined, yielding in turn the critical points and mobility edges. Results are exemplified by analysing the theory for three quasiperiodic models covering a range of behaviour.
  arXiv  Detail & Related papers  (2021-02-18T16:19:52Z)
• A Convergence Theory Towards Practical Over-parameterized Deep Neural Networks [56.084798078072396]
  We take a step towards closing the gap between theory and practice by significantly improving the known theoretical bounds on both the network width and the convergence time. We show that convergence to a global minimum is guaranteed for networks with quadratic widths in the sample size and linear in their depth at a time logarithmic in both. Our analysis and convergence bounds are derived via the construction of a surrogate network with fixed activation patterns that can be transformed at any time to an equivalent ReLU network of a reasonable size.
  arXiv  Detail & Related papers  (2021-01-12T00:40:45Z)

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.