Shortest-path percolation on complex networks

In various infrastructural systems like power grids and airline networks, path-based interactions serve a crucial role in sustaining the flow dynamics in the system. Thus, well-designed infrastructures should be robust not only under failures/attacks upon single components but also under path-based perturbations. To tackle this problem, we propose a percolation model based on a protocol which removes the edges that constitute the shortest path of a random pair of nodes on networks: the shortest-path percolation model. In this talk, we present our results obtained from extensive Monte Carlo simulations on synthetic networks and discuss the results. In addition, we discuss how the shortest-path percolation model can be applied to design robust infrastructure networks under path-based attacks.