Assessing the reliability of critical infrastructure networks, such as urban systems essential for city functions like electricity and water, is key for robust operation and risk management. Traditional methods for reliability estimation, such as minimal cut-sets and path enumeration, often become computationally infeasible for large-scale, complex networks due to the need to evaluate all possible node-to-node paths. This paper introduces a novel approach based on landmark nodes – critical nodes essential for maintaining network connectivity – to estimate reliability more efficiently. Instead of analysing all paths between nodes, the method focuses on those connecting regular nodes to landmark nodes, significantly reducing the number of paths considered and improving computational efficiency. The network is first decomposed using a graph clustering algorithm, producing internally dense subgraphs. Reliability is then evaluated through intra-subgraph and inter-subgraph paths. A bipartite network model is also employed to represent inter-cluster structure, accounting for failures in both nodes and links. This supports a multi-scale reliability analysis across local areas and the full network. The methodology is validated using benchmark power distribution networks to ensure reproducibility. To demonstrate practical relevance, it is also applied to a real-world case study involving the water distribution system of Pavia, Italy. This application highlights how key urban areas and components can be efficiently identified to prioritise maintenance and guide resource allocation, contributing to more resilient and sustainable infrastructure management.
Landmark-node based reliability assessment for critical infrastructure networks
Giudicianni C.;Creaco E.;
2026-01-01
Abstract
Assessing the reliability of critical infrastructure networks, such as urban systems essential for city functions like electricity and water, is key for robust operation and risk management. Traditional methods for reliability estimation, such as minimal cut-sets and path enumeration, often become computationally infeasible for large-scale, complex networks due to the need to evaluate all possible node-to-node paths. This paper introduces a novel approach based on landmark nodes – critical nodes essential for maintaining network connectivity – to estimate reliability more efficiently. Instead of analysing all paths between nodes, the method focuses on those connecting regular nodes to landmark nodes, significantly reducing the number of paths considered and improving computational efficiency. The network is first decomposed using a graph clustering algorithm, producing internally dense subgraphs. Reliability is then evaluated through intra-subgraph and inter-subgraph paths. A bipartite network model is also employed to represent inter-cluster structure, accounting for failures in both nodes and links. This supports a multi-scale reliability analysis across local areas and the full network. The methodology is validated using benchmark power distribution networks to ensure reproducibility. To demonstrate practical relevance, it is also applied to a real-world case study involving the water distribution system of Pavia, Italy. This application highlights how key urban areas and components can be efficiently identified to prioritise maintenance and guide resource allocation, contributing to more resilient and sustainable infrastructure management.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


