# Easily repairable networks: reconnecting nodes after damage

Infrastructure networks can be vulnerable under attack. If we cannot protect them, how can we make them more repairable?

*Physical Review Letters* 113, 138701 (2014)

We introduce a simple class of distribution networks that withstand damage by being repairable instead of redundant. Instead of asking how hard it is to disconnect nodes through damage, we ask how easy it is to reconnect nodes after damage. We prove that optimal networks on regular lattices have an expected cost of reconnection proportional to the lattice length, and that such networks have exactly three levels of structural hierarchy. We extend our results to networks subject to repeated attacks, in which the repairs themselves must be repairable. We find that, in exchange for a modest increase in repair cost, such networks are able to withstand any number of attacks.

#### Imaginary replica analysis of loopy regular random graphs

F. Lopez, T. Coolen

Sub. to *Journal of Physics A*

#### Degree-correlations in a bursting dynamic network model

F. Vanni, P. Barucca

*Journal of Economic Interaction and Coordination*

#### Phase transition creates the geometry of the continuum from discrete space

R. Farr, T. Fink

*Physical Review E*

#### Intelligently chosen interventions have potential to outperform the diode bridge in power conditioning

F. Liu, Y. Zhang, O. Dahlsten, F. Wang

*Scientific Reports *

#### Portfolio analysis and geographical allocation of renewable sources: A stochastic approach

A. Scala, A. Facchini, U. Perna, R. Basosi

*Energy Policy*

122 / 122 papers