Discontinuous transition to loop formation in optimal supply networks

Non-local transitions and ground state switching in the self-organization of vascular networks

The model by D. Hu and D. Cai [Phys. Rev. Lett. 111, 138701 (2013). doi:10.1103/PhysRevLett.111.138701] describes the self-organization of vascular networks for transport of fluids from source to sinks. Diameters, and thereby, conductances, of vessel segments evolve so as to minimize a cost functional E. The cost is the trade-off between the power required for pumping the fluid and the energy consumption for vessel maintenance. The model has been used to show emergence of cyclic structures in the presence of locally fluctuating demand, i.e., non-constant net flow at sink nodes. Under rapid and sufficiently large fluctuations, the dynamics exhibits the bistability of tree-like and cyclic network structures. We compare these solutions in terms of the cost functional E. Close to the saddle-node bifurcation giving rise to the cyclic solutions, we find a parameter regime where the tree-like solution rather than the cyclic solution is cost-optimal. Thus, we discover an additional, non-local transition where tree-like and cyclic solutions exchange their roles as minimum-cost (or ground) states. The findings hold both in a small system of one source and a few sinks and in an empirical vascular network with hundreds of sinks. In the small system, we further analyze the case of slower fluctuations, i.e., on the same time scale as network adaptation. We find that the noisy dynamics settles around the cyclic structures even when these structures are not cost-optimal.

Breakthrough-induced loop formation in evolving transport networks

Transport networks, such as vasculature or river networks, provide key functions in organisms and the environment. They usually contain loops whose significance for the stability and robustness of the network is well documented. However, the dynamics of their formation is usually not considered. Such structures often grow in response to the gradient of an external field. During evolution, extending branches compete for the available flux of the field, which leads to effective repulsion between them and screening of the shorter ones. Yet, in remarkably diverse processes, from unstable fluid flows to the canal system of jellyfish, loops suddenly form near the breakthrough when the longest branch reaches the boundary of the system. We provide a physical explanation for this universal behavior. Using a 1D model, we explain that the appearance of effective attractive forces results from the field drop inside the leading finger as it approaches the outlet. Furthermore, we numerically study the interactions between two fingers, including screening in the system and its disappearance near the breakthrough. Finally, we perform simulations of the temporal evolution of the fingers to show how revival and attraction to the longest finger leads to dynamic loop formation. We compare the simulations to the experiments and find that the dynamics of the shorter finger are well reproduced. Our results demonstrate that reconnection is a prevalent phenomenon in systems driven by diffusive fluxes, occurring both when the ratio of the mobility inside the growing structure to the mobility outside is low and near the breakthrough.

Goldilocks Fluctuations: Dynamic Constraints on Loop Formation in Scale-Free Transport Networks

Adaptive transport networks are known to contain loops when subject to hydrodynamic fluctuations. However, fluctuations are no guarantee that a loop will form, as shown by loop-free networks driven by oscillating flows. We provide a complete stability analysis of the dynamical behavior of any loop formed by fluctuating flows. We find a threshold for loop stability that involves an interplay of geometric constraints and hydrodynamic forcing mapped to constant and fluctuating components. Loops require fluctuation in the relative size of the flux between nodes, not just a temporal variation in the flux at a given node. Hence, there is both a minimum and a maximum amount of fluctuation relative to the constant-flux component where loops are supported.

Optimizing the geometry of transportation networks in the presence of congestion

Urban transport systems are gaining in importance, as an increasing share of the global population lives in cities and mobility-based carbon emissions must be reduced to mitigate climate change and improve air quality and citizens' health. As a result, public transport systems are prone to congestion, raising the question of how to optimize them to cope with this challenge. In this paper, we analyze the optimal design of urban transport networks to minimize the average travel time in monocentric as well as in polycentric cities. We suggest an elementary model for congestion and introduce a numerical method to determine the optimal shape among a set of predefined geometries considering different models for the behavior of individual travelers. We map out the optimal shape of fundamental network geometries with a focus on the impact of congestion.

Dual communities in spatial networks

Both human-made and natural supply systems, such as power grids and leaf venation networks, are built to operate reliably under changing external conditions. Many of these spatial networks exhibit community structures. Here, we show that a relatively strong connectivity between the parts of a network can be used to define a different class of communities: dual communities. We demonstrate that traditional and dual communities emerge naturally as two different phases of optimized network structures that are shaped by fluctuations and that they both suppress failure spreading, which underlines their importance in understanding the shape of real-world supply networks.

Memory Formation in Adaptive Networks

The continuous adaptation of networks like our vasculature ensures optimal network performance when challenged with changing loads. Here, we show that adaptation dynamics allow a network to memorize the position of an applied load within its network morphology. We identify that the irreversible dynamics of vanishing network links encode memory. Our analytical theory successfully predicts the role of all system parameters during memory formation, including parameter values which prevent memory formation. We thus provide analytical insight on the theory of memory formation in disordered systems.

Enhancing Synchronization by Optimal Correlated Noise

From the flashes of fireflies to Josephson junctions and power infrastructure, networks of coupled phase oscillators provide a powerful framework to describe synchronization phenomena in many natural and engineered systems. Most real-world networks are under the influence of noisy, random inputs, potentially inhibiting synchronization. While noise is unavoidable, here we show that there exist optimal noise patterns which minimize desynchronizing effects and even enhance order. Specifically, using analytical arguments we show that in the case of a two-oscillator model, there exists a sharp transition from a regime where the optimal synchrony-enhancing noise is perfectly anticorrelated, to one where the optimal noise is correlated. More generally, we then use numerical optimization methods to demonstrate that there exist anticorrelated noise patterns that optimally enhance synchronization in large complex oscillator networks. Our results may have implications in networks such as power grids and neuronal networks, which are subject to significant amounts of correlated input noise.

Optimal Transport in Multilayer Networks for Traffic Flow Optimization

Modeling traffic distribution and extracting optimal flows in multilayer networks is of the utmost importance to design efficient, multi-modal network infrastructures. Recent results based on optimal transport theory provide powerful and computationally efficient methods to address this problem, but they are mainly focused on modeling single-layer networks. Here, we adapt these results to study how optimal flows distribute on multilayer networks. We propose a model where optimal flows on different layers contribute differently to the total cost to be minimized. This is done by means of a parameter that varies with layers, which allows to flexibly tune the sensitivity to the traffic congestion of the various layers. As an application, we consider transportation networks, where each layer is associated to a different transportation system, and show how the traffic distribution varies as we tune this parameter across layers. We show an example of this result on the real, 2-layer network of the city of Bordeaux with a bus and tram, where we find that in certain regimes, the presence of the tram network significantly unburdens the traffic on the road network. Our model paves the way for further analysis of optimal flows and navigability strategies in real, multilayer networks.