6 February 2019 in Royal Society Open Science
Many critical infrastructure systems have network structures and are under stress. Despite their national importance, the complexity of large-scale transport networks means that we do not fully understand their vulnerabilities to cascade failures. The research conducted through this paper examines the interdependent rail networks in Greater London and surrounding commuter area. We focus on the morning commuter hours, where the system is under the most demand stress. There is increasing evidence that the topological shape of the network plays an important role in dynamic cascades. Here, we examine whether the different topological measures of resilience (stability) or robustness (failure) are more appropriate for understanding poor railway performance. The results show that resilience, not robustness, has a strong correlation with the consumer experience statistics. Our results are a way of describing the complexity of cascade dynamics on networks without the involvement of detailed agent-based models, showing that cascade effects are more responsible for poor performance than failures. The network science analysis hints at pathways towards making the network structure more resilient by reducing feedback loops.
16 September 2019 in IEEE Transactions on Network Science and Engineering
Water distribution networks are critical infrastructures under threat from the accidental or intentional release of contaminants. Data collection sensors remains challenging in underground spaces and large networks. In order to quantify the threat of contamination to end users, inferring contaminant spread with minimal sensor data is critical. Existing sensor deployment optimisation approaches use numerical optimisation, but suffer from scalability issues and lack performance guarantees. Analytical graph theoretic approaches link complex network topology (e.g. Laplacian spectra) to optimal sensing locations, but neglects the complex fluid dynamics. Alternative data-driven approaches such as compressed sensing offer limited sample node reduction. In this work, we introduce a novel data-driven Graph Fourier Transform that exploits the low-rank property to optimally sample WDNs. The proposed GFT allows us to recover the full dynamics of network contamination using only data sampled at a subset of nodes. It offers attractive improvements over existing numerical, compressed sensing, and graph theoretic approaches. Our case study results show that, on average, with nearly 30% of the junctions monitored, we are able to fully recover the networked dynamics. The framework is useful beyond the application of WDNs and can be applied to a variety of infrastructure sensing for digital twin modeling.
1 June 2020 in Journal of Water Resources Planning and Management
Water distribution network (WDN) resilience depends on both the underlying flow dynamics and the network topology. Although existing literature has examined a variety of complex network centrality and spectral properties, very little attention has been given to understand multiscale flow-based feedback loops and their impact on overall stability. Here, high-dimensional resilience arising from multiscale feedback loops is inferred using a compressed one-dimensional proxy measure called trophic coherence. This is hypothesized to have a strong impact on both the pressure deficit and the water age. The results show that trophic coherence is positively correlated with the time to recovery (0.62–0.52), but it is negatively correlated with the diffusion of a disruption ( to ). Finally, random forest analysis is used to combine resilience measures, showing that the new resilience ensemble provides a more accurate measure for networked resilience.
1 January 2021 in IEEE Access
The idea of Smart contracts foresees the possibility of automating contractual clauses using hardware and software tools and devices. One of the main perspectives of their implementation is the automation of interactions such as bets, collaterals, prediction markets, insurances. As blockchain platforms, such as Ethereum, offer very strong guarantees of untampered, deterministic execution, that can be exploited as smart contracts substrate, the problem of how to provide reliable information from the “outside world” into the contracts becomes central. In this article, we propose a system based on a Merkle tree representation of structured documents (such as all XML), with which it is possible to generate compact proofs on the content of web documents. The proofs can then be efficiently checked on-chain by a smart contract, to trigger contract action. We provide an end-to-end proof of concept, applying it to real use case scenarios, which allows us to give an estimate of the costs.
18 December 2019 in Environment and Planning B: Urban Analytics and City Science
Understanding and learning the characteristics of network paths has been of particular interest for decades and has led to several successful applications. Such analysis becomes challenging for urban networks as their size and complexity are significantly higher compared to other networks. The state-of-the-art machine learning techniques allow us to detect hidden patterns and, thus, infer the features associated with them. However, very little is known about the impact on the performance of such predictive models by the use of different input representations. In this paper, we design and evaluate six different graph input representations (i.e. representations of the network paths), by considering the network’s topological and temporal characteristics, for being used as inputs for machine learning models to learn the behavior of urban network paths. The representations are validated and then tested with a real-world taxi journeys dataset predicting the tips of using a road network of New York. Our results demonstrate that the input representations that use temporal information help the model to achieve the highest accuracy (root mean-squared error of 1.42$).