The impact of a network split on cascading failure processes

Cascading failure models are typically used to capture the phenomenon where failures possibly trigger further failures in succession, causing knock-on effects. In many networks this ultimately leads to a disintegrated network where the failure propagation continues independently across the various components. In order to gain insight in the impact of network splitting on cascading failure processes, we extend a well-established cascading failure model for which the number of failures obeys a power-law distribution. We assume that a single line failure immediately splits the network in two components, and examine its effect on the power-law exponent. The results provide valuable qualitative insights that are crucial first steps towards understanding more complex network splitting scenarios

Evolving concepts in staging and treatment of colorectal cancer

For localized colorectal cancer (CRC), lymph node metastases are the most powerful prognostic factor for disease specific and overall survival. In the first part of the thesis, we explore the prognostic role of lymph nodes in patients with stage I/II colon cancer. In these patients, nodal metastases are not detected with conventional pathological examination. Additional immunohistochemistry in the sentinel lymph node can reveal isolated tumour cells and micrometastasis. Studies in this thesis show that patients with micrometastasis have an increased risk of disease recurrence. Isolated tumour cells are not associated with worse prognosis. We also describe a positive correlation between lymph node size, lymph node harvest and prognosis. The second part of the thesis addresses several aspects of a multi-modality approach in the treatment of CRC. The aim of curative surgery for CRC is radical resection of the tumour. This can be difficult when tumours are large and advanced, or when emergency surgery is required because of obstructive tumours. In addition, microscopic tumour seeding within the peritoneal cavity might occur unnoticed. In these situations, surgical treatment alone is not sufficient to cure the patient and a multimodality approach should be applied. We analyzed the chance of a pathological complete tumour response after neoadjuvant chemoradiotherapy (CRT) for rectal cancer and calculated the optimal timing of surgery after (CRT). In addition, we describe the long term oncological follow up of patients that have been treated for obstructive colon cancer, and describe how adjuvant intraperitoneal chemotherapy might prevent the outgrow of peritoneal metastasis

Robustness of power-law behavior in cascading line failure models

Inspired by reliability issues in electric transmission networks, we use a probabilistic approach to study the occurrence of large failures in a stylized cascading line failure model. Such models capture the phenomenon where an initial line failure potentially triggers massive knock-on effects. Under certain critical conditions, the probability that the number of line failures exceeds a large threshold obeys a power-law distribution, a distinctive property observed in empiric blackout data. In this paper, we examine the robustness of the power-law behavior by exploring under which conditions this behavior prevails

Scale-free cascading failures:Generalized approach for all simple, connected graphs

Cascading failures, wherein the failure of one component triggers subsequent failures in complex interconnected systems, pose a significant risk of disruptions and emerge across various domains. Understanding and mitigating the risk of such failures is crucial to minimize their impact and ensure the resilience of these systems. In multiple applications, the failure processes exhibit scale-free behavior in terms of their total failure sizes. Various models have been developed to explain the origin of this scale-free behavior. A recent study proposed a novel hypothesis, suggesting that scale-free failure sizes might be inherited from scale-free input characteristics in power networks. However, the scope of this study excluded certain network topologies. Here, motivated by power networks, we strengthen this hypothesis by generalizing to a broader range of graph topologies where this behavior is manifested. Our approach yields a universal theorem applicable to all simple, connected graphs, revealing that when a cascade leads to network disconnections, the total failure size exhibits a scale-free tail inherited from the input characteristics. We do so by characterizing cascade sequences of failures in the asymptotic regime

Emergence of scale-free blackout sizes in power grids

We model power grids as graphs with heavy-tailed sinks, which represent demand from cities, and study cascading failures on such graphs. Our analysis links the scale-free nature of blackout sizes to the scale-free nature of city sizes, contrasting previous studies suggesting that this nature is governed by self-organized criticality. Our results are based on a new mathematical framework combining the physics of power flow with rare event analysis for heavy-tailed distributions, and are validated using various synthetic networks and the German transmission grid.Comment: 27 pages (6 pages + 21 pages with supplemental material). Accepted for publication in Physical Review Letter

Emergence of Scale-Free Traffic Jams in Highway Networks:A Probabilistic Approach

Traffic congestion continues to escalate with urbanization and socioeconomic development, necessitating advanced modeling to understand and mitigate its impacts. In large-scale networks, traffic congestion can be studied using cascade models, where congestion not only impacts isolated segments, but also propagates through the network in a domino-like fashion. One metric for understanding these impacts is congestion cost, which is typically defined as the additional travel time caused by traffic jams. Recent data suggests that congestion cost exhibits a universal scale-free-tailed behavior. However, the mechanism driving this phenomenon is not yet well understood. To address this gap, we propose a stochastic cascade model of traffic congestion. We show that traffic congestion cost is driven by the scale-free distribution of traffic intensities. This arises from the catastrophe principle, implying that severe congestion is likely caused by disproportionately large traffic originating from a single location. We also show that the scale-free nature of congestion cost is robust to various congestion propagation rules, explaining the universal scaling observed in empirical data. These findings provide a new perspective in understanding the fundamental drivers of traffic congestion and offer a unifying framework for studying congestion phenomena across diverse traffic networks

Emergence of Scale-Free Traffic Jams in Highway Networks:A Probabilistic Approach

Traffic congestion continues to escalate with urbanization and socioeconomic development, necessitating advanced modeling to understand and mitigate its impacts. In large-scale networks, traffic congestion can be studied using cascade models, where congestion not only impacts isolated segments, but also propagates through the network in a domino-like fashion. One metric for understanding these impacts is congestion cost, which is typically defined as the additional travel time caused by traffic jams. Recent data suggests that congestion cost exhibits a universal scale-free-tailed behavior. However, the mechanism driving this phenomenon is not yet well understood. To address this gap, we propose a stochastic cascade model of traffic congestion. We show that traffic congestion cost is driven by the scale-free distribution of traffic intensities. This arises from the catastrophe principle, implying that severe congestion is likely caused by disproportionately large traffic originating from a single location. We also show that the scale-free nature of congestion cost is robust to various congestion propagation rules, explaining the universal scaling observed in empirical data. These findings provide a new perspective in understanding the fundamental drivers of traffic congestion and offer a unifying framework for studying congestion phenomena across diverse traffic networks

First-passage time asymptotics over moving boundaries for random walk bridges

We study the asymptotic tail behavior of the first-passage time over a moving boundary for a random walk conditioned to return to zero, where the increments of the random walk have finite variance. Typically, the asymptotic tail behavior may be described through a regularly varying function with exponent -1/2, where the impact of the boundary is captured by the slowly varying function. Yet, the moving boundary may have a stronger effect when the tail is considered at a time close to the return point of the random walk bridge, leading to a possible phase transition depending on the order of the distance between zero and the moving boundary