Thank you for visiting nature.com. You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript.

# Discontinuous transition to loop formation in optimal supply networks

## Abstract

The structure and design of optimal supply networks is an important topic in complex networks research. A fundamental trait of natural and man-made networks is the emergence of loops and the trade-off governing their formation: adding redundant edges to supply networks is costly, yet beneficial for resilience. Loops typically form when costs for new edges are small or inputs uncertain. Here, we shed further light on the transition to loop formation. We demonstrate that loops emerge discontinuously when decreasing the costs for new edges for both an edge-damage model and a fluctuating sink model. Mathematically, new loops are shown to form through a saddle-node bifurcation. Our analysis allows to heuristically predict the location and cost where the first loop emerges. Finally, we unveil an intimate relationship among betweenness measures and optimal tree networks. Our results can be used to understand the evolution of loop formation in real-world biological networks.

## Introduction

The reliable function of supply networks is essential for biological as well as technical systems. Leaf venation networks supply plant leaves with water and nutrients1 and vascular systems supply vertebrates with oxygen and nutrients2. On the other hand, society relies on man-made supply networks such as power grids3 or hydraulic networks4. Finally, networks that formed over time such as drainage basins show a similar structure5. Understanding the design principles of such networks is a central challenge in network science6.

The evolution or construction of supply and transportation networks is essentially determined by the trade-off between cost and resilience7,8,9. Cost limits the number of connections in the network, as resources are generally scarce. Resilience requires additional connections to cope with damages or perturbations. Many actual networks contain loops to establish a certain level of topological resilience, hence they stay connected and operational even if some elements fail10. The interplay of topology and resilience is analysed in various disciplines including traffic networks8, communication networks11 or dynamical networks12. Finally, a variety of results on structural resilience, that is the ability of a network to remain connected when a fraction of nodes or links fails, have been obtained in network science13,14.

In this article, we focus on linear flow networks modelling power grids, hydraulic networks or vascular networks3,4,15. Different structural patterns are observed in nature, consisting of both networks with and without loops. For instance, leaf venation networks are loopy in general, except for a few old species such as Ginkgo. In electric power systems, large-scale transmission grids are strongly meshed, while local distribution grids are topological trees (Fig. 1). Optimal network structures balancing costs and resilience have been analysed via extensive numerical simulations in the setting where a single source supplies the remaining network, such as in plant leaves15,16,17. The optimal structure does not contain any loops if connections are reliable and perturbations are weak, for instance in distribution grids. Loops come into being when sources or sinks fluctuate strongly or connections are subject to damages, such as in transmission grids or newer leaf species. While some work has been done in the context of networks optimising transport time18, the exact mechanism of loop formation in minimal-dissipation networks is still not fully understood.

Here, we analyse the transition to loop formation on a theoretical basis and derive several analytical results. We consider optimal network structures in the sense that function is optimised while costs are constrained or vice versa. Two aspects of resilience are studied in detail—damage to edges and fluctuations of supply and demand. In particular, we investigate the optimal structure as a function of the severity of damage and the strength of fluctuations. In contrast to prior work, we focus on the occurrence of the very first loop, which enables an analytical approach to loop formation and yields several rigorous results. We first establish this approach for an elementary sample network and then generalise it to networks of arbitrary size and compare analytic predictions and numerical results.

In particular, we demonstrate that the transition to loop formation is generally discontinuous in the sense that optimal edge-capacities jump discontinuously when fluctuations increase or costs decrease. Loopy network structures emerge as new local minima of the dissipation function that form via a saddle-node bifurcation, and not via a bifurcation of an already existing minimum. Hence, a large number of local minima may exist simultaneously and we establish a purely topological expression based on the edge betweenness to understand their structure. As a direct application of our analysis, we derive a simple criterion to predict the location of the first loop in the transition from a tree network.

## Results

### Modelling supply networks

We consider a simple supply network model which was previously used to study loop formation in generic distribution networks15,16. Mathematically, the supply network is constructed from a graph G with node set V and edge set E. At each node n V, there is an in- or outflow with a strength Pn, where Pn > 0 denotes a source and Pn < 0 a sink. The in- and outflows may either represent individual supply nodes or allocated demands associated with the node19. An edge in the network is either labelled by its index e E or by its terminal nodes e = (nm) which we use interchangeably. For each edge, we fix an orientation which is encoded in the node-edge incidence matrix $$I\in {{\mathbb{R}}}^{| V| \times | E| }$$ with elements

$${I}_{n,e}=\left\{\begin{array}{ll}1&{\rm{if}}\,{\rm{edge}}\,\ e\ \,{\rm{starts}}\,{\rm{at}}\,{\rm{node}}\,\ n,\\ -1&{\rm{if}}\,{\rm{edge}}\,\ e\ \,{\rm{ends}}\,{\rm{at}}\,{\rm{node}}\,\ n,\hfill\\ 0&{\text{otherwise}.}\hfill\end{array}\right.$$
(1)

Each edge is assigned a capacity $${k}_{e}\in {{\mathbb{R}}}_{+}$$ and a flow whose strength or value is denoted as $${F}_{e}\in {\mathbb{R}}$$. Fixing the orientation of an edge e = (nm) means that Fe > 0 describes a flow from node n to node m and Fe < 0 describes a flow from node m to node n. The flows satisfy the continuity equation or Kirchhoff’s current law (KCL) at every node of the network,

$$\mathop{\sum}\limits_{e\in E}{I}_{n,e}{F}_{e}={P}_{n},\quad \forall \ n\in V.$$
(2)

In addition to that, we assign a potential θn to each node in the network. In terms of physical quantities, this potential $${\theta }_{n}\in {\mathbb{R}}$$ can represent the pressure at the nodes of a hydraulic network, the voltage in DC resistor networks or the nodal voltage phase angle in linearised AC power grids4,15,20,21. For these systems, the flow on a link e = (nm) scales linearly with the potential drop θn − θm along the link and can be calculated as

$${F}_{e}={k}_{e}({\theta }_{n}-{\theta }_{m}).$$
(3)

Together with the continuity equation (2), this linear set of equations determines the values of the potentials θn up to a global constant. The resulting flows automatically satisfy Kirchhoff’s voltage law (KVL) which states that the flow around any closed loop expressed in terms of the edges $$C=\{{e}_{{c}_{1}},{e}_{{c}_{2}},...,{e}_{{c}_{\text{max}}}\}$$ vanishes [ref. 22, pp. 40]

$$\mathop {\sum}\limits_{e\in C}{z}_{e}{F}_{e}=0.$$
(4)

Here, the factor ze { − 1, 1} is used to keep track of the orientation of an edge e with respect to the orientation of the edge in the loop C, i.e.

$${z}_{e}=\left\{\begin{array}{ll}1&\,{\rm{if}}\,{\rm{edge}}\,e=({e}_{1},{e}_{2})\,{\rm{is}}\,{\rm{oriented}}\,{\rm{from}}\,{e}_{1}\,\text{to}\,{e}_{2},\\ -1&\,{\rm{if}}\,{\rm{edge}}\,e=({e}_{1},{e}_{2})\,{\rm{is}}\,{\rm{oriented}}\,{\rm{from}}\,{e}_{2}\,\text{to}\,{e}_{1}.\end{array}\right.$$

### Optimising supply networks: minimum dissipation topologies

We now illustrate how to determine the optimal supply network that is described by the above the set of equations. To this end, we want to find the edge capacities that determine the network structure that is optimal for performing a given task. Throughout this manuscript, we call the network structure optimal if the edge capacities are such that the overall network dissipation is minimised, as suggested for example in refs. 15,16,17. The network dissipation may be calculated as

$$D=\mathop {\sum}\limits_{e\in E}\frac{{F}_{e}^{2}}{{k}_{e}}.$$
(5)

In addition to that, we assume that the resources to build the network are limited. This resource constraint takes the form

$$\mathop{\sum}\limits_{e\in E}{k}_{e}^{\gamma }={K}^{\gamma },$$
(6)

where the cost parameter γ > 0 depends on the type of problem under consideration. For instance, assuming Poiseuille flow through cylindrical pipes of fixed length and radius Re, $${k}_{e} \sim {R}_{e}^{4}$$, such that γ = 1/2 fixes total fluid volume and γ = 1/4 fixes total pipe mass15,16,17,23,24. The parameter K corresponds to the overall available budget. Note that different definitions of optimal networks arise in other applications, e.g. in hydraulic engineering where typically the cost is minimised while the dissipation is constrained25. In Supplementary Fig. 5 and Supplementary Note 5, we demonstrate that the same kind of discontinuous transition is observed when extending our analysis to this setup.

In general, it is neither useful nor meaningful to allow arbitrary connections between the nodes. Geometric constraints apply to a variety of networks. For instance, leaf vascular networks or river basins are naturally planar. To take into account such constraints and keep the problem feasible one typically fixes a set of potential edges $${\mathcal{E}}$$ such that $$E\subseteq {\mathcal{E}}$$. These edges are often taken from a square grid16, a triangular grid15, or various types of disordered tessellations7,26. Note that while planarity of the network described by the set of potential edges $${\mathcal{E}}$$ simplifies the theoretical analysis, our results are not limited to planar networks as we demonstrate for a simple, non-planar network in Supplementary Fig. 6.

We focus on two different models here: a model with fluctuating sources and sinks and a model of stochastic damage to the edges. Both models can be thought of as quantifying network resilience: We call a network resilient if it is able to function properly under the uncertainties induced by edge damage or fluctuating inputs. For both models, our main question will be the following: Under which conditions does the optimal network structure contain loops and how do these loops emerge?

Fluctuating sink model: First, we introduce the fluctuating sink model. In this model, we include fluctuations by treating the Pn as random variables. For each random realisation, the sources and sinks are balanced, i.e. they sum to zero,

$$\mathop {\sum}\limits_{n\in V}{P}_{n}=0.$$
(7)

Network structures are then optimised to have a minimum average dissipation

$$\langle D\rangle =\mathop {\sum}\limits_{e\in E}\frac{\langle {F}_{e}^{2}\rangle }{{k}_{e}},$$
(8)

for a given set of resources. Here, the brackets 〈〉 denote the expected value taken over all realisations of the random variables Pn. Note that the fluctuations affect only the flows directly by virtue of Eq. (3), whereas the network topology is assumed to be fixed by the construction of the network such that the average is taken over the squared flows only. Equation (8) can be minimised analytically with respect to the ke, where the resource constraint is taken into account via the method of Lagrange multipliers. Calculating the optimal edge capacities by extremising the Lagrange function yields16 (Supplementary Note 1)

$${k}_{e}=\frac{{(\langle {F}_{e}^{2}\rangle )}^{\frac{1}{1+\gamma }}}{{\left[{\sum }_{a\in E}{(\langle {F}_{a}^{2}\rangle )}^{\frac{\gamma }{1+\gamma }}\right]}^{1/\gamma }}K.$$
(9)

This expression depends on the second moments of the flows $$\langle {F}_{e}^{2}\rangle$$, which in turn depend on the capacities ke. Hence, Eq. (9) can be interpreted as a self-consistency condition which has to be solved together with Eq. (3).

Edge-damage model. A second class of dissipation-optimised networks that is relevant to biology and engineering seeks to find optimal networks subject to damage. For instance, leaf vasculature might be attacked by a herbivorous insect, or a power grid might lose a power line due to an outage. In the following, we generalise the broken-bond model considered in ref. 15 by allowing partial damage to the network capacities instead of complete removal of edges.

In this edge-damage model, the sources and sinks are still balanced but do not fluctuate stochastically. Instead, we assume that all nodes but one are sinks with $${P}_{j \,{> }\,1}=-\bar{P}$$ supplied by a single node with $${P}_{1}=(N-1)\bar{P}$$, where N is the number of nodes.

To model partial damage of edge l, we modify the edge capacities according to

$${k}_{e}\ \to \ (1-{\Delta }_{e}^{(l)}){k}_{e},$$
(10)

with the damage fraction

$${\Delta }_{e}^{(l)}=\left\{\begin{array}{ll}0&\,{\text{if}}\,\ e \, \ne\, l,\\ \Delta \in \left(0\right.,\left.1\right]&\,{\text{if }}\,e=l.\end{array}\right.$$
(11)

Thus, a damage parameter Δ = 1 corresponds to complete removal of the damaged edge. We now define the average over all possible damage scenarios. Specifically, if g(ke) is some function of the capacities ke, we define

$$\langle g({k}_{e})\rangle ^{\prime} =\frac{1}{| E| }\mathop{\sum }\limits_{l=1}^{| E| }g({\Delta }_{e}^{(l)}{k}_{e}),$$
(12)

where E is the number of edges in the network. Here and in the following, we use the notation $$\langle \cdot \rangle ^{\prime}$$ to distinguish the average over damage scenarios from the average over fluctuating sources and sinks.

As before, the central objective is to minimise the average dissipation of the network,

$$\langle D\rangle =\mathop {\sum}\limits_{e}\left\langle \frac{{F}_{e}^{2}}{{k}_{e}}\right\rangle ^{\prime} ,$$
(13)

taken over all possible damaged edges under the resource constraint Eq. (6).

We now proceed to study loop formation in the two models outlined above in detail.

### Discontinuous transition to loop formation in small network

As an illustrative example, let us consider an elementary network as sketched in Fig. 2a and analyse the transition to loop formation in both, the fluctuating sink model and the edge-damage model.

Disontinous transition in fluctuating sink model: The network consists of four variable sinks at nodes 2, 3, 4, 5 (circles) that are modelled as iid Gaussian random variables $${P}_{2,3,4,5} \sim {\mathcal{N}}(\mu ,\sigma )$$ and four edges (arrows) connecting them with capacities ki and flows Fii {1, 2, 3, 4}. A fifth, potential edge is shown as a dotted arrow. If it exists, it carries flow $${\tilde{F}}_{5}$$ and has capacity k5 = κ (Fig. 2a). The central question we will study for this setup is the following: When is the optimal network tree-like (κ = 0) and when is it loopy (κ > 0)—and how does κ behave at the transition point?

We first consider the case where the loop is not present, i.e. κ = 0. In this case, the network is a tree and we can calculate the second moments $$\langle {F}_{i}^{2}\rangle ,\,i\in \{1,2,3,4\}$$ explicitly in terms of the capacities: they are determined by the statistics of the source and the sinks by virtue of the continuity equation (2). Using the optimal capacities for a tree network (6), we obtain an explicit equation for the optimal dissipation 〈Dtree〉 that only depends on the statistics of the sinks (Supplementary Note 4)

$$\langle {D}_{{\rm{tree}}}\rangle =\frac{{\left[2{({\sigma }^{2}+{\mu }^{2})}^{\frac{\gamma }{\gamma +1}}+2{(2{\sigma }^{2}+4{\mu }^{2})}^{\frac{\gamma }{\gamma +1}}\right]}^{(\gamma +1)/\gamma }}{K}.$$
(14)

How does this result change if we allow closing the loop as illustrated in Fig. 2a, i.e. if we include the corresponding edge in the set of potential edges $${\mathcal{E}}$$?

Let us assume that the loop carries a flow $${\tilde{F}}_{5}$$ and has a non-zero capacity k5 = κ > 0. In the following, we denote the flows and capacities in the loopy network with a tilde. In the presence of a loop, we can no longer determine the flows using the continuity equation (2) alone. Instead, we have an additional degree of freedom: a cycle flow f around the newly formed edge such that $${\tilde{F}}_{1}={F}_{1}-f$$, $${\tilde{F}}_{3}={F}_{3}+f$$ and $${\tilde{F}}_{5}=f$$. The strength of the cycle flow can be determined using the KVL (4)

$$\frac{f}{\kappa }+\frac{\tilde{{F}}_{3}}{\tilde{{k}}_{1}}-\frac{\tilde{{F}}_{1}}{\tilde{{k}}_{1}}=0.$$
(15)

This approach allows us to eliminate the dependence on the cycle flow strength f, and we can evaluate the dissipation 〈Dloopy〉 of the loopy network by inserting the result into Eq. (8) (Supplementary Note 4). The new expression for the dissipation no longer contains the flows explicitly, which considerably simplifies finding the optimal topology: we no longer have to take care of the interdependence of flows and capacities, but can minimise 〈Dloopy〉 in terms of only the capacities $${\tilde{k}}_{i}$$.

We proceed to evaluate the optimal network structure fixing the mean of fluctuations to μ = −1 and the resource constraint to K = 1. To examine the effect of the two remaining parameters separately, we analyse the transition to loop formation for γ = 0.9 fixed while varying σ and for σ = 3 fixed with varying γ. We then compute the dissipation 〈Dloopy〉 as a function of the capacities κ and k1 and compare it to the dissipation 〈Dtree〉 of the corresponding tree network. Note that the capacities in the optimum tree network are explicitly given by Eq. (9) such that 〈Dtree〉 is fixed. For the loopy network, we still need to determine the optimum structure, i.e. we compute the minima of 〈Dloopy〉 as a function of κ and $${\tilde{k}}_{1}$$ recalling that $${\tilde{k}}_{3}={\tilde{k}}_{1}$$, $${\tilde{k}}_{4}={\tilde{k}}_{2}$$ and $${\tilde{k}}_{2}$$ is then fixed by the resource constraint Eq. (6).

For both varying fluctuations σ and varying costs γ, we find that the transition to loop formation is discontinuous: the loop starts to form with a non-zero capacity κ when analysing the globally optimal network structure (Fig. 3a, c, thick, orange line). Analogously, the capacity k1 bifurcates (red line).

But what is the nature of this transition? In fact, we find that new minima emerge through a saddle-node bifurcation independently of the parameter we vary. Thus, new minima do not form from the existing tree minimum but instead emerge elsewhere in the energy landscape. To support this claim, we plot the capacity at the saddle in Fig. 3 (dotted, coloured lines) and analyse the dissipation landscape close to the bifurcation point (Supplementary Fig. 3). Using these results, we can also map out the parameter region where loop formation is beneficial (Supplementary Fig. 2). In Supplementary Fig. 7, we illustrate the nature of this transition for an even simpler network and find a closed-form solution for the region of the parameter space where loop formation is beneficial.

Discontinuous transition in edge-damage model: We now turn to the edge-damage model and analyse the optimal topology again for the graph shown in Fig. 2a. Most importantly, we find that the transition between a tree-like and a loopy optimal network is also discontinuous in the damage model in both the cost parameter γ and the damage parameter Δ, and new extrema appear again through saddle-node bifurcations (Fig. 3b, d). This demonstrates that despite the fact that in the damage model, the optima follow a different scaling law from those in the fluctuation model15, the mechanism and type of the transition from tree-like to loopy optimum is generic.

### Discontinuous transition persists beyond the first loop

Whereas the transition to the first loop that forms is important in many real-world supply networks, such as the Gingko leaf and the distribution grid shown in Fig. 1, other networks display several loops, such that their formation beyond the first loop becomes important. In particular, the tree has mainly theoretical importance in many applications such as hydraulic networks where spanning trees in loopy networks play an important role in modelling and optimisation25,27,28,29. Remarkably, we can demonstrate numerically that the discontinuous character of loop formation persists beyond the first loop.

In Fig. 4, we analyse this transition for the fluctuating sink model with cost parameter γ = 0.5 for a larger, globally optimal tree network which was formed from a set of potential edges $${\mathcal{E}}$$ corresponding to a triangular grid as shown in Fig. 2c. We map out the order in which new loops form (colour code) when decreasing the cost for new edges and slightly perturbing the previous network structure. All new loops emerge discontinuously with a non-zero capacity from an existing loopy network topology (Fig. 4c). Note that in contrast to Fig. 3, the optimal capacities are obtained here using an iterative approach for finding local minima of the dissipation that is due to ref. 16 (see “Methods” section). In a Supplementary Fig. 8, we demonstrate that an analogous transition exists for varying fluctuation strength σ and fixed cost parameter γ.

### Identifying optimal trees for networks of arbitrary size

We now generalise our reasoning to larger networks with an arbitrary number of nodes N. For this analysis, we focus on the fluctuating sink model. Again we assume that all nodes j = 2, …, N act as sinks with Pj being random variables and that the source j = 1 balances the sinks. We start from a tree network and analyse at what value of the cost parameter γ it becomes beneficial to add a single edge thus closing a single loop. This setup is sketched in Fig. 2b. We first demonstrate how to calculate the dissipation in such a setting and then illustrate the procedure to minimise it.

In an arbitrary tree network, the flows do not depend on the link capacities but only on the topology of the network as illustrated in the last section. This is due to the fact that for each node j = 2, 3, … there is only one path from the respective node to the root j = 1 of the tree. The flow Fe on an edge e is thus directly given by the KCL Eq. (2). Here, we fix the orientation of the flows such that they point away from the source as illustrated in Fig. 2b. Therefore, flows in tree networks are always positive.

To express the flows Fe in terms of the sources and sinks Pj, we introduce the tree matrix $${\mathcal{T}}\in {{\mathbb{R}}}^{| E| \times | E| }$$ by

$${{\mathcal{T}}}_{e,j}=\left\{\begin{array}{ll}+1&\,{\rm{if}}\,{\rm{edge}}\,\ e\ \,{\rm{is}}\,{\rm{on}}\,{\rm{the}}\,{\rm{path}}\,{\rm{from}}\,{\rm{node}}\\ {\,\!} &\; j+1\ \,{\rm{to}}\,{\rm{the}}\,{\rm{root}}\,\ j=1\qquad\qquad\quad\\ 0&\,{\text{otherwise}.}\qquad\qquad\qquad\qquad\qquad\end{array}\right.$$
(16)

This yields an explicit expression for the flows,

$${F}_{e}=-\mathop{\sum }\limits_{j=2}^{N}{{\mathcal{T}}}_{e,j-1}{P}_{j}\ .$$
(17)

We can insert this result into the network dissipation (Eq. (8)), which yields

$$\langle {D}_{{\rm{tree}}}\rangle =\mathop{\sum }\limits_{e\in T}\mathop{\sum }\limits_{i,j=2}^{N}{{\mathcal{T}}}_{e,j-1}{{\mathcal{T}}}_{e,i-1}\langle {P}_{i}{P}_{j}\rangle {k}_{e}^{-1}\ ,$$
(18)

where T = E(G) is the set of all edges in the tree, i.e. before the addition of a loop.

### From trees to loopy networks: optimising networks with a single loop

Remarkably, we can also find an explicit expression for the dissipation eliminating the flows in a near-tree network by exploiting the KVL to eliminate the new degrees of freedom, similar to the strategy in the previous section.

We consider a network that consists of a tree plus a single link  = (mn) with capacity κ as sketched in Fig. 2b. The edges on the paths from nodes n and m to the root node are summarised in the edge sets L and R, respectively, which we define as follows: Denote by p(m) and p(n) the set of all edges along the shortest path from the source node to the node m and n, respectively, oriented in the direction pointing away from the source. Note that these paths are unique in a tree network. Then define the following sets:

$$L = \, p(n)\!\!\setminus \!\!(p(m)\cap p(n)),\\ R= \, p(m)\!\!\setminus \!\!(p(m)\cap p(n)),$$
(19)

such that the union of the edge set L R {(mn)} forms a cycle. As we will see in the following, this definition turns out to be useful when studying the dissipation in the presence of a single loop.

Due to the presence of the loop, we have a new degree of freedom, the cycle flow strength f. According to the KCL Eq. (2), the flows in the loopy network are given by

$${\tilde{F}}_{e}=\left\{\begin{array}{ll}f&{\rm{if}}\ e=(m,n)\\ {F}_{e}+f&{\rm{if}}\ e\in R(m)\\ {F}_{e}-f&{\rm{if}}\ e\in L(n)\\ {F}_{e}&{\rm{otherwise}}.\end{array}\right.$$
(20)

The value of f is fixed via the KVL:

$$\begin{array}{lll}&&\mathop {\sum}\limits_{e\in L}\frac{-{F}_{e}+f}{\tilde{{k}}_{e}}+\mathop {\sum}\limits_{e\in R}\frac{{F}_{e}+f}{\tilde{{k}}_{e}}+\frac{f}{\kappa }=0\\ &\Rightarrow &f={\left({\kappa }^{-1}+\mathop {\sum}\limits_{e\in L\cup R}{\tilde{k}}_{e}^{-1}\right)}^{-1}\left(\mathop {\sum}\limits_{e\in L}\frac{{F}_{e}}{\tilde{{k}}_{e}}-\mathop {\sum}\limits_{e\in R}\frac{{F}_{e}}{\tilde{{k}}_{e}}\right).\end{array}$$
(21)

We can now evaluate the dissipation Eq. (8) in the presence of the new edge (mn) by plugging in the relations (20) and (21),

$${D}_{{\rm{loopy}}} =\sum_{e\in T}\frac{{F}_{e}^{2}}{\tilde{{k}}_{e}}-\frac{\kappa }{1+\mathop {\sum}\limits_{e\in L\cup R}\frac{\kappa }{\tilde{{k}}_{e}}}{\left(\mathop {\sum}\limits_{e\in L}\frac{{F}_{e}}{\tilde{{k}}_{e}}-\mathop {\sum}\limits_{e\in R}\frac{{F}_{e}}{\tilde{{k}}_{e}}\right)}^{2}.$$
(22)

$$\langle {D}_{{\rm{loopy}}}\rangle =\mathop {\sum}\limits_{e\in T}\frac{\langle {F}_{e}^{2}\rangle }{\tilde{{k}}_{e}}-\frac{\kappa }{1+{C}_{m,n}\kappa }{B}_{m,n},$$
(23)

where we introduced the abbreviations

$${B}_{m,n}= \, \left\langle {\left(\mathop {\sum}\limits_{e\in L}\frac{{F}_{e}}{{\tilde{k}}_{e}}-\sum _{e\in R}\frac{{F}_{e}}{{\tilde{k}}_{e}}\right)}^{2}\right\rangle \\ {C}_{m,n}= \, \mathop {\sum}\limits_{e\in L\cup R}{\tilde{k}}_{e}^{-1},$$
(24)

which are functions only of the updated capacities $${\tilde{k}}_{e}$$ along the sets of edges L and R. Importantly, the resulting expression no longer contains the updated flows $${\tilde{F}}_{e}$$, but only the flows in the tree network Fe, which are determined by Eq. (17). This allows us to minimise the dissipation with respect to the updated capacities $${\tilde{k}}_{e}$$ without having to take into account the interdependence of flows and capacities.

Now that we have derived an explicit equation for the dissipation in near-tree networks, we will demonstrate how to minimise the resulting expression. For tree networks, the minima of the dissipation may be calculated explicitly using the method of Lagrange multipliers (see Supplementary Note 2). In contrast to that, we have to take into account an inequality constraint κ ≥ 0 for near-tree networks as local minima may exist also at the boundaries of the domain. This can be done using the Karush–Kuhn–Tucker (KKT) conditions with the new Lagrange type function

$$\tilde{{\mathcal{L}}}({\tilde{k}}_{e},\kappa )= \, \mathop {\sum}\limits_{e\in T}\frac{\langle {F}_{e}^{2}\rangle }{\tilde{{k}}_{e}}-\frac{\kappa }{1+{C}_{m,n}\kappa }{B}_{m,n}\\ \,-\,\tilde{\lambda }\left({K}^{\gamma }-\mathop {\sum}\limits_{e\in T}{\tilde{k}}^{\gamma }-{\kappa }^{\gamma }\right)-{\mu \kappa }\,,$$
(25)

where $$\tilde{\lambda },\mu \in {\mathbb{R}}$$ are KKT multipliers. The minimum is then determined by the KKT conditions (see “Methods” section).

This approach results in explicit equations for the optimal edge capacities $${\tilde{k}}_{e}$$, κ in near-tree networks for which we could, however, not find a closed-form solution for arbitrary networks and values of γ (Supplementary Note 2). Still, we can make use of the resulting equations to gain insight into the process of loop formation. In particular, the KKT condition for the newly added edge (mn) with capacity κ reads

$${B}_{m,n}={(1+{C}_{m,n}\kappa )}^{2}{\kappa }^{\gamma -1}\gamma \tilde{\lambda }\quad \vee \quad \kappa =0,$$
(26)

i.e. the capacity of the new edge either vanishes (κ = 0) or has the non-zero value given above. Importantly, we can obtain insights into the process of loop formation even without explicitly solving these equations.

### How do loops emerge?

We now illustrate how to make use of Eq. (26) to understand the process of loop formation. In particular, we rigorously demonstrate that loops form discontinuously as illustrated for the small tree network. Furthermore, we show that the tree remains a local minimum of the average dissipation even after the formation of a loop. We summarise these results in the following.

Theorem 1 (Tree remains KKT point) Consider a linear flow network subject to the resource constraint with γ (0, 1). Then the following statements hold for the KKT points of the average dissipation 〈Dloopy:

1. 1.

There is always a KKT point at κ = 0, i.e. the tree is always a (potential) local minimum.

2. 2.

The KKT point at κ = 0 is isolated in the sense that we can find a real number ε > 0 such that there are no other KKT points for κ  (0, ε).

The proof makes use of the fact that we can find lower and upper bounds for the functions Bm,n, $$\tilde{\lambda }$$ and Cm,n even without explicitly solving Eq. (26) and can be found in Supplementary Note 3. We note that the fact that the tree remains a local minimum is well-known for deterministic sources17,24.

We thus showed rigorously that for γ < 1, KKT points that characterise a loopy network cannot emerge through a bifurcation of the local optimum describing a tree network since the KKT point at κ = 0 is isolated. Instead, new local minima of the dissipation generally emerge elsewhere and the transition to loopy networks is discontinuous. Having understood the mechanism of loop formation, we now proceed to analyse which edges will form the first loops.

### Where do loops emerge first?

We now study the location of the first loop that appears in the globally optimal network as the parameters of the model are varied. We start from the regime where the global optimum is a topological tree. Consider the expression for the average loopy dissipation 〈Dloopy〉 to which a single edge (mn) of capacity κ was added, as calculated in Eq. (23). We can find the location where loops form first by making the following approximation: assume that after the addition of the loop, the capacities of the edges e along the shortest path from the source to the loop, e R L, change only by a constant factor c(γe), i.e. $${\tilde{k}}_{e}=c(\gamma ,e)\ {k}_{e}$$, whereas the other edges remain unchanged such that c(γe) = 1 for these edges. Looking at Fig. 3a, we can see that this is a reasonable assumption for the small network considered there. Note that the prefactor can be expected to be close to unity c(γe) ≈ 1 even for edges e L R if we assume that the network is very large because then the new edge will emerge with a very small capacity due to the resource constraint $${\sum }_{e}{\tilde{k}}_{e}^{\gamma }+{\kappa }^{\gamma }={K}^{\gamma }$$. With this approximation, the loopy dissipation reads

$$\langle {D}_{{\rm{loopy}}}\rangle \approx \mathop {\sum}\limits_{e\in T}\frac{\langle {F}_{e}^{2}\rangle }{c(\gamma ,e){k}_{e}}-\frac{\kappa }{c{(\gamma ,e)}^{2}\left(1+\frac{{C}_{m,n}({k}_{e})\kappa }{c(\gamma ,e)}\right)}{B}_{m,n}({k}_{e}).$$
(27)

Here, we defined the quantities Bm,n(ke) and Cm,n(ke) which we obtain from Bm,n and Cm,n (Eq. (24)) by replacing the updated capacity $${\tilde{k}}_{e}$$ by the tree capacity ke. The last expression can then be simplified considerably by making use of Eq. (3),

$${B}_{m,n}({k}_{e})= \, \left\langle {\left(\mathop {\sum}\limits_{e\in L}\frac{{F}_{e}}{{k}_{e}}-\sum _{e\in R}\frac{{F}_{e}}{{k}_{e}}\right)}^{2}\right\rangle \\ = \, \left\langle {({\theta }_{n}-{\theta }_{m})}^{2}\right\rangle .$$
(28)

Thus, the emergence of loops is essentially governed by the potential drop across neighbouring vessels. Similar to how cracks in brittle materials form to relieve high elastic stresses, loop formation is determined by the relief of large pressure drops. Our explicit prediction is consistent with the idea that the reduction of pressure drops may have driven the evolution of leaf venation30. From a developmental perspective, it connects to work explaining plant vein formation using models where mechanical stress relief is a crucial ingredient31,32,33. We confirm the ‘stress relief’ by loop formation in terms of the potential drop by analysing the pressure drop before and after the formation of the loop in Supplementary Fig. 1.

We now study the predictions made using Eq. (28) numerically (see “Methods” section for details). Starting from an optimal tree network, we first calculate the pressure drop (Fig. 5a). We then successively decrease the cost for new edges and monitor the order in which new loops form (Fig. 5b). Again, the transition to loop formation is discontinuous, such that loops emerge with a non-zero capacity at a critical value of the cost parameter γc, which is highly correlated to the pressure drop (Fig. 5c). We may thus predict the location and cost parameter where loops form based on the potential drop.

### Edge betweenness determines network dissipation

As we have demonstrated, all trees are—and remain—locally optimal structures and loopy networks emerge via saddle-node bifurcations. Thus, there may be a multitude of different local minima for a given set of network parameters, so a natural question that arises is the following: How can we determine which of the local minima have less dissipation than others and how can we find an order of different topologies, e.g. to find the topology that globally minimises the dissipation? Remarkably, we can trace back the answer to a purely topological property: the edge betweenness centrality.

We start by simplifying the locally optimal dissipation of the tree networks. In Eq. (17), we expressed the flows Fe in a tree network using the tree matrix $${\mathcal{T}}$$. If we plug this expression into the self-consistency equation for the capacities Eq. (9), set the overall available capacity to K = 1, and plug everything into the dissipation Eq. (8) we arrive at the locally optimal dissipation in tree networks

$$\langle {D}_{{\rm{tree}}}^{* }\rangle ={\left[\mathop{\sum }\limits_{e = 1}^{N-1}{\left(\mathop{\sum }\limits_{i,j = 2}^{N}{{\mathcal{T}}}_{e,j-1}{{\mathcal{T}}}_{e,i-1}\langle {P}_{i}{P}_{j}\rangle \right)}^{\frac{\gamma }{\gamma +1}}\right]}^{\frac{\gamma +1}{\gamma }}.$$
(29)

Importantly, the entries appearing in this expression only depend on the mixed moments of the sinks and their second moments. Since the sinks are i.i.d. Gaussian random variables, these moments are identical for different sinks and are given by

$$\langle {P}_{i}^{2}\rangle = \, {\mu }^{2}+{\sigma }^{2},\quad i\,> \, 1\\ \langle {P}_{i}{P}_{j}\rangle = \, {\mu }^{2},\,\quad i,j\,> \, 1.$$
(30)

Thus, the sum runs over identical entries and we can calculate the dissipation as

$$\langle {D}_{{\rm{tree}}}^{* }\rangle ={\left[\mathop{\sum }\limits_{e = 1}^{N-1}{\left({N}_{p}(e)\cdot {\sigma }^{2}+{N}_{p}{(e)}^{2}\cdot {\mu }^{2}\right)}^{\frac{\gamma }{\gamma +1}}\right]}^{\frac{\gamma +1}{\gamma }}.$$
(31)

Here, Np(e) is the sum over the column of the tree matrix $${\mathcal{T}}$$ that corresponds to edge e. In fact, Np(e) has the following interpretation: it is the number of paths from the source s to any other node v that go through the edge e and may thus be identified as a measure of shortest-path edge betweenness34,35 (see “Methods” section). What can we learn from this analysis for loopy networks?

To estimate the contribution of a single edge to the overall network dissipation in a loopy network, we first calculate its edge betweenness (Fig. 6a) and, based on this, the contribution it would have to the dissipation in a tree network (Fig. 6b). Adding up the resulting expressions, we arrive at the tree estimate of the dissipation in a loopy network $$\langle {D}_{{\rm{tree}}}^{* }\rangle ({N}_{p}(e))$$. For near-tree networks, the correlation between the estimate and the actual dissipation at local minima is almost perfect as predicted by Eq. (31) (Fig. 6c). Increasing the number of loops by tuning the noise parameter σ and the cost parameter γ, edge betweenness and dissipation remain correlated even when there is a significant number of loops present in the network (Fig. 6d). Thus, we can still understand the minimal dissipation in loopy networks based on this topological measure.

We further discuss the possibility of characterising the global tree minima of the network dissipation in Supplementary Note 6.

## Discussion

In summary, we demonstrated that the transition to loop formation in optimal supply networks is discontinuous throughout different models and parameters. We explored this discontinuity in detail for a small example network and rigorously proved that the discontinuous nature of the transition persists for larger networks as well. We showed that loops emerge through a saddle-node bifurcation, explaining the discontinuous transition.

Our results shed light on recent advances in the study of optimal supply networks. While the emergence of loops through fluctuations or damage was discovered recently15,16, the theoretical nature of this transition was until now not well understood. Here, we closed this gap by analysing the nature of the transition to loop formation in more detail. In particular, we obtained a measure of network stress that allowed us to predict the location and parameters where loops start to form. This opens a new pathway to the understanding of loop formation in natural networks such as leaves10.

Our results offer a new understanding of the interplay between the structure and function of supply networks. By unveiling the relationship between the network’s topological edge betweenness and its average dissipation, we established a new link between the form and function of networks. These results may aid in the understanding and design of globally optimal network structures such as biological vasculature, electrical grids, or neural networks. Our explicit prediction is consistent with the idea that the reduction of pressure drop variations may have been a factor in the evolution of leaf venation30. More generally, we show that globally optimal network structures may be obtained by following simple local rules for adding new links, in contrast to previous work based on pruning an existing network26,36.

Let us finally discuss how our results derived for linear flow models relate to other types of networks and systems. The starting point of our analysis was the fundamental trade-off between cost and resilience, which determines the optimal structure of a network, and which extends far beyond the theory of supply networks. Resilience requires additional capacity or links which can take over the load in the presence of failures or fluctuations—but these are generally costly. From a practical view of network design, the fundamental question is thus: Where and how should new connections be added that increase resilience in an optimal way?

Firstly, we discuss the question where new links should be added. A large body of literature in network science approaches aspects of resilience from the viewpoint of percolation theory. The fundamental question in this purely structural treatment is: Given a network, how many nodes or links may fail before the network gets disconnected? It has been shown that a decisive quantity to assess the resilience to random failures is given by the ratio of the second and first moment of the degree distribution, 〈k2〉/〈k137,38. These fundamental results were then used to optimise network resilience with respect to both random failures and targeted attacks13,14. In the case of failures, it is beneficial to add links between nodes which already have a high degree to effectively increase 〈k2〉. This result might appear very different from the findings of the present paper at first glance, but there are in fact common underlying principles. In supply network models, new links should be added where they will potentially attract a high flow. In percolation type models, new links should be added where they will potentially attract a high betweenness—a quantity which can also be interpreted as a flow34,39. As a result, one should pick nodes whose characteristic quantity, either potential θn or degree k, differs from their surrounding.

Secondly, we consider the question of how new links should be added. The main finding of our work is that new links emerge in a discontinuous way with a finite non-zero capacity. That is, to be beneficial for the network, new links must have a certain minimum connection strength. This result has no direct equivalence in percolation approaches to network resilience since the vast majority of studies in this field considers unweighted networks only. However, there is a strong interest in network formation processes, which induce discontinuities in macroscopic connectivity of the network—including competitive percolation models40,41, as well as transportation network models42. In the context of network resilience, it has been shown that interdependencies and cascade effects can make the percolation transition discontinuous43.

## Methods

### Numerical simulation of loop formation

When analysing the transition to loop formation such as in Figs. 4 and 5, we start from an optimal tree network T for given parameters μσ and γ corresponding to the dissipation minimum shown in Fig. 2c. As a next step, we add all non-tree edges from the underlying triangular grid with a very small capacity that corresponds to 1% of the minimum capacity in the optimal tree, $${k}_{f}=0.01\cdot {\min }_{e\in T}({k}_{e}^{* })$$, and then renormalise all capacities to make sure the resource constraint (6) holds. Finally, we then apply the iterative method described in ref. 16 to let the new topology relax to a local minimum. If this minimum contains loops despite having started very close to the (global) tree minimum, and if its dissipation is lower than the one of the tree, we conclude that the given loopy topology is favourable.

To analyse the predictive power of the pressure drop in Fig. 5, we initially consider a large optimised tree network with N = 169 nodes and cost parameter γ = 0.4 for which we calculate the pressure drop (Fig. 5a) and then increase the cost parameter from γ = 0.7 to γ = 0.99, reoptimising the network for each value of gamma. Using the procedure outlined above, we compare the predicted positions of the first loops as indicated by the initial pressure drop $$\langle {({\theta }_{m}-{\theta }_{n})}^{2}\rangle$$ with the actual order in which they appear (Fig. 5b).

### Evaluating edge betweenness

In Eq. (31), we derived an alternative expression for the network dissipation at local minima that is based on the edge betweenness Np(e). The edge betweenness is defined as34,35,38

$${N}_{p}(e)=\mathop {\sum}\limits_{t\in V}\frac{\sigma (s,t| e)}{\sigma (s,t)}.$$
(32)

Here, σ(st) is the number of shortest paths from node s to node t and σ(ste) is the number of these shortest paths that contain the edge e. In the given setting, we consider this measure with respect to a single source s that is identified as the source node of the network. Furthermore, when analysing tree networks, there is only one path from the source to every node σ(st) = 1 and thus σ(ste) = 1 = 0.

In the main text, the edge betweenness is calculated using a method implemented in PYTHON’s NETWORKX library44,45,46.

### Finding minima of a function with inequality constraints using KKT conditions

Consider the function D(k) of some real vector $${\boldsymbol{k}}={({k}_{1},...,{k}_{N})}^{\top }\in {{\mathbb{R}}}^{N}$$ that is subject to the equality constraint h(k) = 0 and the inequality constraint g(k) ≤ 0 which we assume to be described by differentiable, real-valued functions $$g,f:{{\mathbb{R}}}^{N}\to {\mathbb{R}}$$. To identify potential maxima or minima of the function subject to the constraints, we can make use of the KKT conditions. To this end, we consider the Lagrange type function

$$\tilde{{\mathcal{L}}}({\boldsymbol{k}})=D({\boldsymbol{k}})+\tilde{\lambda }h({\boldsymbol{k}})+\mathrm{\mu g}\,({\boldsymbol{k}}),$$
(33)

where $$\tilde{\lambda },\mu \in {\mathbb{R}}$$ are called KKT multipliers. Then the following conditions, the KKT conditions, are a necessary condition for a point k* being a minimum of D(k)47,48

$$\begin{array}{l}\frac{\partial \tilde{{\mathcal{L}}}}{\partial {k}_{i}^{* }}\mathop{=}\limits^{!}0,\quad \forall i\in \{1,...N\},\\ f({{\boldsymbol{k}}}^{* })=0,\\ g({{\boldsymbol{k}}}^{* })\le 0,\\ \mu \ge 0,\\ \mathrm{\mu g}\,({{\boldsymbol{k}}}^{* })=0.\end{array}$$
(34)

This formulation may be used to find out whether adding a single loop to a tree network may reduce its dissipation.

## Data availability

Photographs of leaf venation networks in Fig. 1 are available upon request. The topology of the Scandinavian power grid has been extracted from the open European energy system model PyPSA-Eur49, which is fully available online at https://doi.org/10.5281/zenodo.3886532. Distribution grid in Fig. 1c was extracted from ref. 50.

## Code availability

Computer code will be made available at https://github.com/FNKaiser/Optimal_Supply_Networks upon publication.

## References

1. 1.

Sack, L. & Scoffoni, C. Leaf venation: structure, function, development, evolution, ecology and applications in the past, present and future. N. Phytol. 198, 983–1000 (2013).

2. 2.

Pittman, R. N. Regulation of Tissue Oxygenation (Morgan & Claypool Life Sciences, San Rafael (CA), 2011).

3. 3.

Wood, A. J., Wollenberg, B. F. & Sheblé, G. B. Power Generation, Operation and Control (John Wiley & Sons, New York, 2014).

4. 4.

Hwang, N. & Houghtalen, R. Fundamentals of Hydraulic Engineering Systems (Prentice Hall, Upper Saddle River, NJ, 1996).

5. 5.

Rodríguez-Iturbe, I. & Rinaldo, A. Fractal River Basins: Chance and Self-Organization (Cambridge University Press, 2001).

6. 6.

Havlin, S. et al. Challenges in network science: applications to infrastructures, climate, social systems and economics. Eur. Phys. J. Spec. Top. 214, 273–293 (2012).

7. 7.

Ronellenfitsch, H. & Katifori, E. Phenotypes of vascular flow networks. Phys. Rev. Lett. 123, 248101 (2019).

8. 8.

Ganin, A. A. et al. Resilience and efficiency in transportation networks. Sci. Adv. 3, e1701079 (2017).

9. 9.

Avena-Koenigsberger, A. et al. Path ensembles and a tradeoff between communication efficiency and resilience in the human connectome. Brain Struct. Funct. 222, 603–618 (2017).

10. 10.

Katifori, E. & Magnasco, M. O. Quantifying loopy network architectures. PLoS ONE 7, e37994 (2012).

11. 11.

Sterbenz, J. P. et al. Resilience and survivability in communication networks: Strategies, principles, and survey of disciplines. Comput. Netw. 54, 1245–1265 (2010).

12. 12.

Gao, J., Barzel, B. & Barabási, A.-L. Universal resilience patterns in complex networks. Nature 530, 307–312 (2016).

13. 13.

Shargel, B., Sayama, H., Epstein, I. R. & Bar-Yam, Y. Optimization of robustness and connectivity in complex networks. Phys. Rev. Lett. 90, 068701 (2003).

14. 14.

Paul, G., Tanizawa, T., Havlin, S. & Stanley, H. E. Optimization of robustness of complex networks. Eur. Phys. J. B 38, 187–191 (2004).

15. 15.

Katifori, E., Szöllősi, G. J. & Magnasco, M. O. Damage and fluctuations induce loops in optimal transport networks. Phys. Rev. Lett. 104, 048704 (2010).

16. 16.

Corson, F. Fluctuations and redundancy in optimal transport networks. Phys. Rev. Lett. 104, 048703 (2010).

17. 17.

Bohn, S. & Magnasco, M. O. Structure, scaling, and phase transition in the optimal transport network. Phys. Rev. Lett. 98, 088702 (2007).

18. 18.

Kirkegaard, J. B. & Sneppen, K. Optimal transport flows for distributed production networks. Phys. Rev. Lett. 124, 208101 (2020).

19. 19.

Farina, G., Creaco, E. & Franchini, M. Using EPANET for modelling water distribution systems with users along the pipes. Civ. Eng. Environ. Syst. 31, 36–50 (2014).

20. 20.

Díaz, S., González, J. & Mínguez, R. Observability analysis in water transport networks: algebraic approach. J. Water Resour. Plan. Manag. 142, 04015071 (2016).

21. 21.

Strake, J., Kaiser, F., Basiri, F., Ronellenfitsch, H. & Witthaut, D. Non-local impact of link failures in linear flow networks. N. J. Phys. 21, 053009 (2019).

22. 22.

Bollobás, B. Modern Graph Theory. No. 184 Graduate Texts in Mathematics (Springer, New York, 1998).

23. 23.

Durand, M. Structure of optimal transport networks subject to a global constraint. Phys. Rev. Lett. 98, 088701 (2007).

24. 24.

Banavar, J. R., Colaiori, F., Flammini, A., Maritan, A. & Rinaldo, A. Topology of the fittest transportation network. Phys. Rev. Lett. 84, 4745–4748 (2000).

25. 25.

Creaco, E. & Franchini, M. Fast network multi-objective design algorithm combined with an a posteriori procedure for reliability evaluation under various operational scenarios. Urban Water J. 9, 385–399 (2012).

26. 26.

Ronellenfitsch, H. & Katifori, E. Global optimization, local adaptation, and the role of growth in distribution networks. Phys. Rev. Lett. 117, 138301 (2016).

27. 27.

Elhay, S., Simpson, A. R., Deuerlein, J., Alexander, B. & Schilders, W. H. A. Reformulated co-tree flows method competitive with the global gradient algorithm for solving water distribution system equations. J. Water Resour. Plan. Manag. 140, 04014040 (2014).

28. 28.

Creaco, E. & Franchini, M. Comparison of Newton-Raphson global and loop algorithms for water distribution network resolution. J. Hydraul. Eng. 140, 313–321 (2014).

29. 29.

Ciaponi, C., Creaco, E., Franchioli, L. & Papiri, S. The importance of the minimum path criterion in the design of water distribution networks. Water Supply 17, 1558–1567 (2017).

30. 30.

Roth-Nebelsick, A., Uhl, D., Mosbrugger, V. & Kerp, H. Evolution and function of leaf venation architecture: a review. Ann. Bot. 87, 553–566 (2001).

31. 31.

Laguna, M. F., Bohn, S. & Jagla, E. A. The role of elastic stresses on leaf venation morphogenesis. PLoS Comput. Biol. 4, e1000055 (2008).

32. 32.

Couder, Y., Pauchard, L., Allain, C., Adda-Bedia, M. & Douady, S. The leaf venation as formed in a tensorial field. Eur. Phys. J. B 28, 135–138 (2002).

33. 33.

Bar-Sinai, Y. et al. Mechanical stress induces remodeling of vascular networks in growing leaves. PLoS Comput. Biol. 12, e1004819 (2016).

34. 34.

Anthonisse, J. M. The Rush in a Directed Graph. Technical Report (Stichting Mathematisch Centrum, Centrum Wiskunde & Informatica, 1971).

35. 35.

Newman, M. E. J. & Girvan, M. Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004).

36. 36.

Hu, D. & Cai, D. Adaptation and optimization of biological transport networks. Phys. Rev. Lett. 111, 138701 (2013).

37. 37.

Callaway, D. S., Newman, M. E., Strogatz, S. H. & Watts, D. J. Network robustness and fragility: Percolation on random graphs. Phys. Rev. Lett. 85, 5468 (2000).

38. 38.

Newman, M. Networks: An Introduction (Oxford University Press, Oxford, 2018).

39. 39.

Newman, M. E. A measure of betweenness centrality based on random walks. Soc. Netw. 27, 39–54 (2005).

40. 40.

Achlioptas, D., D’Souza, R. M. & Spencer, J. Explosive percolation in random networks. Science 323, 1453–1455 (2009).

41. 41.

D’Souza, R. M. & Nagler, J. Anomalous critical and supercritical phenomena in explosive percolation. Nat. Phys. 11, 531–538 (2015).

42. 42.

Schröder, M., Nagler, J., Timme, M. & Witthaut, D. Hysteretic percolation from locally optimal individual decisions. Phys. Rev. Lett. 120, 248302 (2018).

43. 43.

Buldyrev, S. V., Parshani, R., Paul, G., Stanley, H. E. & Havlin, S. Catastrophic cascade of failures in interdependent networks. Nature 464, 1025–1028 (2010).

44. 44.

Hagberg, A. A., Schult, D. A. & Swart, P. J. Proc. 7th Python in Science Conference (eds Varoquaux, G., Vaught, T. & Millman, J.) 11–15 (Pasadena, CA USA, 2008).

45. 45.

Brandes, U. A faster algorithm for betweenness centrality. J. Math. Sociol. 25, 163–177 (2001).

46. 46.

Brandes, U. On variants of shortest-path betweenness centrality and their generic computation. Soc. Netw. 30, 136–145 (2008).

47. 47.

Boyd, S. P. & Vandenberghe, L. Convex Optimization (Cambridge University Press, Cambridge, UK; New York, 2004).

48. 48.

Kuhn, H. W. & Tucker, A. W. Proc. Second Berkeley Symposium on Mathematical Statistics and Probability 481–492 (University of California Press, Berkeley, Calif., 1951).

49. 49.

Hörsch, J., Hofmann, F., Schlachtberger, D. & Brown, T. PyPSA-eur: an open optimisation model of the european transmission system. Energy Strat. Rev. 22, 207–215 (2018).

50. 50.

Kersting, W. H. 2001 IEEE Power Engineering Society Winter Meeting. Conference Proceedings (Cat. No. 01CH37194) Vol. 2, 908–912 (2001).

## Acknowledgements

We thank Eleni Katifori for valuable discussions. We gratefully acknowledge support from the Federal Ministry of Education and Research (BMBF Grant No. 03EK3055B D.W.), the Helmholtz Association (via the joint initiative ‘Energy System 2050 – a Contribution of the Research Field Energy’ and Grant No. VH-NG-1025 to D.W.).

## Funding

Open Access funding enabled and organized by Projekt DEAL.

## Author information

Authors

### Contributions

D.W. conceived research and acquired funding. F.K. and D.W. designed research. F.K. and H.R. carried out numerical simulations. F.K. evaluated the results and designed all figures. All authors contributed to discussing the results and writing the manuscript.

### Corresponding authors

Correspondence to Franz Kaiser or Dirk Witthaut.

## Ethics declarations

### Competing interests

The authors declare no competing interests.

Peer review information Nature Communications thanks the anonymous reviewers for their contribution to the peer review of this work. Peer reviewer reports are available.

Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

## Rights and permissions

Reprints and Permissions

Kaiser, F., Ronellenfitsch, H. & Witthaut, D. Discontinuous transition to loop formation in optimal supply networks. Nat Commun 11, 5796 (2020). https://doi.org/10.1038/s41467-020-19567-2

• Accepted:

• Published: