New approximations for network reliability

We introduce two new methods for approximating the all-terminal reliability of undirected graphs. First, we introduce an edge removal process: remove edges at random, one at a time, until the graph becomes disconnected. We show that the expected number of edges thus removed is equal to (Formula presented.), where (Formula presented.) is the...

Quantifying the cascading effects of passenger delays

Delays in transport networks has adverse implications for infrastructure and service managers as well as travellers. While it is widely acknowledged that delays occurring across the transport networks may be related, there are is lack of knowledge on the underlying properties of these relations and means for quantifying them. To this end, we...