Quantum percolation based dynamic propagation connectivity for critical-area identification in transport networks

• URL: http://arxiv.org/abs/2606.30242v1
• Date: Mon, 29 Jun 2026 12:52:47 GMT
• Title: Quantum percolation based dynamic propagation connectivity for critical-area identification in transport networks
• Abstract summary: 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.
• Score: 14.492101931546765
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Transport networks often lose functionality through gradual degradation in link operating conditions before topological disconnection occurs. Link-centred and binary percolation measures identify important facilities or connectivity failures, but they provide limited information on which spatial areas cause the largest loss of network-wide propagation capability. This paper develops a Dynamic Propagation Connectivity (DPC) metric based on quantum percolation for critical-area identification in transport networks. Time-varying link travel times are converted into continuous propagation strengths, which define a Hermitian propagation operator at each observation time. Candidate regions are then evaluated by a regional degradation experiment that measures the resulting loss of DPC. The method is applied to a benchmark Sioux Falls network and six Florida road networks during the post-Hurricane Irma disruption and recovery period, using 1,281 five-minute observation times. The benchmark confirms that the regional DPC score identifies a predefined structurally critical corridor. In the Florida networks, the identified critical areas differ from regions selected by link count, local degradation, edge betweenness, algebraic connectivity, and classical percolation. In Networks 1 to 4, DPC and classical percolation rankings have negative Spearman correlations, showing that continuous propagation degradation and binary fragmentation reveal different vulnerability patterns. Robustness tests under alternative travel time scaling, degradation strength, and grid size show stable results, with mean rank agreement between 0.84 and 0.96. The findings extend transport resilience analysis based on percolation from binary connectivity loss to continuous propagation degradation and provide a spatial diagnostic tool for regional monitoring, emergency planning, and recovery prioritisation.

Related papers

• On the Adversarial Robustness of Remote Sensing Semantic Change Detection [19.4097466391406]
  Semantic change detection (SCD) is a bitemporal dense-prediction task that jointly identifies changed regions and their semantic states before and after change.<n>We present a task-specific evaluation framework that separates output-side attack objectives from input-side temporal perturbation access.<n>Experiments show that final semantic-change predictions can be severely corrupted even when binary change localization remains comparatively stable.
  arXiv  Detail & Related papers  (2026-08-15T15:02:42Z)
• Quantum percolation theory for dynamic propagation connectivity of transport networks [2.519906683279153]
  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.
  arXiv  Detail & Related papers  (2026-06-29T12:32:23Z)
• Towards Fast GNN Surrogates for CO2 Migration in Complex Geological Formations [58.079925240809644]
  We propose an end-to-end graph neural surrogate tailored to CO$$ibility plume migration forecasting in geological storage.<n>The method is evaluated on the SPE11A benchmark, a well-known industry test case designed to assess CO$$ storage scenarios.<n>The proposed model produces competitive forecasts of gas saturation and liquid-phase density, with cumulative errors that remain moderate over extended forecasting horizons.
  arXiv  Detail & Related papers  (2026-06-15T18:19:17Z)
• Accelerating Robot Path Planning via Connectivity-Preserving Region Proposal Network [5.81838331663612]
  Mobile robot path planning methods are often constrained by vast search spaces, resulting in latency in samplingbased algorithms.<n>We present the Connectivity- Preserving Region Proposal Network (CP-RPN), a segmentationguided model designed to predict compact and topologically connected candidate regions.
  arXiv  Detail & Related papers  (2026-05-27T11:59:03Z)
• Conditional Entropy of Heat Diffusion on Temporal Networks [46.780047051996924]
  We extend the conditional entropy of heat diffusion from static graphs to temporal networks and study its properties.<n>We show that this quantity is monotone in time, yielding an information-theoretic analog of the second law of thermodynamics for inhomogeneous diffusion on temporal networks.<n>We then introduce a local version of conditional entropy, designed to probe diffusion over finite temporal windows, and show that it provides an informative signal for change-point detection in continuous-time temporal networks.
  arXiv  Detail & Related papers  (2026-05-15T10:47:44Z)
• Evaluating Temporal and Structural Anomaly Detection Paradigms for DDoS Traffic [0.046603287532620725]
  Unsupervised anomaly detection is widely used to detect Distributed Denial-of-Service (DDoS) attacks in cloud-native 5G networks.<n>Most studies assume a fixed traffic representation, either temporal or structural, without validating which feature space best matches the data.<n>We propose a lightweight decision framework that prioritizes temporal or structural features before training, using two diagnostics.
  arXiv  Detail & Related papers  (2026-04-17T12:59:48Z)
• Multiresolution Analysis and Statistical Thresholding on Dynamic Networks [49.09073800467438]
  ANIE (Adaptive Network Intensity Estimation) is a multi-resolution framework designed to automatically identify the time scales at which network structure evolves.<n>We show that ANIE adapts to the appropriate time resolution and is able to capture sharp structural changes while remaining robust to noise.
  arXiv  Detail & Related papers  (2025-06-01T22:55:55Z)
• 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)
• A Differential Smoothness-based Compact-Dynamic Graph Convolutional Network for Spatiotemporal Signal Recovery [9.369246678101048]
  This paper proposes a Compact-fold Con Graphal Network (CDCN) fortemporal signal recovery. Experiments on real-world datasets show that CDCN significantly outperforms the state-of-the-art models fortemporal signal recovery.
  arXiv  Detail & Related papers  (2024-08-06T06:42:53Z)
• Efficient Estimation for Longitudinal Networks via Adaptive Merging [21.62069959992736]
  We propose an efficient estimation framework for longitudinal network, leveraging strengths of adaptive network merging, tensor decomposition and point process. It merges neighboring sparse networks so as to enlarge the number of observed edges and reduce estimation variance. A projected descent algorithm is proposed to facilitate estimation, where upper bound of the estimation error in each iteration is established.
  arXiv  Detail & Related papers  (2022-11-15T03:17:11Z)
• Correlating sparse sensing for large-scale traffic speed estimation: A Laplacian-enhanced low-rank tensor kriging approach [76.45949280328838]
  We propose a Laplacian enhanced low-rank tensor (LETC) framework featuring both lowrankness and multi-temporal correlations for large-scale traffic speed kriging. We then design an efficient solution algorithm via several effective numeric techniques to scale up the proposed model to network-wide kriging.
  arXiv  Detail & Related papers  (2022-10-21T07:25:57Z)
• Spatio-temporal Modeling for Large-scale Vehicular Networks Using Graph Convolutional Networks [110.80088437391379]
  A graph-based framework called SMART is proposed to model and keep track of the statistics of vehicle-to-temporal (V2I) communication latency across a large geographical area. We develop a graph reconstruction-based approach using a graph convolutional network integrated with a deep Q-networks algorithm. Our results show that the proposed method can significantly improve both the accuracy and efficiency for modeling and the latency performance of large vehicular networks.
  arXiv  Detail & Related papers  (2021-03-13T06:56:29Z)

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.